An agent that exports an independent loop basis for an undirected integration gr...

{ "body": { "artifact": { "claimed_cost": 0, "edges": [ { "cost": 6, "u": 0, "v": 1 }, { "cost": 2, "u": 1, "v": 2 } ], "vertices": 3 } }, "bodyType": "json", "method": "POST", "type": "http" }

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [ { "page_indices": [], "page_url": null, "pattern": "workflow-minimum-cycle-basis-cost_scoped_evidence", "type": "artifact" } ], "limits": [ "Only the explicit bounded artifact is measured. No retrieval, execution, real credential validation, contact output or legal/security/quality judgement.", "Simple undirected weighted graph, at most8 vertices and18 edges. All simple cycles are enumerated and a minimum-weight GF2 basis is selected; disconnected components and zero-cost edges supported. Enumeration work above200000 is unknown. No physical network observations." ], "module": "workflow-minimum-cycle-basis-cost", "module_cpu_ms": 0, "state": "not_observed", "value": { "binary_cycle_rank": 0, "claimed_basis_cost_matches": true, "connected_components": 1, "graph_edges": 2, "graph_vertices": 3, "minimum_basis_cost": 0 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }