{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AWGLIRVU5X7CKHPXX2PWGW7BPC","short_pith_number":"pith:AWGLIRVU","canonical_record":{"source":{"id":"1806.01667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T13:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"0f14eb093ea976a3827b8b5317d5441e132eb6e04f5a28aa90b5f8313053b18d","abstract_canon_sha256":"a447565e5dc0a3d4f3b8543e7d5bedee3c4ea5adc63e375b52b91a6d2e498928"},"schema_version":"1.0"},"canonical_sha256":"058cb446b4edfe251df7be9f635be178993c0559bd9b0a6326b8a63aea8c9c2b","source":{"kind":"arxiv","id":"1806.01667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01667","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01667v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01667","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"AWGLIRVU5X7C","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWGLIRVU5X7CKHPX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWGLIRVU","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AWGLIRVU5X7CKHPXX2PWGW7BPC","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T13:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"0f14eb093ea976a3827b8b5317d5441e132eb6e04f5a28aa90b5f8313053b18d","abstract_canon_sha256":"a447565e5dc0a3d4f3b8543e7d5bedee3c4ea5adc63e375b52b91a6d2e498928"},"schema_version":"1.0"},"canonical_sha256":"058cb446b4edfe251df7be9f635be178993c0559bd9b0a6326b8a63aea8c9c2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:12.114913Z","signature_b64":"FFj9K6WXMHDx+PV0RBw5lFQGEfWX/MVRHnP7KJbu16coqfoHcImVzkcmSp1Y2TmLGfSufYoEExVFtl9th7yxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058cb446b4edfe251df7be9f635be178993c0559bd9b0a6326b8a63aea8c9c2b","last_reissued_at":"2026-05-18T00:14:12.114301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:12.114301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01667","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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rg+arVaRMQ0PKVnuhBrHUYZ1sjLbu2FsRTzRZpY8iqJ3k2TFDJiX8nhpcO+mH7Qw+2sUvC1axfCnkrOGCPAwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:51:40.576553Z"},"content_sha256":"464a3b28a8ae6c39e252aa52421c1f25d27b1e560f0ae172248f2705119b8b0e","schema_version":"1.0","event_id":"sha256:464a3b28a8ae6c39e252aa52421c1f25d27b1e560f0ae172248f2705119b8b0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AWGLIRVU5X7CKHPXX2PWGW7BPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Dynamic Programming on Graph Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Hans L. Bodlaender, Johan M. M. Van Rooij, Martin Vatshelle, Peter Rossmanith","submitted_at":"2018-06-05T13:02:35Z","abstract_excerpt":"In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decompositions for a large number of problems as a function of the treewidth, branchwidth, or cliquewidth, respectively.\n  On tree decompositions of width $k$, we improve the running time for Dominating Set to $O(3^k)$. We generalise this result to $[\\rho,\\sigma]$-domination problems with finite or cofinite $\\rho$ and $\\sigma$. For these problems, we give $O(s^k)$-time algorithms, where $s$ is the number of `states' a ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01667","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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2j6+TAg5kFiXD/GuSA0p1WRRFJLxcnzcxoUSJPY1T2jgEjIkceHZ+//kom93HlVvCvZCLf8yvP4F7sYe3NLmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:51:40.577254Z"},"content_sha256":"8df8b31e9cda326d112b2828079ff6f90aac1f7f8bd665f20d8a5cc5fc15dd10","schema_version":"1.0","event_id":"sha256:8df8b31e9cda326d112b2828079ff6f90aac1f7f8bd665f20d8a5cc5fc15dd10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC/bundle.json","state_url":"https://pith.science/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC/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-05-27T15:51:40Z","links":{"resolver":"https://pith.science/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC","bundle":"https://pith.science/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC/bundle.json","state":"https://pith.science/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWGLIRVU5X7CKHPXX2PWGW7BPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AWGLIRVU5X7CKHPXX2PWGW7BPC","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":"a447565e5dc0a3d4f3b8543e7d5bedee3c4ea5adc63e375b52b91a6d2e498928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T13:02:35Z","title_canon_sha256":"0f14eb093ea976a3827b8b5317d5441e132eb6e04f5a28aa90b5f8313053b18d"},"schema_version":"1.0","source":{"id":"1806.01667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01667","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01667v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01667","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"AWGLIRVU5X7C","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWGLIRVU5X7CKHPX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWGLIRVU","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:8df8b31e9cda326d112b2828079ff6f90aac1f7f8bd665f20d8a5cc5fc15dd10","target":"graph","created_at":"2026-05-18T00:14:12Z","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":"In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decompositions for a large number of problems as a function of the treewidth, branchwidth, or cliquewidth, respectively.\n  On tree decompositions of width $k$, we improve the running time for Dominating Set to $O(3^k)$. We generalise this result to $[\\rho,\\sigma]$-domination problems with finite or cofinite $\\rho$ and $\\sigma$. For these problems, we give $O(s^k)$-time algorithms, where $s$ is the number of `states' a ver","authors_text":"Erik Jan van Leeuwen, Hans L. Bodlaender, Johan M. M. Van Rooij, Martin Vatshelle, Peter Rossmanith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T13:02:35Z","title":"Fast Dynamic Programming on Graph Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01667","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:464a3b28a8ae6c39e252aa52421c1f25d27b1e560f0ae172248f2705119b8b0e","target":"record","created_at":"2026-05-18T00:14:12Z","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":"a447565e5dc0a3d4f3b8543e7d5bedee3c4ea5adc63e375b52b91a6d2e498928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T13:02:35Z","title_canon_sha256":"0f14eb093ea976a3827b8b5317d5441e132eb6e04f5a28aa90b5f8313053b18d"},"schema_version":"1.0","source":{"id":"1806.01667","kind":"arxiv","version":1}},"canonical_sha256":"058cb446b4edfe251df7be9f635be178993c0559bd9b0a6326b8a63aea8c9c2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"058cb446b4edfe251df7be9f635be178993c0559bd9b0a6326b8a63aea8c9c2b","first_computed_at":"2026-05-18T00:14:12.114301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:12.114301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FFj9K6WXMHDx+PV0RBw5lFQGEfWX/MVRHnP7KJbu16coqfoHcImVzkcmSp1Y2TmLGfSufYoEExVFtl9th7yxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:12.114913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:464a3b28a8ae6c39e252aa52421c1f25d27b1e560f0ae172248f2705119b8b0e","sha256:8df8b31e9cda326d112b2828079ff6f90aac1f7f8bd665f20d8a5cc5fc15dd10"],"state_sha256":"188e86e7aaca43fe1bd53962c47e6283e46bd3864cefdf4da885cd01036dc0b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UClrJmYzjmXVh0TeqZWETuLy8PdXsf6DNqQd1ocmkJxvqq/VX+rLjxZuKW+gvoMDx92q/tp1WfXSn1eLutLGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:51:40.580837Z","bundle_sha256":"f716275faab547d89db3c7936b5a1f4998c91d0a89e7b9ab7fc3a8b54a425487"}}