{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S32LXPZFVBZHMFHQZUUOZOICLP","short_pith_number":"pith:S32LXPZF","schema_version":"1.0","canonical_sha256":"96f4bbbf25a8727614f0cd28ecb9025bc7972e814c5b8ae0c6a7dff9205c770c","source":{"kind":"arxiv","id":"1611.00840","version":1},"attestation_state":"computed","paper":{"title":"Below all subsets for Minimal Connected Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2016-11-02T23:21:18Z","abstract_excerpt":"A vertex subset $S$ in a graph $G$ is a dominating set if every vertex not contained in $S$ has a neighbor in $S$. A dominating set $S$ is a connected dominating set if the subgraph $G[S]$ induced by $S$ is connected. A connected dominating set $S$ is a minimal connected dominating set if no proper subset of $S$ is also a connected dominating set. We prove that there exists a constant $\\varepsilon > 10^{-50}$ such that every graph $G$ on $n$ vertices has at most $O(2^{(1-\\varepsilon)n})$ minimal connected dominating sets. For the same $\\varepsilon$ we also give an algorithm with running time $"},"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":"1611.00840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T23:21:18Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"74ae5595d5781d7e8e58f9f914a6c1f97ecf59df29ff0f2f3400d3d091d9d6c3","abstract_canon_sha256":"226c2c39863c6702c8e953201c500cff4050299037d55c2f9953e39f24d8b6b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:18.548342Z","signature_b64":"7rYnqgXVxg7wz7r5/n0yCuYWwXDd0giBUcLeBpGlg0B/mqbjwTxPTm3x+rLegXctglcJ4ousdVUcCy0hxtI0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f4bbbf25a8727614f0cd28ecb9025bc7972e814c5b8ae0c6a7dff9205c770c","last_reissued_at":"2026-05-18T01:00:18.547751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:18.547751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Below all subsets for Minimal Connected Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2016-11-02T23:21:18Z","abstract_excerpt":"A vertex subset $S$ in a graph $G$ is a dominating set if every vertex not contained in $S$ has a neighbor in $S$. A dominating set $S$ is a connected dominating set if the subgraph $G[S]$ induced by $S$ is connected. A connected dominating set $S$ is a minimal connected dominating set if no proper subset of $S$ is also a connected dominating set. We prove that there exists a constant $\\varepsilon > 10^{-50}$ such that every graph $G$ on $n$ vertices has at most $O(2^{(1-\\varepsilon)n})$ minimal connected dominating sets. For the same $\\varepsilon$ we also give an algorithm with running time $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00840","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":""},"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":"1611.00840","created_at":"2026-05-18T01:00:18.547845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00840v1","created_at":"2026-05-18T01:00:18.547845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00840","created_at":"2026-05-18T01:00:18.547845+00:00"},{"alias_kind":"pith_short_12","alias_value":"S32LXPZFVBZH","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S32LXPZFVBZHMFHQ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S32LXPZF","created_at":"2026-05-18T12:30:41.710351+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/S32LXPZFVBZHMFHQZUUOZOICLP","json":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP.json","graph_json":"https://pith.science/api/pith-number/S32LXPZFVBZHMFHQZUUOZOICLP/graph.json","events_json":"https://pith.science/api/pith-number/S32LXPZFVBZHMFHQZUUOZOICLP/events.json","paper":"https://pith.science/paper/S32LXPZF"},"agent_actions":{"view_html":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP","download_json":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP.json","view_paper":"https://pith.science/paper/S32LXPZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00840&json=true","fetch_graph":"https://pith.science/api/pith-number/S32LXPZFVBZHMFHQZUUOZOICLP/graph.json","fetch_events":"https://pith.science/api/pith-number/S32LXPZFVBZHMFHQZUUOZOICLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP/action/storage_attestation","attest_author":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP/action/author_attestation","sign_citation":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP/action/citation_signature","submit_replication":"https://pith.science/pith/S32LXPZFVBZHMFHQZUUOZOICLP/action/replication_record"}},"created_at":"2026-05-18T01:00:18.547845+00:00","updated_at":"2026-05-18T01:00:18.547845+00:00"}