{"slug":"www-mahastrategies-com-api-v1-verify-provenance-graph-integr-af5c68","title":"Inspect a declared dependency graph of up to 64 nodes and 128 edges","host":"www.mahastrategies.com","method":"POST","resource":"https://www.mahastrategies.com/api/v1/verify/provenance/graph-integrity","category":"other","description":"Inspect a declared dependency graph of up to 64 nodes and 128 edges: exact cycle membership, source-root reachability, and deterministic graph digest. Duplicate edges and dangling references are rejected. Hash declarations are not authenticated. New modular adapter: retained result recovery for 24 h","price_listed":0.035004,"price_asked":0.035004,"state":"answering","state_label":"Answering","checks_7d":1,"answered_7d":1,"latency_ms_median":322,"reported_calls_30d":1,"reported_payers_30d":1,"networks":["eip155:8453"],"badge":"unverified","paid_checks_7d":0,"paid_ok_7d":0,"example_input":{"body":{"dataClass":"synthetic","edges":[{"edgeId":"e1","from":"p1","relation":"derived-from","to":"s1"}],"nodes":[{"digestHash":"sha256:41cf6794ba4200b839c53531555f0f3998df4cbb01a4d5cb0b94e3ca5e23947d","kind":"source","nodeId":"s1"},{"digestHash":"sha256:0886b051075687c18a9ae5075383feb8400fbe4328c6e4bd45b77b30f1e73b54","kind":"passage","nodeId":"p1"}]},"bodyType":"json","method":"POST","type":"http"},"output_schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"body":{"additionalProperties":false,"properties":{"dataClass":{"enum":["public","synthetic"],"type":"string"},"edges":{"maxItems":128,"minItems":0,"type":"array"},"nodes":{"maxItems":64,"minItems":1,"type":"array"}},"required":["dataClass","nodes","edges"],"type":"object"},"bodyType":{"enum":["json","form-data","text"],"type":"string"},"method":{"enum":["POST"],"type":"string"},"type":{"const":"http","type":"string"}},"required":["type","method","bodyType","body"],"type":"object"},"output":{"properties":{"example":{"additionalProperties":false,"properties":{"data":{"type":"object"},"proof":{"type":"object"},"success":{"const":true}},"required":["success","data","proof"],"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"},"history":[{"day":"2026-10-18","reachable":true,"status":402,"valid_402":true,"asked_usdc":0.035004,"price_match":true,"latency_ms":322,"error":null}],"description_full":"Inspect a declared dependency graph of up to 64 nodes and 128 edges: exact cycle membership, source-root reachability, and deterministic graph digest. Duplicate edges and dangling references are rejected. Hash declarations are not authenticated. New modular adapter: retained result recovery for 24 hours, minimal receipt metadata for 90 days. Existing live route unchanged.","last_updated":"2026-10-14T06:51:37.141Z","schemes":["exact"]}