{"uid":"cap_r2wpzoU1-c8mHuSiu9lGA","slug":"provenance-graph-integrity-check-49a2e15a","name":"Provenance Graph Integrity Check","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.","url":"https://www.mahastrategies.com/api/v1/micro/provenance-graph-integrity?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","$schema":"https://json-schema.org/draft/2020-12/schema","required":["input"],"properties":{"input":{"type":"object","required":["type","method","bodyType","body"],"properties":{"body":{"type":"object","required":["dataClass","nodes","edges"],"properties":{"edges":{"type":"array","maxItems":128,"minItems":0},"nodes":{"type":"array","maxItems":64,"minItems":1},"dataClass":{"enum":["public","synthetic"],"type":"string"}},"additionalProperties":false},"type":{"type":"string","const":"http"},"method":{"enum":["POST"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false},"output":{"type":"object","required":["type"],"properties":{"type":{"type":"string"},"example":{"type":"object","required":["version","offerId","amountBaseUnits","inputDigest","result","boundaries","receiptDigest"],"properties":{"result":{"type":"object"},"offerId":{"enum":["provenance-graph-integrity"],"type":"string"},"version":{"enum":["maha-microproducts/0.1"],"type":"string"},"boundaries":{"type":"array","maxItems":128,"minItems":0},"inputDigest":{"type":"string","maxLength":71},"receiptDigest":{"type":"string","maxLength":71},"amountBaseUnits":{"enum":["32500"],"type":"string"}},"additionalProperties":false}}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.0325","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.0325/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.0325","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.0325","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_2gHA3JCm4lPFLG_zNDVTv","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.0325","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Validates a declared dependency graph (up to 64 nodes, 128 edges) for cycle membership, source-root reachability, and produces a deterministic graph digest, rejecting duplicate edges and dangling references.","exampleAgentPrompt":"Check this provenance graph for cycles and reachability — it has 12 nodes and 20 edges, all public data. Tell me which nodes are part of cycles, which are unreachable from the source root, and give me the deterministic digest of the graph.","exampleUseCases":[{"title":"Software build dependency audit","prompt":"I have a build dependency graph with 30 nodes and 45 edges — can you check it for any circular dependencies and confirm all packages are reachable from the root? Mark the data class as 'public' and give me the graph digest."},{"title":"Artifact provenance chain validation","prompt":"Before we publish this release, validate the provenance graph for our artifact pipeline — 15 nodes, 22 edges, data class 'synthetic'. I need to know if there are any cycles or dangling references that would break traceability."},{"title":"ML model lineage graph integrity check","prompt":"Run an integrity check on our model lineage graph — it has 8 nodes and 10 edges, public data class. Tell me which nodes form cycles, whether all steps are reachable from the original dataset node, and return the deterministic digest."}],"resultDescription":"Returns a structured result including: cycle membership (which nodes/edges are in cycles), source-root reachability status per node, a deterministic graph digest (inputDigest), a list of boundary elements, a receipt digest for auditability, and the offer/version metadata. Duplicate edges or dangling references cause the request to be rejected with an error.","failureModes":["Duplicate edges in the input cause rejection with a validation error","Dangling references (edges pointing to nonexistent nodes) are rejected","Exceeding 64 nodes or 128 edges returns a schema validation error","Hash declarations are not authenticated — incorrect hashes are not flagged as fraudulent","Malformed node or edge arrays cause a parsing error","Empty node array (minItems:1 violated) returns an error"],"whenToPreferThis":"Use this endpoint when you need a lightweight, deterministic, single-call validation of a small-to-medium dependency or provenance graph (≤64 nodes, ≤128 edges) that must produce a canonical graph digest alongside structural analysis. Prefer it over general-purpose graph libraries when you need an auditable receipt and reproducible digest for compliance or supply-chain traceability workflows. Not suitable for graphs exceeding size limits, authenticated hash verification, or dynamic graph monitoring.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-11-16T12:46:25.328Z","isFirstParty":false,"canonicalSlug":"provenance-graph-integrity-check-49a2e15a"}