{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YUMBFSQNIJSYMWESZJNML3BPQA","short_pith_number":"pith:YUMBFSQN","canonical_record":{"source":{"id":"1806.10176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T19:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"03b0f300619c3deecd7136de135a7ce9d0614d337617a92ad080eb91ffa7b9d7","abstract_canon_sha256":"8ee9181a0a1f4b58e5206a0bf272d19b24bb95eafbf2a01043b3b11c21c4f693"},"schema_version":"1.0"},"canonical_sha256":"c51812ca0d4265865892ca5ac5ec2f8016bb726253432c405301142d521abac0","source":{"kind":"arxiv","id":"1806.10176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10176","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10176v1","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10176","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"YUMBFSQNIJSY","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YUMBFSQNIJSYMWES","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YUMBFSQN","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YUMBFSQNIJSYMWESZJNML3BPQA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T19:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"03b0f300619c3deecd7136de135a7ce9d0614d337617a92ad080eb91ffa7b9d7","abstract_canon_sha256":"8ee9181a0a1f4b58e5206a0bf272d19b24bb95eafbf2a01043b3b11c21c4f693"},"schema_version":"1.0"},"canonical_sha256":"c51812ca0d4265865892ca5ac5ec2f8016bb726253432c405301142d521abac0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:13.282468Z","signature_b64":"GxLcdesTZan75PK6JYXL+KlHXgque/3+bW4y/DNVju/3bJuUorn9Mhz0Vt73Mu1h2OCiMe3gy0bEDhaXg6tJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c51812ca0d4265865892ca5ac5ec2f8016bb726253432c405301142d521abac0","last_reissued_at":"2026-05-18T00:12:13.281896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:13.281896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10176","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:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/3bh8Crbq7eAhSMU7dWQ0htgF/KgeWE1gNhZ/1esmMDwq0WgEvW5s6k69TSWa5tEDF4NB93eZhfiYRrinx4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:17:09.176446Z"},"content_sha256":"1b5a35913f8404a3c3b34f694afb019df006c07f4d87d0e3174e0b3f8ceb3a69","schema_version":"1.0","event_id":"sha256:1b5a35913f8404a3c3b34f694afb019df006c07f4d87d0e3174e0b3f8ceb3a69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YUMBFSQNIJSYMWESZJNML3BPQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Access to Dynamic Programming on Tree Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Max Bannach, Sebastian Berndt","submitted_at":"2018-06-26T19:12:10Z","abstract_excerpt":"Parameterized complexity theory has lead to a wide range of algorithmic breakthroughs within the last decades, but the practicability of these methods for real-world problems is still not well understood. We investigate the practicability of one of the fundamental approaches of this field: dynamic programming on tree decompositions. Indisputably, this is a key technique in parameterized algorithms and modern algorithm design. Despite the enormous impact of this approach in theory, it still has very little influence on practical implementations. The reasons for this phenomenon are manifold. One"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10176","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:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SireUX+/NlK8tUsrwerf66nb2fozRwiKXYoCg3Zqq1t2G6O8cmb8VZCRC7e4a0S6ZqPhEiBQoqKX/9qw9+aoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:17:09.176973Z"},"content_sha256":"252a6dd5e859a6418d9e754cb9f4c5a155186c531b105cc70824a69beb14d61b","schema_version":"1.0","event_id":"sha256:252a6dd5e859a6418d9e754cb9f4c5a155186c531b105cc70824a69beb14d61b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUMBFSQNIJSYMWESZJNML3BPQA/bundle.json","state_url":"https://pith.science/pith/YUMBFSQNIJSYMWESZJNML3BPQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUMBFSQNIJSYMWESZJNML3BPQA/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-07T10:17:09Z","links":{"resolver":"https://pith.science/pith/YUMBFSQNIJSYMWESZJNML3BPQA","bundle":"https://pith.science/pith/YUMBFSQNIJSYMWESZJNML3BPQA/bundle.json","state":"https://pith.science/pith/YUMBFSQNIJSYMWESZJNML3BPQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUMBFSQNIJSYMWESZJNML3BPQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YUMBFSQNIJSYMWESZJNML3BPQA","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":"8ee9181a0a1f4b58e5206a0bf272d19b24bb95eafbf2a01043b3b11c21c4f693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T19:12:10Z","title_canon_sha256":"03b0f300619c3deecd7136de135a7ce9d0614d337617a92ad080eb91ffa7b9d7"},"schema_version":"1.0","source":{"id":"1806.10176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10176","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10176v1","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10176","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"YUMBFSQNIJSY","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YUMBFSQNIJSYMWES","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YUMBFSQN","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:252a6dd5e859a6418d9e754cb9f4c5a155186c531b105cc70824a69beb14d61b","target":"graph","created_at":"2026-05-18T00:12:13Z","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":"Parameterized complexity theory has lead to a wide range of algorithmic breakthroughs within the last decades, but the practicability of these methods for real-world problems is still not well understood. We investigate the practicability of one of the fundamental approaches of this field: dynamic programming on tree decompositions. Indisputably, this is a key technique in parameterized algorithms and modern algorithm design. Despite the enormous impact of this approach in theory, it still has very little influence on practical implementations. The reasons for this phenomenon are manifold. One","authors_text":"Max Bannach, Sebastian Berndt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T19:12:10Z","title":"Practical Access to Dynamic Programming on Tree Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10176","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:1b5a35913f8404a3c3b34f694afb019df006c07f4d87d0e3174e0b3f8ceb3a69","target":"record","created_at":"2026-05-18T00:12:13Z","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":"8ee9181a0a1f4b58e5206a0bf272d19b24bb95eafbf2a01043b3b11c21c4f693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T19:12:10Z","title_canon_sha256":"03b0f300619c3deecd7136de135a7ce9d0614d337617a92ad080eb91ffa7b9d7"},"schema_version":"1.0","source":{"id":"1806.10176","kind":"arxiv","version":1}},"canonical_sha256":"c51812ca0d4265865892ca5ac5ec2f8016bb726253432c405301142d521abac0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c51812ca0d4265865892ca5ac5ec2f8016bb726253432c405301142d521abac0","first_computed_at":"2026-05-18T00:12:13.281896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:13.281896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GxLcdesTZan75PK6JYXL+KlHXgque/3+bW4y/DNVju/3bJuUorn9Mhz0Vt73Mu1h2OCiMe3gy0bEDhaXg6tJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:13.282468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b5a35913f8404a3c3b34f694afb019df006c07f4d87d0e3174e0b3f8ceb3a69","sha256:252a6dd5e859a6418d9e754cb9f4c5a155186c531b105cc70824a69beb14d61b"],"state_sha256":"c55ef2c63a1bb9a72978b971e0564c0f2459a9f49768d24f6498609d4c40a2b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIzsEeJ4NsrYrtHbgjU25YGZrTkuIMxveeGJ1/wwjr36OR5693SSV+KFPj6rTzbCaLrWnQrLg4qslE1iGzZ6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:17:09.179441Z","bundle_sha256":"f4073b8e9f3604efe510b8813aa5e7a64c2f0cbe85c52a9e99b71c3d19b52181"}}