{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GGDOIZYY5HEJXL2OMGUK45B5L5","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":"609fb2e3b7cffc141cfd1c3b832328dff5599b0a36e3f16de0e271f736a0d732","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T09:16:39Z","title_canon_sha256":"b425b7a5a62e6dda95eb770f03c35ba65d6c01374e99958e262bfd5dc3f4a9b2"},"schema_version":"1.0","source":{"id":"1404.3501","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3501","created_at":"2026-05-18T02:48:09Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3501v3","created_at":"2026-05-18T02:48:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3501","created_at":"2026-05-18T02:48:09Z"},{"alias_kind":"pith_short_12","alias_value":"GGDOIZYY5HEJ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GGDOIZYY5HEJXL2O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GGDOIZYY","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:adb89fa707e49fd61d5f108d792f964ce96abe4f0b8a5507cb183862e0e6a3ed","target":"graph","created_at":"2026-05-18T02:48:09Z","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 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","authors_text":"Arnaud Mary, Lhouari Nourine, Mamadou Moustapha Kant\\'e, Takeaki Uno, Vincent Limouzy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T09:16:39Z","title":"Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3501","kind":"arxiv","version":3},"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:851338e3d6a262488999ea4cbdc507ba5d98451442101785ae3d9c031fb94303","target":"record","created_at":"2026-05-18T02:48:09Z","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":"609fb2e3b7cffc141cfd1c3b832328dff5599b0a36e3f16de0e271f736a0d732","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T09:16:39Z","title_canon_sha256":"b425b7a5a62e6dda95eb770f03c35ba65d6c01374e99958e262bfd5dc3f4a9b2"},"schema_version":"1.0","source":{"id":"1404.3501","kind":"arxiv","version":3}},"canonical_sha256":"3186e46718e9c89baf4e61a8ae743d5f7e4e4fa3b0e6bb1ecbd32b679ecc3343","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3186e46718e9c89baf4e61a8ae743d5f7e4e4fa3b0e6bb1ecbd32b679ecc3343","first_computed_at":"2026-05-18T02:48:09.367508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:09.367508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"APooi6zQG5NUYSyvl9RDXg3UKUqwSOZam24cyvYcG14CMheEdObirNzVULKNU/beBfiI8gVfmAPvGvR0FvpuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:09.367971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3501","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:851338e3d6a262488999ea4cbdc507ba5d98451442101785ae3d9c031fb94303","sha256:adb89fa707e49fd61d5f108d792f964ce96abe4f0b8a5507cb183862e0e6a3ed"],"state_sha256":"055f7ea53c81d5b2e0959eec6f22be1071e93b1ef400a0eb828a763194066346"}