{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OOIJ77VX7YS7Z4J7VSI4AAMZ3D","short_pith_number":"pith:OOIJ77VX","canonical_record":{"source":{"id":"1606.06566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T13:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"38d5fc7d397c623cd449c83f842990fb8b9ded85a6088b3d58ac12584e576e4e","abstract_canon_sha256":"c20393658900c8926b237c843b556271185640714f52beac8f30a2b4bf623fe5"},"schema_version":"1.0"},"canonical_sha256":"73909ffeb7fe25fcf13fac91c00199d8fe160203e8d30cdba8d342de8cfe16c5","source":{"kind":"arxiv","id":"1606.06566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06566","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06566v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06566","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"OOIJ77VX7YS7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOIJ77VX7YS7Z4J7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOIJ77VX","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OOIJ77VX7YS7Z4J7VSI4AAMZ3D","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T13:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"38d5fc7d397c623cd449c83f842990fb8b9ded85a6088b3d58ac12584e576e4e","abstract_canon_sha256":"c20393658900c8926b237c843b556271185640714f52beac8f30a2b4bf623fe5"},"schema_version":"1.0"},"canonical_sha256":"73909ffeb7fe25fcf13fac91c00199d8fe160203e8d30cdba8d342de8cfe16c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.234724Z","signature_b64":"hOapH4KB40un38A76UDSg4LZHsh+YsiRquYWVB2+boDdNpRQjaqHt77BhOCHYtVsiguwHq0+J7/r2rWmn9WCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73909ffeb7fe25fcf13fac91c00199d8fe160203e8d30cdba8d342de8cfe16c5","last_reissued_at":"2026-05-18T01:12:09.234208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.234208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06566","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkrlpL0SNKV5ZMmF5RYxOv3oI7C2WIbFt5TA3Y2A8PTf3t98L1m9NlpstP/toX6ftDEDQBd2R5thKvtYvBOsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:15:51.563461Z"},"content_sha256":"160a2b93276ffeeef3e23a9074176d2bcd3935556c4307cff9af2fbd267b5dfc","schema_version":"1.0","event_id":"sha256:160a2b93276ffeeef3e23a9074176d2bcd3935556c4307cff9af2fbd267b5dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OOIJ77VX7YS7Z4J7VSI4AAMZ3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Computation of Path-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin F\\\"urer","submitted_at":"2016-06-21T13:40:01Z","abstract_excerpt":"Tree-width and path-width are widely successful concepts. Many NP-hard problems have efficient solutions when restricted to graphs of bounded tree-width. Many efficient algorithms are based on a tree decomposition. Sometimes the more restricted path decomposition is required. The bottleneck for such algorithms is often the computation of the width and a corresponding tree or path decomposition. For graphs with $n$ vertices and tree-width or path-width $k$, the standard linear time algorithm to compute these decompositions dates back to 1996. Its running time is linear in $n$ and exponential in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06566","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h59zkuVX360WACxaqdHt1RD6IDpv7mXgYB1r0e/1h/MprDk+p/0Ywu310Q372JL54QqeqQUf3GuOfYIthlZcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:15:51.563829Z"},"content_sha256":"175618749431f7cb47d2caa541046d702d457e2f771047ab0a333a78126a16df","schema_version":"1.0","event_id":"sha256:175618749431f7cb47d2caa541046d702d457e2f771047ab0a333a78126a16df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/bundle.json","state_url":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/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-07-01T12:15:51Z","links":{"resolver":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D","bundle":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/bundle.json","state":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OOIJ77VX7YS7Z4J7VSI4AAMZ3D","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":"c20393658900c8926b237c843b556271185640714f52beac8f30a2b4bf623fe5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T13:40:01Z","title_canon_sha256":"38d5fc7d397c623cd449c83f842990fb8b9ded85a6088b3d58ac12584e576e4e"},"schema_version":"1.0","source":{"id":"1606.06566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06566","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06566v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06566","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"OOIJ77VX7YS7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOIJ77VX7YS7Z4J7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOIJ77VX","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:175618749431f7cb47d2caa541046d702d457e2f771047ab0a333a78126a16df","target":"graph","created_at":"2026-05-18T01:12:09Z","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":"Tree-width and path-width are widely successful concepts. Many NP-hard problems have efficient solutions when restricted to graphs of bounded tree-width. Many efficient algorithms are based on a tree decomposition. Sometimes the more restricted path decomposition is required. The bottleneck for such algorithms is often the computation of the width and a corresponding tree or path decomposition. For graphs with $n$ vertices and tree-width or path-width $k$, the standard linear time algorithm to compute these decompositions dates back to 1996. Its running time is linear in $n$ and exponential in","authors_text":"Martin F\\\"urer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T13:40:01Z","title":"Faster Computation of Path-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06566","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:160a2b93276ffeeef3e23a9074176d2bcd3935556c4307cff9af2fbd267b5dfc","target":"record","created_at":"2026-05-18T01:12:09Z","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":"c20393658900c8926b237c843b556271185640714f52beac8f30a2b4bf623fe5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T13:40:01Z","title_canon_sha256":"38d5fc7d397c623cd449c83f842990fb8b9ded85a6088b3d58ac12584e576e4e"},"schema_version":"1.0","source":{"id":"1606.06566","kind":"arxiv","version":1}},"canonical_sha256":"73909ffeb7fe25fcf13fac91c00199d8fe160203e8d30cdba8d342de8cfe16c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73909ffeb7fe25fcf13fac91c00199d8fe160203e8d30cdba8d342de8cfe16c5","first_computed_at":"2026-05-18T01:12:09.234208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.234208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hOapH4KB40un38A76UDSg4LZHsh+YsiRquYWVB2+boDdNpRQjaqHt77BhOCHYtVsiguwHq0+J7/r2rWmn9WCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.234724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:160a2b93276ffeeef3e23a9074176d2bcd3935556c4307cff9af2fbd267b5dfc","sha256:175618749431f7cb47d2caa541046d702d457e2f771047ab0a333a78126a16df"],"state_sha256":"4fcdc8d0e5f9202ba0ae13502e5e8881e5ffd48fa391599a6d9dd8bb4908244e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQQ2mqDdXyjbdutcH0ztmXM7WOy/IQApyIZ5qfyqMOUkL/DAeyacbpaGf5wbVWKbBCIHdiuBSXx2g4/Yg6MmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:15:51.565836Z","bundle_sha256":"65dc4e62ffe5289004436a1c77125b0085e9419e34edf74b76b4af5e4aeeea69"}}