{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XFPTZMZ5WCANTAZ4IUTVCR4HLV","short_pith_number":"pith:XFPTZMZ5","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"},"canonical_sha256":"b95f3cb33db080d9833c45275147875d6b66608997100052cd3e02e026dea348","source":{"kind":"arxiv","id":"1502.00716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00716","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00716v1","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00716","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"XFPTZMZ5WCAN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XFPTZMZ5WCANTAZ4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XFPTZMZ5","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XFPTZMZ5WCANTAZ4IUTVCR4HLV","target":"record","payload":{"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"},"canonical_sha256":"b95f3cb33db080d9833c45275147875d6b66608997100052cd3e02e026dea348","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"},"source_kind":"arxiv","source_id":"1502.00716","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-05-18T02:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AO5vhG1xllydsNC2n1Ziuug65W3KCZDYc5uBrCrrt6aexhUmqRVlMH4aTRdIm+ybhtzCNvEu2WOT/SZfc7oDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:01:47.398693Z"},"content_sha256":"71c0480641e66b69b920d6c72eb8b8c7e662ca774b52f59de9113ca272115d40","schema_version":"1.0","event_id":"sha256:71c0480641e66b69b920d6c72eb8b8c7e662ca774b52f59de9113ca272115d40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XFPTZMZ5WCANTAZ4IUTVCR4HLV","target":"graph","payload":{"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"},"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-05-18T02:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3cicd6p3ZaEBWFQeAb7Ey491R0Cmt2Ej3hjeVUovYspY4VADDQnANVL0cPcQ97wecAZgo8fRqNVNfEhg+E4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:01:47.399344Z"},"content_sha256":"a301c8fe3a0cb1b646c923af5067ed140711aed3af1d9d7e006c465345b1ad8e","schema_version":"1.0","event_id":"sha256:a301c8fe3a0cb1b646c923af5067ed140711aed3af1d9d7e006c465345b1ad8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/bundle.json","state_url":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/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-06-04T04:01:47Z","links":{"resolver":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV","bundle":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/bundle.json","state":"https://pith.science/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFPTZMZ5WCANTAZ4IUTVCR4HLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XFPTZMZ5WCANTAZ4IUTVCR4HLV","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":"45bc215ba656f9ece057a716a0b255474d0b2a082d16065fc09b5a8fa29418dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T02:59:51Z","title_canon_sha256":"535e2a91fb6080ad1a9974bd53aa24b41c79f984996b6b3f5e814a2c3f472f24"},"schema_version":"1.0","source":{"id":"1502.00716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00716","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00716v1","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00716","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"XFPTZMZ5WCAN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XFPTZMZ5WCANTAZ4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XFPTZMZ5","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:a301c8fe3a0cb1b646c923af5067ed140711aed3af1d9d7e006c465345b1ad8e","target":"graph","created_at":"2026-05-18T02:28:04Z","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"},"paper":{"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","authors_text":"Glencora Borradaile, Hung Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T02:59:51Z","title":"Optimal dynamic program for r-domination problems over tree decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00716","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:71c0480641e66b69b920d6c72eb8b8c7e662ca774b52f59de9113ca272115d40","target":"record","created_at":"2026-05-18T02:28:04Z","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":"45bc215ba656f9ece057a716a0b255474d0b2a082d16065fc09b5a8fa29418dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T02:59:51Z","title_canon_sha256":"535e2a91fb6080ad1a9974bd53aa24b41c79f984996b6b3f5e814a2c3f472f24"},"schema_version":"1.0","source":{"id":"1502.00716","kind":"arxiv","version":1}},"canonical_sha256":"b95f3cb33db080d9833c45275147875d6b66608997100052cd3e02e026dea348","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b95f3cb33db080d9833c45275147875d6b66608997100052cd3e02e026dea348","first_computed_at":"2026-05-18T02:28:04.519642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:04.519642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uH0tzG2FweUARuyHKQI7WyNT1GQbT48VWbbWAKjVfwoO+UOKTC42PDpX63NO86cyvw4lGULz0GgJwIGIeb5IDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:04.520375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c0480641e66b69b920d6c72eb8b8c7e662ca774b52f59de9113ca272115d40","sha256:a301c8fe3a0cb1b646c923af5067ed140711aed3af1d9d7e006c465345b1ad8e"],"state_sha256":"a647bd2de14f79e1bf5b724e31040848bef7c6b3aa0ca3b35b89ac3376fb6659"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMbDH02Dj54htSOekDpSrKCl4GVTTc7FeP7YKfe22OtEmj71V3ohQNQFnzRfy8OWCsyhFSSMDMoS0fXcYY7BAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:01:47.402890Z","bundle_sha256":"376d147b7e65a10fdba457f291de36dd3eb14fcf54575d91ac1a6083dcd26de8"}}