{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SWSW253TWK27YF3LAXX34FKPLG","short_pith_number":"pith:SWSW253T","schema_version":"1.0","canonical_sha256":"95a56d7773b2b5fc176b05efbe154f59a83714bc78460dc62cf98e6ab01c3243","source":{"kind":"arxiv","id":"2205.00086","version":1},"attestation_state":"computed","paper":{"title":"Enumerating Connected Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Benjamin Gras, Faisal Abu-Khzam, Henning Fernau, Kevin Mann, Mathieu Liedloff","submitted_at":"2022-04-29T21:42:08Z","abstract_excerpt":"The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing an enumeration algorithm that runs in time $\\mathcal{O}(1.9896^n)$, using polynomial space only. The key to this result is the consideration of this enumeration problem on 2-degenerate graphs, which is proven to be possible in time $\\mathcal{O}(1.9767^n)$. We also show new lower bound results by constructing a family of graphs of order $n$ with $\\Omega(1.4890"},"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":"2205.00086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-04-29T21:42:08Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"5ec9ebe998f4cbc3631458da430b21fe7ff007ea3b8dc7959df38a921e761178","abstract_canon_sha256":"2afebe8de1725b638cb5a049af7c7bb8aaa3d5756d0703336c7dfa1f2cd729c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:09.560865Z","signature_b64":"/OFgAgXm9IzMgFrkQFlMo4Bpiu8rIvZKmW8mWoqV/qYPXA+uGtCfAGRv+jw5OoRVd7hbyDFVjqn/Pp0dNwI4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95a56d7773b2b5fc176b05efbe154f59a83714bc78460dc62cf98e6ab01c3243","last_reissued_at":"2026-07-05T04:19:09.560518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:09.560518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating Connected Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Benjamin Gras, Faisal Abu-Khzam, Henning Fernau, Kevin Mann, Mathieu Liedloff","submitted_at":"2022-04-29T21:42:08Z","abstract_excerpt":"The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing an enumeration algorithm that runs in time $\\mathcal{O}(1.9896^n)$, using polynomial space only. The key to this result is the consideration of this enumeration problem on 2-degenerate graphs, which is proven to be possible in time $\\mathcal{O}(1.9767^n)$. We also show new lower bound results by constructing a family of graphs of order $n$ with $\\Omega(1.4890"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.00086/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.00086","created_at":"2026-07-05T04:19:09.560576+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00086v1","created_at":"2026-07-05T04:19:09.560576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00086","created_at":"2026-07-05T04:19:09.560576+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWSW253TWK27","created_at":"2026-07-05T04:19:09.560576+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWSW253TWK27YF3L","created_at":"2026-07-05T04:19:09.560576+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWSW253T","created_at":"2026-07-05T04:19:09.560576+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/SWSW253TWK27YF3LAXX34FKPLG","json":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG.json","graph_json":"https://pith.science/api/pith-number/SWSW253TWK27YF3LAXX34FKPLG/graph.json","events_json":"https://pith.science/api/pith-number/SWSW253TWK27YF3LAXX34FKPLG/events.json","paper":"https://pith.science/paper/SWSW253T"},"agent_actions":{"view_html":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG","download_json":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG.json","view_paper":"https://pith.science/paper/SWSW253T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00086&json=true","fetch_graph":"https://pith.science/api/pith-number/SWSW253TWK27YF3LAXX34FKPLG/graph.json","fetch_events":"https://pith.science/api/pith-number/SWSW253TWK27YF3LAXX34FKPLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/action/storage_attestation","attest_author":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/action/author_attestation","sign_citation":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/action/citation_signature","submit_replication":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/action/replication_record"}},"created_at":"2026-07-05T04:19:09.560576+00:00","updated_at":"2026-07-05T04:19:09.560576+00:00"}