Prüft eine vollständig gelieferte endliche Unabhängigkeitsfamilie gegen die drei...

{ "body": { "artifact": { "claims": { "augmentation": true, "empty_set_present": true, "ground_elements": 6, "hereditary": true, "independent_sets": 22, "is_matroid": true, "maximum_cardinality": 2 }, "ground_set": [ "element-0", "element-1", "element-2", "element-3", "element-4", "element-5" ], "independent_sets": [ [], [ 0 ], [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ], [ 0, 1 ], [ 0, 2 ], [ 0, 3 ], [ 0, 4 ], [ 0, 5 ], [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 1, 5 ], [ 2, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ], [ 4, 5 ] ] } }, "bodyType": "json", "method": "POST", "type": "http" }

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [], "limits": [ "Finite matroid independence axioms I1–I3: empty set, every subset of each independent set, and strict-cardinality augmentation. Single-deletion closure is equivalent to all-subset closure on the finite supplied family.", "Closed COMPLETE independent-family inventory on a supplied finite ground set; not inference from sampled sets, a greedy basis solver, representability, graph connectivity, optimization or certification of an external system. Maximum16elements/256members; set/member order has no semantic effect.", "Only bounded aggregate counts and booleans returned. Ground labels, members, failed witnesses and caller claims are never returned. All discrete claims compare exactly, including fractional claims." ], "module": "finite-matroid-independent-family-axioms", "state": "not_observed", "value": { "augmentation": true, "claim_mismatches": 0, "claims_match": true, "empty_set_present": true, "ground_elements": 6, "hereditary": true, "independent_sets": 22, "is_matroid": true, "maximum_cardinality": 2 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }