{"provider":{"host":"decision-solver.use.x402atlas.com","name":"Bounded Decision Solver","score":62.9,"live":true,"checkedAt":"2026-10-27T19:04:09.403Z","uptime72h":100,"lastCheck":{"httpStatus":402,"ms":476,"note":"valid x402 v2 terms"},"endpoints":4,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"cheapestUsd":"0.005","income7dUsd":"2.115","payers7d":23,"transfers7d":187,"payoutAddressShared":true,"claimed":false,"page":"https://logicnodes.io/observatory/p/decision-solver.use.x402atlas.com"},"endpoints":[{"url":"https://decision-solver.use.x402atlas.com/assignment","method":"POST","priceMicroUsd":5000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate."},{"url":"https://decision-solver.use.x402atlas.com/bin-pack","method":"POST","priceMicroUsd":5000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound."},{"url":"https://decision-solver.use.x402atlas.com/interval-schedule","method":"POST","priceMicroUsd":5000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"Weighted interval scheduling solver — exact maximum-weight compatible job scheduling with half-open intervals and a complete dynamic-programming certificate."},{"url":"https://decision-solver.use.x402atlas.com/knapsack","method":"POST","priceMicroUsd":5000,"networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"description":"0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence."}]}