{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XUYCHNXO6F72THSDUUAL3T2WAM","short_pith_number":"pith:XUYCHNXO","schema_version":"1.0","canonical_sha256":"bd3023b6eef17fa99e43a500bdcf56030304bc1eaab03df0fce588ac0a8bff8f","source":{"kind":"arxiv","id":"1407.2036","version":1},"attestation_state":"computed","paper":{"title":"A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Arnaud Mary, Lhouari Nourine, Mamadou Moustapha Kant\\'e, Takeaki Uno, Vincent Limouzy","submitted_at":"2014-07-08T11:17:19Z","abstract_excerpt":"An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing the set of minimal hitting sets in hypergraphs. We give a polynomial delay algorithm to list the set of minimal dominating sets in chordal graphs, an important and well-studied graph class where such an algorithm was open for a while."},"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.2036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:17:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3a15c61152fae81bd7c8d97abc4214c0a12cd6ff9d7c602e832eedcb3d38042d","abstract_canon_sha256":"44717375b3a531c1bdb3232888b87524204922683b19fcd281b22cdcf6926583"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:08.605656Z","signature_b64":"lWW/O8h17hCWsLSVL3IaPDHcgJ9hwk0vB1nXH5N3tD8DvDFqTYi8jEBjimw9Wk0h1kdhme6SKieVPbUHOhrRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd3023b6eef17fa99e43a500bdcf56030304bc1eaab03df0fce588ac0a8bff8f","last_reissued_at":"2026-05-18T02:48:08.604981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:08.604981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Arnaud Mary, Lhouari Nourine, Mamadou Moustapha Kant\\'e, Takeaki Uno, Vincent Limouzy","submitted_at":"2014-07-08T11:17:19Z","abstract_excerpt":"An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing the set of minimal hitting sets in hypergraphs. We give a polynomial delay algorithm to list the set of minimal dominating sets in chordal graphs, an important and well-studied graph class where such an algorithm was open for a while."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2036","kind":"arxiv","version":1},"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.2036","created_at":"2026-05-18T02:48:08.605080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2036v1","created_at":"2026-05-18T02:48:08.605080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2036","created_at":"2026-05-18T02:48:08.605080+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUYCHNXO6F72","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUYCHNXO6F72THSD","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUYCHNXO","created_at":"2026-05-18T12:28:57.508820+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/XUYCHNXO6F72THSDUUAL3T2WAM","json":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM.json","graph_json":"https://pith.science/api/pith-number/XUYCHNXO6F72THSDUUAL3T2WAM/graph.json","events_json":"https://pith.science/api/pith-number/XUYCHNXO6F72THSDUUAL3T2WAM/events.json","paper":"https://pith.science/paper/XUYCHNXO"},"agent_actions":{"view_html":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM","download_json":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM.json","view_paper":"https://pith.science/paper/XUYCHNXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2036&json=true","fetch_graph":"https://pith.science/api/pith-number/XUYCHNXO6F72THSDUUAL3T2WAM/graph.json","fetch_events":"https://pith.science/api/pith-number/XUYCHNXO6F72THSDUUAL3T2WAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/action/storage_attestation","attest_author":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/action/author_attestation","sign_citation":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/action/citation_signature","submit_replication":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/action/replication_record"}},"created_at":"2026-05-18T02:48:08.605080+00:00","updated_at":"2026-05-18T02:48:08.605080+00:00"}