{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XUYCHNXO6F72THSDUUAL3T2WAM","short_pith_number":"pith:XUYCHNXO","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"},"canonical_sha256":"bd3023b6eef17fa99e43a500bdcf56030304bc1eaab03df0fce588ac0a8bff8f","source":{"kind":"arxiv","id":"1407.2036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2036","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2036v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2036","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"XUYCHNXO6F72","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XUYCHNXO6F72THSD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XUYCHNXO","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XUYCHNXO6F72THSDUUAL3T2WAM","target":"record","payload":{"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"},"canonical_sha256":"bd3023b6eef17fa99e43a500bdcf56030304bc1eaab03df0fce588ac0a8bff8f","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"},"source_kind":"arxiv","source_id":"1407.2036","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4ESzsywZiRmP4P2Wr9s+rVfwCfUhR+1NcI3ua6liNqJhE2qrx3PDbeUuT+UWX9467hQKRt5Dk7xINeDNb/ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:59:02.504912Z"},"content_sha256":"389762ff75cf70552001442445d1d4487ba923d727a512a7f20e7a366ca015e7","schema_version":"1.0","event_id":"sha256:389762ff75cf70552001442445d1d4487ba923d727a512a7f20e7a366ca015e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XUYCHNXO6F72THSDUUAL3T2WAM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkIA9hh27hmJ7mb7UydM8HmpeAeSUgrR1e67TH4FQ5GzuZjvZMcSBklcxUZXNLVsCwRVIhtWeKrrByfDADjaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:59:02.505548Z"},"content_sha256":"3bee07a4b6ae23d526be4191283f1487c6a9dbcdc61dfeb12e1f6a1f9decf3a7","schema_version":"1.0","event_id":"sha256:3bee07a4b6ae23d526be4191283f1487c6a9dbcdc61dfeb12e1f6a1f9decf3a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/bundle.json","state_url":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUYCHNXO6F72THSDUUAL3T2WAM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T05:59:02Z","links":{"resolver":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM","bundle":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/bundle.json","state":"https://pith.science/pith/XUYCHNXO6F72THSDUUAL3T2WAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUYCHNXO6F72THSDUUAL3T2WAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XUYCHNXO6F72THSDUUAL3T2WAM","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":"44717375b3a531c1bdb3232888b87524204922683b19fcd281b22cdcf6926583","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:17:19Z","title_canon_sha256":"3a15c61152fae81bd7c8d97abc4214c0a12cd6ff9d7c602e832eedcb3d38042d"},"schema_version":"1.0","source":{"id":"1407.2036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2036","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2036v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2036","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"XUYCHNXO6F72","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XUYCHNXO6F72THSD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XUYCHNXO","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:3bee07a4b6ae23d526be4191283f1487c6a9dbcdc61dfeb12e1f6a1f9decf3a7","target":"graph","created_at":"2026-05-18T02:48:08Z","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":"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.","authors_text":"Arnaud Mary, Lhouari Nourine, Mamadou Moustapha Kant\\'e, Takeaki Uno, Vincent Limouzy","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:17:19Z","title":"A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2036","kind":"arxiv","version":1},"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:389762ff75cf70552001442445d1d4487ba923d727a512a7f20e7a366ca015e7","target":"record","created_at":"2026-05-18T02:48:08Z","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":"44717375b3a531c1bdb3232888b87524204922683b19fcd281b22cdcf6926583","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:17:19Z","title_canon_sha256":"3a15c61152fae81bd7c8d97abc4214c0a12cd6ff9d7c602e832eedcb3d38042d"},"schema_version":"1.0","source":{"id":"1407.2036","kind":"arxiv","version":1}},"canonical_sha256":"bd3023b6eef17fa99e43a500bdcf56030304bc1eaab03df0fce588ac0a8bff8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd3023b6eef17fa99e43a500bdcf56030304bc1eaab03df0fce588ac0a8bff8f","first_computed_at":"2026-05-18T02:48:08.604981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:08.604981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lWW/O8h17hCWsLSVL3IaPDHcgJ9hwk0vB1nXH5N3tD8DvDFqTYi8jEBjimw9Wk0h1kdhme6SKieVPbUHOhrRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:08.605656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:389762ff75cf70552001442445d1d4487ba923d727a512a7f20e7a366ca015e7","sha256:3bee07a4b6ae23d526be4191283f1487c6a9dbcdc61dfeb12e1f6a1f9decf3a7"],"state_sha256":"c95effeb465136b98953e9b3daf8efb424bf0872bfd5fad4ea38ab2b4a1bf093"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjMQdZlwdb676U+7QlWBjDHmaFxuNE4Os2BWwkn1AY1bEfpJPbagwoGOzeVqcew0+s8W7xKDMV/ylp/nd/8sBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:59:02.508626Z","bundle_sha256":"0c1b4403202872a21474ef7a9c3d315dfc3ec2fbf80a646f095ceafc8c4af3e9"}}