{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G7AQNZDTQ3NMIVFRVZBR7POIQ7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"04ea681867c3272655f5e6a702d2ab4c3dbd99656db1ea56c58c35293986e012","cross_cats_sorted":["cs.DS","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:28:11Z","title_canon_sha256":"cb11bc5e3f4ed496dde42cb854f1a25588349e569cdfdaa7b1314141934e63b6"},"schema_version":"1.0","source":{"id":"1407.2912","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2912","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2912v4","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2912","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"G7AQNZDTQ3NM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G7AQNZDTQ3NMIVFR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G7AQNZDT","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:2655163684738e38d3beaff1726e0c210bb4f808ea29114ee3b540216ac3a9d5","target":"graph","created_at":"2026-05-17T23:50:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The hypergraph duality problem DUAL is defined as follows: given two simple hypergraphs $\\mathcal{G}$ and $\\mathcal{H}$, decide whether $\\mathcal{H}$ consists precisely of all minimal transversals of $\\mathcal{G}$ (in which case we say that $\\mathcal{G}$ is the dual of $\\mathcal{H}$). This problem is equivalent to deciding whether two given non-redundant monotone DNFs are dual. It is known that non-DUAL, the complementary problem to DUAL, is in $\\mathrm{GC}(\\log^2 n,\\mathrm{PTIME})$, where $\\mathrm{GC}(f(n),\\mathcal{C})$ denotes the complexity class of all problems that after a nondeterministi","authors_text":"Enrico Malizia, Georg Gottlob","cross_cats":["cs.DS","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:28:11Z","title":"Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2912","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:532c1e577006b42d97f0fe9d31fe827e3cdfb0f0435dbf834f17dda89be8f62c","target":"record","created_at":"2026-05-17T23:50:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"04ea681867c3272655f5e6a702d2ab4c3dbd99656db1ea56c58c35293986e012","cross_cats_sorted":["cs.DS","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:28:11Z","title_canon_sha256":"cb11bc5e3f4ed496dde42cb854f1a25588349e569cdfdaa7b1314141934e63b6"},"schema_version":"1.0","source":{"id":"1407.2912","kind":"arxiv","version":4}},"canonical_sha256":"37c106e47386dac454b1ae431fbdc887ff090ab282f00e238456acb25a830d84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37c106e47386dac454b1ae431fbdc887ff090ab282f00e238456acb25a830d84","first_computed_at":"2026-05-17T23:50:47.474815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:47.474815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"El9eMrR+tPX0ymJQNPBGnAl016rHkey1QuuksG0MNZHSv2obntCYIXOrr8CaaW34+MghH9qC5x0Ptv1POudYAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:47.475512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2912","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:532c1e577006b42d97f0fe9d31fe827e3cdfb0f0435dbf834f17dda89be8f62c","sha256:2655163684738e38d3beaff1726e0c210bb4f808ea29114ee3b540216ac3a9d5"],"state_sha256":"81832c91644af0b2358525bf96aa4f591fa4b4059a912b751cd03260a0ade2cd"}