{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Y4FWWLXNEZ3PRG5CIOVTJNBQFH","short_pith_number":"pith:Y4FWWLXN","canonical_record":{"source":{"id":"2509.08762","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T16:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"d0845cfc1e5c959edfb804d8c6d882fa98700b4b563a46f806d20f44e88e266b","abstract_canon_sha256":"61a8cea147e3deaf8054632fb606f080cc7f59aa869452b52e2b9ba624b1208a"},"schema_version":"1.0"},"canonical_sha256":"c70b6b2eed2676f89ba243ab34b43029f5de41d77a7001174eafc426b5ec92f6","source":{"kind":"arxiv","id":"2509.08762","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08762","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08762v2","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08762","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"Y4FWWLXNEZ3P","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"Y4FWWLXNEZ3PRG5C","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"Y4FWWLXN","created_at":"2026-06-03T01:05:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Y4FWWLXNEZ3PRG5CIOVTJNBQFH","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08762","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T16:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"d0845cfc1e5c959edfb804d8c6d882fa98700b4b563a46f806d20f44e88e266b","abstract_canon_sha256":"61a8cea147e3deaf8054632fb606f080cc7f59aa869452b52e2b9ba624b1208a"},"schema_version":"1.0"},"canonical_sha256":"c70b6b2eed2676f89ba243ab34b43029f5de41d77a7001174eafc426b5ec92f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:05.922099Z","signature_b64":"rtutWrIG1Egvof0r4LxXKkFWbBblxgh9u7In9w5DNTVfR0GcReKaocZz5DezP9zKwbJDF1C0jfmlzjB+kKDjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c70b6b2eed2676f89ba243ab34b43029f5de41d77a7001174eafc426b5ec92f6","last_reissued_at":"2026-06-03T01:05:05.921606Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:05.921606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08762","source_version":2,"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-06-03T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkKkZC0Jfu1D/GlK6qRa9IRU+o6axZlCzyNITBcju5S9/ynAlRpjbZWGn4bWdjAQlAqtFAFmA8Ayr48uWxXuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:23:42.760401Z"},"content_sha256":"cb043a7f70e64120a4ee88a47fa40fd45d98343e327c24ab71ce8c03146362bb","schema_version":"1.0","event_id":"sha256:cb043a7f70e64120a4ee88a47fa40fd45d98343e327c24ab71ce8c03146362bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Y4FWWLXNEZ3PRG5CIOVTJNBQFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic structure. V. The coarse Menger conjecture in bounded path-width","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Divoux, Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2025-09-10T16:51:03Z","abstract_excerpt":"Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want the paths to be far apart, say at distance at least $c$? One might hope that we can find either $k+1$ paths pairwise far apart, or $k$ sets of bounded radius that separate $S$ and $T$, where the bound on the radius is some $\\ell$ that depends only on $k,c$ (the ``coarse Menger conjecture''). The last three authors showed in an earlier paper that this is fals"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08762","kind":"arxiv","version":2},"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/2509.08762/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-06-03T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wd3Sh4a02u9Y64sje5eF0eyeDgq07/BSLAAAv8dJDlcZxRebdB29+5hwtof2jCTIIwD7dHufLS4G3FvsYu07Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:23:42.761193Z"},"content_sha256":"3978558fac914e1dc11256fd1a5f07ebd6b60d43b5459593d0ec801f5599d9a6","schema_version":"1.0","event_id":"sha256:3978558fac914e1dc11256fd1a5f07ebd6b60d43b5459593d0ec801f5599d9a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/bundle.json","state_url":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/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-10T13:23:42Z","links":{"resolver":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH","bundle":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/bundle.json","state":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y4FWWLXNEZ3PRG5CIOVTJNBQFH","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":"61a8cea147e3deaf8054632fb606f080cc7f59aa869452b52e2b9ba624b1208a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T16:51:03Z","title_canon_sha256":"d0845cfc1e5c959edfb804d8c6d882fa98700b4b563a46f806d20f44e88e266b"},"schema_version":"1.0","source":{"id":"2509.08762","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08762","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08762v2","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08762","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"Y4FWWLXNEZ3P","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"Y4FWWLXNEZ3PRG5C","created_at":"2026-06-03T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"Y4FWWLXN","created_at":"2026-06-03T01:05:05Z"}],"graph_snapshots":[{"event_id":"sha256:3978558fac914e1dc11256fd1a5f07ebd6b60d43b5459593d0ec801f5599d9a6","target":"graph","created_at":"2026-06-03T01:05:05Z","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/2509.08762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want the paths to be far apart, say at distance at least $c$? One might hope that we can find either $k+1$ paths pairwise far apart, or $k$ sets of bounded radius that separate $S$ and $T$, where the bound on the radius is some $\\ell$ that depends only on $k,c$ (the ``coarse Menger conjecture''). The last three authors showed in an earlier paper that this is fals","authors_text":"Alex Divoux, Alex Scott, Paul Seymour, Tung Nguyen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T16:51:03Z","title":"Asymptotic structure. V. The coarse Menger conjecture in bounded path-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08762","kind":"arxiv","version":2},"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:cb043a7f70e64120a4ee88a47fa40fd45d98343e327c24ab71ce8c03146362bb","target":"record","created_at":"2026-06-03T01:05:05Z","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":"61a8cea147e3deaf8054632fb606f080cc7f59aa869452b52e2b9ba624b1208a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T16:51:03Z","title_canon_sha256":"d0845cfc1e5c959edfb804d8c6d882fa98700b4b563a46f806d20f44e88e266b"},"schema_version":"1.0","source":{"id":"2509.08762","kind":"arxiv","version":2}},"canonical_sha256":"c70b6b2eed2676f89ba243ab34b43029f5de41d77a7001174eafc426b5ec92f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c70b6b2eed2676f89ba243ab34b43029f5de41d77a7001174eafc426b5ec92f6","first_computed_at":"2026-06-03T01:05:05.921606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:05.921606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rtutWrIG1Egvof0r4LxXKkFWbBblxgh9u7In9w5DNTVfR0GcReKaocZz5DezP9zKwbJDF1C0jfmlzjB+kKDjDw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:05.922099Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08762","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb043a7f70e64120a4ee88a47fa40fd45d98343e327c24ab71ce8c03146362bb","sha256:3978558fac914e1dc11256fd1a5f07ebd6b60d43b5459593d0ec801f5599d9a6"],"state_sha256":"f43b3e70e3e7e17c10c87808c69e025e8fb7e6278be0c6a138bf87cd4a0aa97b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSauVn9HPTOoik4N7JXZAMK0BgA0+7fvIY/4Ymh2NSrC2NYZF5kmXdDQgvPZdKaXrcj2Ny0Gv5vW6Qh6MAGXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:23:42.764291Z","bundle_sha256":"6d3c392c6084341c89ec19332d301c7c4ae377b8762d0e51fd15a553d806137b"}}