{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VT6FQN6MLXZEAI3D254F3IDEN3","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":"c3eed9901c65ed6045dd81ae598f708ad1ea635785434c74a3d2cb7e4a443f6c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-11T16:59:16Z","title_canon_sha256":"2d882741dc1db20e0bd9f00c134993b4c8950d59a864e3f9e1c83426347fae69"},"schema_version":"1.0","source":{"id":"2305.06974","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.06974","created_at":"2026-07-05T08:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"2305.06974v4","created_at":"2026-07-05T08:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06974","created_at":"2026-07-05T08:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"VT6FQN6MLXZE","created_at":"2026-07-05T08:10:13Z"},{"alias_kind":"pith_short_16","alias_value":"VT6FQN6MLXZEAI3D","created_at":"2026-07-05T08:10:13Z"},{"alias_kind":"pith_short_8","alias_value":"VT6FQN6M","created_at":"2026-07-05T08:10:13Z"}],"graph_snapshots":[{"event_id":"sha256:83ec2f991a5170639c50e55eee7001b705de99f37a9f6d16313d8e67ada0cdd3","target":"graph","created_at":"2026-07-05T08:10:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.06974/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"At STOC 2002, Eiter, Gottlob, and Makino presented a technique called ordered generation that yields an $n^{O(d)}$-delay algorithm listing all minimal transversals of an $n$-vertex hypergraph of degeneracy $d$. Recently at IWOCA 2019, Conte, Kant\\'e, Marino, and Uno asked whether this XP-delay algorithm parameterized by $d$ could be made FPT-delay for a weaker notion of degeneracy, or even parameterized by the maximum degree $\\Delta$, i.e., whether it can be turned into an algorithm with delay $f(\\Delta)\\cdot n^{O(1)}$ for some computable function $f$. Moreover, and as a first step toward answ","authors_text":"Fionn Mc Inerney, Oscar Defrain, Valentin Bartier","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-11T16:59:16Z","title":"Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06974","kind":"arxiv","version":4},"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:0047935aa70748b81973f2c31e4a146facdd968db5aed4bf440f42c917fb42a1","target":"record","created_at":"2026-07-05T08:10:13Z","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":"c3eed9901c65ed6045dd81ae598f708ad1ea635785434c74a3d2cb7e4a443f6c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-11T16:59:16Z","title_canon_sha256":"2d882741dc1db20e0bd9f00c134993b4c8950d59a864e3f9e1c83426347fae69"},"schema_version":"1.0","source":{"id":"2305.06974","kind":"arxiv","version":4}},"canonical_sha256":"acfc5837cc5df2402363d7785da0646ecc48f5aac03c1ff4cd9b55b1c5265ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acfc5837cc5df2402363d7785da0646ecc48f5aac03c1ff4cd9b55b1c5265ea2","first_computed_at":"2026-07-05T08:10:13.740019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:10:13.740019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yz7jNq1ScQITMHmtuTk8hhz24BVLxI7NEMQvSBHnlHmy0sWv2lQ0JrPMkxzTyNacMZmr3noO5GEdmKNZAIb8BA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:10:13.740414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.06974","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0047935aa70748b81973f2c31e4a146facdd968db5aed4bf440f42c917fb42a1","sha256:83ec2f991a5170639c50e55eee7001b705de99f37a9f6d16313d8e67ada0cdd3"],"state_sha256":"3a2e1fe81134ec236a20b9664ee895e71edd7282c92f81e30a0542a6727f4859"}