{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G7AQNZDTQ3NMIVFRVZBR7POIQ7","short_pith_number":"pith:G7AQNZDT","schema_version":"1.0","canonical_sha256":"37c106e47386dac454b1ae431fbdc887ff090ab282f00e238456acb25a830d84","source":{"kind":"arxiv","id":"1407.2912","version":4},"attestation_state":"computed","paper":{"title":"Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Enrico Malizia, Georg Gottlob","submitted_at":"2014-07-10T19:28:11Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.2912","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:28:11Z","cross_cats_sorted":["cs.DS","cs.LO"],"title_canon_sha256":"cb11bc5e3f4ed496dde42cb854f1a25588349e569cdfdaa7b1314141934e63b6","abstract_canon_sha256":"04ea681867c3272655f5e6a702d2ab4c3dbd99656db1ea56c58c35293986e012"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:47.475512Z","signature_b64":"El9eMrR+tPX0ymJQNPBGnAl016rHkey1QuuksG0MNZHSv2obntCYIXOrr8CaaW34+MghH9qC5x0Ptv1POudYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c106e47386dac454b1ae431fbdc887ff090ab282f00e238456acb25a830d84","last_reissued_at":"2026-05-17T23:50:47.474815Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:47.474815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Enrico Malizia, Georg Gottlob","submitted_at":"2014-07-10T19:28:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2912","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.2912","created_at":"2026-05-17T23:50:47.474912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2912v4","created_at":"2026-05-17T23:50:47.474912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2912","created_at":"2026-05-17T23:50:47.474912+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7AQNZDTQ3NM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7AQNZDTQ3NMIVFR","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7AQNZDT","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7","json":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7.json","graph_json":"https://pith.science/api/pith-number/G7AQNZDTQ3NMIVFRVZBR7POIQ7/graph.json","events_json":"https://pith.science/api/pith-number/G7AQNZDTQ3NMIVFRVZBR7POIQ7/events.json","paper":"https://pith.science/paper/G7AQNZDT"},"agent_actions":{"view_html":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7","download_json":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7.json","view_paper":"https://pith.science/paper/G7AQNZDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2912&json=true","fetch_graph":"https://pith.science/api/pith-number/G7AQNZDTQ3NMIVFRVZBR7POIQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/G7AQNZDTQ3NMIVFRVZBR7POIQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7/action/storage_attestation","attest_author":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7/action/author_attestation","sign_citation":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7/action/citation_signature","submit_replication":"https://pith.science/pith/G7AQNZDTQ3NMIVFRVZBR7POIQ7/action/replication_record"}},"created_at":"2026-05-17T23:50:47.474912+00:00","updated_at":"2026-05-17T23:50:47.474912+00:00"}