{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GGDOIZYY5HEJXL2OMGUK45B5L5","short_pith_number":"pith:GGDOIZYY","schema_version":"1.0","canonical_sha256":"3186e46718e9c89baf4e61a8ae743d5f7e4e4fa3b0e6bb1ecbd32b679ecc3343","source":{"kind":"arxiv","id":"1404.3501","version":3},"attestation_state":"computed","paper":{"title":"Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnaud Mary, Lhouari Nourine, Mamadou Moustapha Kant\\'e, Takeaki Uno, Vincent Limouzy","submitted_at":"2014-04-14T09:16:39Z","abstract_excerpt":"The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size of all its minimal transversals, is a fifty years old open problem, and up to now there are few examples of hypergraph classes where the problem is solved. A minimal dominating set in a graph is a subset of its vertex set that has a non empty intersection with the closed neighborhood of every vertex. It is proved in [M. M. Kant\\'e, V. Limouzy, A. Mary, L. Nourine, On the Enumeration of Minimal Dominating Sets and Rel"},"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":"1404.3501","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T09:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"b425b7a5a62e6dda95eb770f03c35ba65d6c01374e99958e262bfd5dc3f4a9b2","abstract_canon_sha256":"609fb2e3b7cffc141cfd1c3b832328dff5599b0a36e3f16de0e271f736a0d732"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:09.367971Z","signature_b64":"APooi6zQG5NUYSyvl9RDXg3UKUqwSOZam24cyvYcG14CMheEdObirNzVULKNU/beBfiI8gVfmAPvGvR0FvpuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3186e46718e9c89baf4e61a8ae743d5f7e4e4fa3b0e6bb1ecbd32b679ecc3343","last_reissued_at":"2026-05-18T02:48:09.367508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:09.367508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnaud Mary, Lhouari Nourine, Mamadou Moustapha Kant\\'e, Takeaki Uno, Vincent Limouzy","submitted_at":"2014-04-14T09:16:39Z","abstract_excerpt":"The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size of all its minimal transversals, is a fifty years old open problem, and up to now there are few examples of hypergraph classes where the problem is solved. A minimal dominating set in a graph is a subset of its vertex set that has a non empty intersection with the closed neighborhood of every vertex. It is proved in [M. M. Kant\\'e, V. Limouzy, A. Mary, L. Nourine, On the Enumeration of Minimal Dominating Sets and Rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3501","kind":"arxiv","version":3},"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":"1404.3501","created_at":"2026-05-18T02:48:09.367574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3501v3","created_at":"2026-05-18T02:48:09.367574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3501","created_at":"2026-05-18T02:48:09.367574+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGDOIZYY5HEJ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGDOIZYY5HEJXL2O","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGDOIZYY","created_at":"2026-05-18T12:28:30.664211+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/GGDOIZYY5HEJXL2OMGUK45B5L5","json":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5.json","graph_json":"https://pith.science/api/pith-number/GGDOIZYY5HEJXL2OMGUK45B5L5/graph.json","events_json":"https://pith.science/api/pith-number/GGDOIZYY5HEJXL2OMGUK45B5L5/events.json","paper":"https://pith.science/paper/GGDOIZYY"},"agent_actions":{"view_html":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5","download_json":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5.json","view_paper":"https://pith.science/paper/GGDOIZYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3501&json=true","fetch_graph":"https://pith.science/api/pith-number/GGDOIZYY5HEJXL2OMGUK45B5L5/graph.json","fetch_events":"https://pith.science/api/pith-number/GGDOIZYY5HEJXL2OMGUK45B5L5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5/action/storage_attestation","attest_author":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5/action/author_attestation","sign_citation":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5/action/citation_signature","submit_replication":"https://pith.science/pith/GGDOIZYY5HEJXL2OMGUK45B5L5/action/replication_record"}},"created_at":"2026-05-18T02:48:09.367574+00:00","updated_at":"2026-05-18T02:48:09.367574+00:00"}