{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OOIJ77VX7YS7Z4J7VSI4AAMZ3D","short_pith_number":"pith:OOIJ77VX","schema_version":"1.0","canonical_sha256":"73909ffeb7fe25fcf13fac91c00199d8fe160203e8d30cdba8d342de8cfe16c5","source":{"kind":"arxiv","id":"1606.06566","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.06566","created_at":"2026-05-18T01:12:09.234284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06566v1","created_at":"2026-05-18T01:12:09.234284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06566","created_at":"2026-05-18T01:12:09.234284+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOIJ77VX7YS7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOIJ77VX7YS7Z4J7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOIJ77VX","created_at":"2026-05-18T12:30:36.002864+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/OOIJ77VX7YS7Z4J7VSI4AAMZ3D","json":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D.json","graph_json":"https://pith.science/api/pith-number/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/graph.json","events_json":"https://pith.science/api/pith-number/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/events.json","paper":"https://pith.science/paper/OOIJ77VX"},"agent_actions":{"view_html":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D","download_json":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D.json","view_paper":"https://pith.science/paper/OOIJ77VX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06566&json=true","fetch_graph":"https://pith.science/api/pith-number/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/graph.json","fetch_events":"https://pith.science/api/pith-number/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/action/storage_attestation","attest_author":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/action/author_attestation","sign_citation":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/action/citation_signature","submit_replication":"https://pith.science/pith/OOIJ77VX7YS7Z4J7VSI4AAMZ3D/action/replication_record"}},"created_at":"2026-05-18T01:12:09.234284+00:00","updated_at":"2026-05-18T01:12:09.234284+00:00"}