{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:SWSW253TWK27YF3LAXX34FKPLG","short_pith_number":"pith:SWSW253T","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"},"canonical_sha256":"95a56d7773b2b5fc176b05efbe154f59a83714bc78460dc62cf98e6ab01c3243","source":{"kind":"arxiv","id":"2205.00086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00086","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00086v1","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00086","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"SWSW253TWK27","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"pith_short_16","alias_value":"SWSW253TWK27YF3L","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"pith_short_8","alias_value":"SWSW253T","created_at":"2026-07-05T04:19:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:SWSW253TWK27YF3LAXX34FKPLG","target":"record","payload":{"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"},"canonical_sha256":"95a56d7773b2b5fc176b05efbe154f59a83714bc78460dc62cf98e6ab01c3243","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"},"source_kind":"arxiv","source_id":"2205.00086","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-07-05T04:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZ3sma6n6DG6TR+c001JjZYZMPjnsPkinuvJ5M2nZ3Y/GsgRnkbKz1rRCywhS0+AuVj3xzZ6efBZMCzRhxr9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T02:16:52.443554Z"},"content_sha256":"503a5b03661d4320af65f2f7108eb98aa248c41aea8eebd29a13fc48c7ed6a54","schema_version":"1.0","event_id":"sha256:503a5b03661d4320af65f2f7108eb98aa248c41aea8eebd29a13fc48c7ed6a54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:SWSW253TWK27YF3LAXX34FKPLG","target":"graph","payload":{"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"},"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-07-05T04:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGuyLgvYBAKDGO9b2A3WK5J5xIltHtYeN+uq0FEwCETs7MZK9yrdq0Bq/GMBAQVIjZfyzTsJCn1uLCp0KTcFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T02:16:52.443923Z"},"content_sha256":"587673b0b604197cad383e9d1aa84294e139e6ca556ed4e0266d495eaa574c69","schema_version":"1.0","event_id":"sha256:587673b0b604197cad383e9d1aa84294e139e6ca556ed4e0266d495eaa574c69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/bundle.json","state_url":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWSW253TWK27YF3LAXX34FKPLG/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-07-10T02:16:52Z","links":{"resolver":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG","bundle":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/bundle.json","state":"https://pith.science/pith/SWSW253TWK27YF3LAXX34FKPLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWSW253TWK27YF3LAXX34FKPLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SWSW253TWK27YF3LAXX34FKPLG","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":"2afebe8de1725b638cb5a049af7c7bb8aaa3d5756d0703336c7dfa1f2cd729c0","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-04-29T21:42:08Z","title_canon_sha256":"5ec9ebe998f4cbc3631458da430b21fe7ff007ea3b8dc7959df38a921e761178"},"schema_version":"1.0","source":{"id":"2205.00086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00086","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00086v1","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00086","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"SWSW253TWK27","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"pith_short_16","alias_value":"SWSW253TWK27YF3L","created_at":"2026-07-05T04:19:09Z"},{"alias_kind":"pith_short_8","alias_value":"SWSW253T","created_at":"2026-07-05T04:19:09Z"}],"graph_snapshots":[{"event_id":"sha256:587673b0b604197cad383e9d1aa84294e139e6ca556ed4e0266d495eaa574c69","target":"graph","created_at":"2026-07-05T04:19: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.00086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Benjamin Gras, Faisal Abu-Khzam, Henning Fernau, Kevin Mann, Mathieu Liedloff","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-04-29T21:42:08Z","title":"Enumerating Connected Dominating Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00086","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:503a5b03661d4320af65f2f7108eb98aa248c41aea8eebd29a13fc48c7ed6a54","target":"record","created_at":"2026-07-05T04:19: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":"2afebe8de1725b638cb5a049af7c7bb8aaa3d5756d0703336c7dfa1f2cd729c0","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-04-29T21:42:08Z","title_canon_sha256":"5ec9ebe998f4cbc3631458da430b21fe7ff007ea3b8dc7959df38a921e761178"},"schema_version":"1.0","source":{"id":"2205.00086","kind":"arxiv","version":1}},"canonical_sha256":"95a56d7773b2b5fc176b05efbe154f59a83714bc78460dc62cf98e6ab01c3243","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95a56d7773b2b5fc176b05efbe154f59a83714bc78460dc62cf98e6ab01c3243","first_computed_at":"2026-07-05T04:19:09.560518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:19:09.560518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OFgAgXm9IzMgFrkQFlMo4Bpiu8rIvZKmW8mWoqV/qYPXA+uGtCfAGRv+jw5OoRVd7hbyDFVjqn/Pp0dNwI4AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:19:09.560865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.00086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:503a5b03661d4320af65f2f7108eb98aa248c41aea8eebd29a13fc48c7ed6a54","sha256:587673b0b604197cad383e9d1aa84294e139e6ca556ed4e0266d495eaa574c69"],"state_sha256":"33eaf81e6d4713c3c4c7b90c6e70ee6511d71cfc0292f505db53c3069a3bb6d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nTOu3uq2iqyJDFsMMX1kit1+9tTpaPdCGeAs8/2bjtHcJqlii9fzS1KGoOWzQIJOXdh0jpsU9YrP8apcz4mQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T02:16:52.445850Z","bundle_sha256":"4791954755ec73796c922855e756cd60d26d52b85c91b89a32077b214305cb40"}}