{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SSNLOU6NJOLHIQZBMBFOPF3OXB","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":"2c1a4e33e0d011f05cd6e33161baf261dd4f55855069adb0c166dffa7b6f111b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-04T01:56:29Z","title_canon_sha256":"5e87782ddbc9f663b92eca3047d67e60644f5427e61c875836438f75fe4ea100"},"schema_version":"1.0","source":{"id":"2502.01927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01927","created_at":"2026-07-05T10:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01927v1","created_at":"2026-07-05T10:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01927","created_at":"2026-07-05T10:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"SSNLOU6NJOLH","created_at":"2026-07-05T10:09:21Z"},{"alias_kind":"pith_short_16","alias_value":"SSNLOU6NJOLHIQZB","created_at":"2026-07-05T10:09:21Z"},{"alias_kind":"pith_short_8","alias_value":"SSNLOU6N","created_at":"2026-07-05T10:09:21Z"}],"graph_snapshots":[{"event_id":"sha256:79484fe40cccd6dc06c2ff03b93224763757010309414b89f1164dd5ff7ddc10","target":"graph","created_at":"2026-07-05T10:09:21Z","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/2502.01927/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Planar Graph Product Structure Theorem of Dujmovi\\'c et al. [J. ACM '20] says that every planar graph $G$ is contained in $H\\boxtimes P\\boxtimes K_3$ for some planar graph $H$ with treewidth at most 3 and some path $P$. This result has been the key to solving several old open problems. Several people have asked whether the Planar Graph Product Structure Theorem can be proved with good upper bounds on the length of $P$. No $o(n)$ upper bound was previously known for $n$-vertex planar graphs. We answer this question in the affirmative, by proving that for any $\\epsilon\\in (0,1)$ every $n$-ve","authors_text":"David R. Wood, Kevin Hendrey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-04T01:56:29Z","title":"Short Paths in the Planar Graph Product Structure Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01927","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:8037d153e126f18b673b0aca9d3ed43cce04faf816d4da943942fa3952542b8f","target":"record","created_at":"2026-07-05T10:09:21Z","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":"2c1a4e33e0d011f05cd6e33161baf261dd4f55855069adb0c166dffa7b6f111b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-04T01:56:29Z","title_canon_sha256":"5e87782ddbc9f663b92eca3047d67e60644f5427e61c875836438f75fe4ea100"},"schema_version":"1.0","source":{"id":"2502.01927","kind":"arxiv","version":1}},"canonical_sha256":"949ab753cd4b96744321604ae7976eb86b36d998a7cff0b79a71472aad23e5d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"949ab753cd4b96744321604ae7976eb86b36d998a7cff0b79a71472aad23e5d5","first_computed_at":"2026-07-05T10:09:21.299361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:21.299361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m6XzH7LusIaAMef+J1xmi0QQCna99ibcXi1/lyPsg96NYISBOmnBhD3Z7D3PS/gvRpXc/Wg1EotFEfQndYIYBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:21.299789Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8037d153e126f18b673b0aca9d3ed43cce04faf816d4da943942fa3952542b8f","sha256:79484fe40cccd6dc06c2ff03b93224763757010309414b89f1164dd5ff7ddc10"],"state_sha256":"9a6be104904b4d0b55fc2d252352123c7685f8d28342a9b26e866d52466a2802"}