{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XFPTZMZ5WCANTAZ4IUTVCR4HLV","short_pith_number":"pith:XFPTZMZ5","schema_version":"1.0","canonical_sha256":"b95f3cb33db080d9833c45275147875d6b66608997100052cd3e02e026dea348","source":{"kind":"arxiv","id":"1502.00716","version":1},"attestation_state":"computed","paper":{"title":"Optimal dynamic program for r-domination problems over tree decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Hung Le","submitted_at":"2015-02-03T02:59:51Z","abstract_excerpt":"There has been recent progress in showing that the exponential dependence on treewidth in dynamic programming algorithms for solving NP-hard problems are optimal under the Strong Exponential Time Hypothesis (SETH). We extend this work to $r$-domination problems. In $r$-dominating set, one wished to find a minimum subset $S$ of vertices such that every vertex of $G$ is within $r$ hops of some vertex in $S$. In connected $r$-dominating set, one additionally requires that the set induces a connected subgraph of $G$. We give a $O((2r+1)^{\\mathrm{tw}} n)$ time algorithm for $r$-dominating set and a"},"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":"1502.00716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T02:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"535e2a91fb6080ad1a9974bd53aa24b41c79f984996b6b3f5e814a2c3f472f24","abstract_canon_sha256":"45bc215ba656f9ece057a716a0b255474d0b2a082d16065fc09b5a8fa29418dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.520375Z","signature_b64":"uH0tzG2FweUARuyHKQI7WyNT1GQbT48VWbbWAKjVfwoO+UOKTC42PDpX63NO86cyvw4lGULz0GgJwIGIeb5IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b95f3cb33db080d9833c45275147875d6b66608997100052cd3e02e026dea348","last_reissued_at":"2026-05-18T02:28:04.519642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.519642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal dynamic program for r-domination problems over tree decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Hung Le","submitted_at":"2015-02-03T02:59:51Z","abstract_excerpt":"There has been recent progress in showing that the exponential dependence on treewidth in dynamic programming algorithms for solving NP-hard problems are optimal under the Strong Exponential Time Hypothesis (SETH). We extend this work to $r$-domination problems. In $r$-dominating set, one wished to find a minimum subset $S$ of vertices such that every vertex of $G$ is within $r$ hops of some vertex in $S$. In connected $r$-dominating set, one additionally requires that the set induces a connected subgraph of $G$. We give a $O((2r+1)^{\\mathrm{tw}} n)$ time algorithm for $r$-dominating set and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00716","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":"1502.00716","created_at":"2026-05-18T02:28:04.519958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00716v1","created_at":"2026-05-18T02:28:04.519958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00716","created_at":"2026-05-18T02:28:04.519958+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFPTZMZ5WCAN","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFPTZMZ5WCANTAZ4","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFPTZMZ5","created_at":"2026-05-18T12:29:50.041715+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/XFPTZMZ5WCANTAZ4IUTVCR4HLV","json":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV.json","graph_json":"https://pith.science/api/pith-number/XFPTZMZ5WCANTAZ4IUTVCR4HLV/graph.json","events_json":"https://pith.science/api/pith-number/XFPTZMZ5WCANTAZ4IUTVCR4HLV/events.json","paper":"https://pith.science/paper/XFPTZMZ5"},"agent_actions":{"view_html":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV","download_json":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV.json","view_paper":"https://pith.science/paper/XFPTZMZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00716&json=true","fetch_graph":"https://pith.science/api/pith-number/XFPTZMZ5WCANTAZ4IUTVCR4HLV/graph.json","fetch_events":"https://pith.science/api/pith-number/XFPTZMZ5WCANTAZ4IUTVCR4HLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/action/storage_attestation","attest_author":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/action/author_attestation","sign_citation":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/action/citation_signature","submit_replication":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/action/replication_record"}},"created_at":"2026-05-18T02:28:04.519958+00:00","updated_at":"2026-05-18T02:28:04.519958+00:00"}