An agent that factorizes a supplied undirected dependency graph needs its claime...

{ "body": { "artifact": { "claimed_chordal": true, "edges": [ { "u": 0, "v": 1 }, { "u": 1, "v": 3 }, { "u": 3, "v": 4 } ], "vertices": 5 } }, "bodyType": "json", "method": "POST", "type": "http" }

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [ { "page_indices": [], "page_url": null, "pattern": "workflow-chordal-dependency-graph_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.", "Complete simple undirected graph, at most64 vertices and2048 edges. Chordal means every cycle of length at least4 has a chord. Maximum-cardinality search followed by complete later-neighbor clique tests; no scheduler execution or inferred missing edges." ], "module": "workflow-chordal-dependency-graph", "module_cpu_ms": 0, "state": "not_observed", "value": { "chordal": true, "claimed_chordality_matches": true, "dependency_edges": 3, "dependency_vertices": 5, "elimination_violation_vertices": 0 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }