Prüft die behauptete vollständige Blockerfamilie aller inklusionsminimalen Treff...

{ "body": { "artifact": { "claimed_family": [ [ 0, 2 ], [ 0, 3 ], [ 0, 4 ], [ 1, 2 ], [ 1, 3 ], [ 1, 4 ] ], "claims": { "clutter_edges": 2, "maximum_transversal_size": 2, "transversal_sets": 6, "vertices": 5 }, "edges": [ [ 0, 1 ], [ 2, 3, 4 ] ], "vertices": 5 } }, "bodyType": "json", "method": "POST", "type": "http" }

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [], "limits": [ "Kavvadias/Stavropoulos JGAA9(2)2005 Algorithm1/Eqs6–7: blocker/transversal hypergraph consists of ALL inclusion-minimal sets intersecting every edge; Berge incrementally joins singleton choices for each edge then removes proper supersets. Own bitmask expansion and subset-zeta proper-subset pruning; no cover/dualization SDK.", "Bounded finite hypergraph0..12ordinal vertices, at most64edges. Edge/member duplicates have set semantics, dominated supersets removed to inputclutter. Claimedfamily is compared as a set ofsets, not minimized: any extra nonminimal member, missing legitimate larger minimal member or wrongvertex makes mismatch. Sourceempty hypergraph has blocker{emptyset}; sourceemptyedge has no transversals.", "Maximum claimed1024sets, each atmost12members. Input source indices must be integral0..n−1 orwholeunknown; falsefractional/outofground claimedindices are knownmismatches, exactcounter comparisons without epsilon. Own every-produced-set coverage and deletion-minimality checks supplement complete incremental construction.", "This is complete INCLUSION-minimal family dualization, including differing cardinalities, not a minimum-cardinality/minimum-cost cover, selected bundle plan, fractional cover or acyclicity verdict. No per-weight/domain/format variants, real service selection or price/capability truth inferred.", "Only bounded vertex/clutter/family-size counts and matchbool output. No hyperedges/transversals, source/claim vertexIDs, bitmasks, caller counters or exception strings returned, including false phone-shaped claimed indices/counters. No identity/contact/security/legal judgment." ], "module": "hypergraph-blocker-complete-minimal-transversal-family", "state": "not_observed", "value": { "claim_mismatches": 0, "claims_match": true, "clutter_edges": 2, "family_claim_matches": true, "maximum_transversal_size": 2, "transversal_sets": 6, "vertices": 5 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }