{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y4FWWLXNEZ3PRG5CIOVTJNBQFH","short_pith_number":"pith:Y4FWWLXN","schema_version":"1.0","canonical_sha256":"c70b6b2eed2676f89ba243ab34b43029f5de41d77a7001174eafc426b5ec92f6","source":{"kind":"arxiv","id":"2509.08762","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.08762","created_at":"2026-06-03T01:05:05.921676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08762v2","created_at":"2026-06-03T01:05:05.921676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08762","created_at":"2026-06-03T01:05:05.921676+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4FWWLXNEZ3P","created_at":"2026-06-03T01:05:05.921676+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4FWWLXNEZ3PRG5C","created_at":"2026-06-03T01:05:05.921676+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4FWWLXN","created_at":"2026-06-03T01:05:05.921676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.11112","citing_title":"A coarse Menger's Theorem for planar and bounded genus graphs","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10068","citing_title":"Coarse Menger property of quasi-minor excluded graphs and length spaces","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH","json":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH.json","graph_json":"https://pith.science/api/pith-number/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/graph.json","events_json":"https://pith.science/api/pith-number/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/events.json","paper":"https://pith.science/paper/Y4FWWLXN"},"agent_actions":{"view_html":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH","download_json":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH.json","view_paper":"https://pith.science/paper/Y4FWWLXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08762&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/action/storage_attestation","attest_author":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/action/author_attestation","sign_citation":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/action/citation_signature","submit_replication":"https://pith.science/pith/Y4FWWLXNEZ3PRG5CIOVTJNBQFH/action/replication_record"}},"created_at":"2026-06-03T01:05:05.921676+00:00","updated_at":"2026-06-03T01:05:05.921676+00:00"}