{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VKM5MIAE3YYNCMBJ44BFV5W4I3","short_pith_number":"pith:VKM5MIAE","canonical_record":{"source":{"id":"2008.00779","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T11:09:54Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a508710dacfb7322213a0210f12404120cb366b4566e8c0cb663d6e2ecef5ea6","abstract_canon_sha256":"32ccae5eccb3cc717fdd8dca71974b1f7eb1a92ae1a898b8e4f3d853aefc2ae6"},"schema_version":"1.0"},"canonical_sha256":"aa99d62004de30d13029e7025af6dc46f2fda17da1ce93fe819c37e5dec291b7","source":{"kind":"arxiv","id":"2008.00779","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.00779","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"2008.00779v4","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00779","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"VKM5MIAE3YYN","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"pith_short_16","alias_value":"VKM5MIAE3YYNCMBJ","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"pith_short_8","alias_value":"VKM5MIAE","created_at":"2026-07-05T05:49:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VKM5MIAE3YYNCMBJ44BFV5W4I3","target":"record","payload":{"canonical_record":{"source":{"id":"2008.00779","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T11:09:54Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a508710dacfb7322213a0210f12404120cb366b4566e8c0cb663d6e2ecef5ea6","abstract_canon_sha256":"32ccae5eccb3cc717fdd8dca71974b1f7eb1a92ae1a898b8e4f3d853aefc2ae6"},"schema_version":"1.0"},"canonical_sha256":"aa99d62004de30d13029e7025af6dc46f2fda17da1ce93fe819c37e5dec291b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:52.037131Z","signature_b64":"j65oAIATIcf0YOFChF1/SXyYAWl/z9AgauyXhL1mgMC9djyIGMzV+p+U5asSwAMUsdfIcsAXzns2nyCCutRnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa99d62004de30d13029e7025af6dc46f2fda17da1ce93fe819c37e5dec291b7","last_reissued_at":"2026-07-05T05:49:52.036730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:52.036730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.00779","source_version":4,"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-07-05T05:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soDedQdMdNuY5skdXtEmS+uvnqZIuAb2sgP0hQsxcnnl/Pq8VmlOHzListSgfCVNehF+bgHk4L4RyAURm13tCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:13:59.873185Z"},"content_sha256":"7ed49434c8c233e599f71c533251d4d9dad6d0a206048fbb7e3f598cb83320d3","schema_version":"1.0","event_id":"sha256:7ed49434c8c233e599f71c533251d4d9dad6d0a206048fbb7e3f598cb83320d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VKM5MIAE3YYNCMBJ44BFV5W4I3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating pathwidth for graphs of small treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bartosz Walczak, Carla Groenland, Gwena\\\"el Joret, Wojciech Nadara","submitted_at":"2020-08-03T11:09:54Z","abstract_excerpt":"We describe a polynomial-time algorithm which, given a graph $G$ with treewidth $t$, approximates the pathwidth of $G$ to within a ratio of $O(t\\sqrt{\\log t})$. This is the first algorithm to achieve an $f(t)$-approximation for some function $f$.\n  Our approach builds on the following key insight: every graph with large pathwidth has large treewidth or contains a subdivision of a large complete binary tree. Specifically, we show that every graph with pathwidth at least $th+2$ has treewidth at least $t$ or contains a subdivision of a complete binary tree of height $h+1$. The bound $th+2$ is bes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00779","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.00779/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tgk04KIVesfkGPxG7jvQ8rBVDbgXeaQOg5RSeeUVmJPuKvgZ0XGThR+5xg6NjZFC3jiaSaZbv2ltgOcs4KP3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:13:59.874635Z"},"content_sha256":"4a0a8f7bbf109cba92a9563179ef7a9a7d895999469095a09108156298fe1d47","schema_version":"1.0","event_id":"sha256:4a0a8f7bbf109cba92a9563179ef7a9a7d895999469095a09108156298fe1d47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3/bundle.json","state_url":"https://pith.science/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3/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-08-12T16:13:59Z","links":{"resolver":"https://pith.science/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3","bundle":"https://pith.science/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3/bundle.json","state":"https://pith.science/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKM5MIAE3YYNCMBJ44BFV5W4I3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VKM5MIAE3YYNCMBJ44BFV5W4I3","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":"32ccae5eccb3cc717fdd8dca71974b1f7eb1a92ae1a898b8e4f3d853aefc2ae6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T11:09:54Z","title_canon_sha256":"a508710dacfb7322213a0210f12404120cb366b4566e8c0cb663d6e2ecef5ea6"},"schema_version":"1.0","source":{"id":"2008.00779","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.00779","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"2008.00779v4","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00779","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"VKM5MIAE3YYN","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"pith_short_16","alias_value":"VKM5MIAE3YYNCMBJ","created_at":"2026-07-05T05:49:52Z"},{"alias_kind":"pith_short_8","alias_value":"VKM5MIAE","created_at":"2026-07-05T05:49:52Z"}],"graph_snapshots":[{"event_id":"sha256:4a0a8f7bbf109cba92a9563179ef7a9a7d895999469095a09108156298fe1d47","target":"graph","created_at":"2026-07-05T05:49:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.00779/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe a polynomial-time algorithm which, given a graph $G$ with treewidth $t$, approximates the pathwidth of $G$ to within a ratio of $O(t\\sqrt{\\log t})$. This is the first algorithm to achieve an $f(t)$-approximation for some function $f$.\n  Our approach builds on the following key insight: every graph with large pathwidth has large treewidth or contains a subdivision of a large complete binary tree. Specifically, we show that every graph with pathwidth at least $th+2$ has treewidth at least $t$ or contains a subdivision of a complete binary tree of height $h+1$. The bound $th+2$ is bes","authors_text":"Bartosz Walczak, Carla Groenland, Gwena\\\"el Joret, Wojciech Nadara","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T11:09:54Z","title":"Approximating pathwidth for graphs of small treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00779","kind":"arxiv","version":4},"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:7ed49434c8c233e599f71c533251d4d9dad6d0a206048fbb7e3f598cb83320d3","target":"record","created_at":"2026-07-05T05:49:52Z","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":"32ccae5eccb3cc717fdd8dca71974b1f7eb1a92ae1a898b8e4f3d853aefc2ae6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T11:09:54Z","title_canon_sha256":"a508710dacfb7322213a0210f12404120cb366b4566e8c0cb663d6e2ecef5ea6"},"schema_version":"1.0","source":{"id":"2008.00779","kind":"arxiv","version":4}},"canonical_sha256":"aa99d62004de30d13029e7025af6dc46f2fda17da1ce93fe819c37e5dec291b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa99d62004de30d13029e7025af6dc46f2fda17da1ce93fe819c37e5dec291b7","first_computed_at":"2026-07-05T05:49:52.036730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:49:52.036730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j65oAIATIcf0YOFChF1/SXyYAWl/z9AgauyXhL1mgMC9djyIGMzV+p+U5asSwAMUsdfIcsAXzns2nyCCutRnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:49:52.037131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.00779","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ed49434c8c233e599f71c533251d4d9dad6d0a206048fbb7e3f598cb83320d3","sha256:4a0a8f7bbf109cba92a9563179ef7a9a7d895999469095a09108156298fe1d47"],"state_sha256":"e08da3c28613838134065682def459ad9820e4234344cb2b1d2d5a068450abb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gLNBr/dIHksOx94PwTawcvb8rBqiydJIZRlI/83KkOGt9gBhNL/CpEotr+quXsq4HxYG86TA6q1oreANhxgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T16:13:59.881050Z","bundle_sha256":"e320141fb188faeb697bbe71fa78b96175111661fee0c577a731e729484aaec4"}}