{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QQX4FX3JSVUCFDSKX6BSXLX677","short_pith_number":"pith:QQX4FX3J","schema_version":"1.0","canonical_sha256":"842fc2df699568228e4abf832baefefff73d429f6b4ee0b04c659f1a73418c62","source":{"kind":"arxiv","id":"2508.14332","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic structure. IV. A counterexample to the weak coarse Menger conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2025-08-20T01:04:11Z","abstract_excerpt":"Coarse graph theory concerns finding 'coarse' analogues of graph theory theorems, replacing disjointness with being far apart. One of the most interesting open questions is to find a coarse analogue of Menger's theorem, which characterizes when there are $k$ vertex-disjoint paths between two given sets $S,T$ of vertices of a graph. We showed in an earlier paper that the most natural such analogue is false, but a weaker statement remained as a popular open question. Here we show that the weaker statement is also false.\n  More exactly, suppose that $S,T$ are sets of vertices of a graph $G$, and "},"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":"2508.14332","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-20T01:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"5598160e10f91fb77939b41f9b26a192c45bab0c87b2f447595fdcc1a1f918a1","abstract_canon_sha256":"9f447f9e973b51a5ed05776864d4c6138c3e85cae1af0b11c991fbdf997ff69a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:29.974353Z","signature_b64":"3VDIzttzDy7MNLow2YT3CDUp2yjUNQ5Kd0QxZVOtNjvLemX7+zZJe8ALh9sm/26n6wzup14c550U13zptrfmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"842fc2df699568228e4abf832baefefff73d429f6b4ee0b04c659f1a73418c62","last_reissued_at":"2026-07-05T11:56:29.973896Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:29.973896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic structure. IV. A counterexample to the weak coarse Menger conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2025-08-20T01:04:11Z","abstract_excerpt":"Coarse graph theory concerns finding 'coarse' analogues of graph theory theorems, replacing disjointness with being far apart. One of the most interesting open questions is to find a coarse analogue of Menger's theorem, which characterizes when there are $k$ vertex-disjoint paths between two given sets $S,T$ of vertices of a graph. We showed in an earlier paper that the most natural such analogue is false, but a weaker statement remained as a popular open question. Here we show that the weaker statement is also false.\n  More exactly, suppose that $S,T$ are sets of vertices of a graph $G$, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14332","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.14332/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":"2508.14332","created_at":"2026-07-05T11:56:29.973959+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14332v1","created_at":"2026-07-05T11:56:29.973959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14332","created_at":"2026-07-05T11:56:29.973959+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQX4FX3JSVUC","created_at":"2026-07-05T11:56:29.973959+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQX4FX3JSVUCFDSK","created_at":"2026-07-05T11:56:29.973959+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQX4FX3J","created_at":"2026-07-05T11:56:29.973959+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07030","citing_title":"A coarse block-cutvertex tree-decomposition","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07111","citing_title":"A coarse block-cut tree theorem","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17605","citing_title":"A coarse Menger theorem for hyperbolic graphs, finitely presented groups, and more","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11112","citing_title":"A coarse Menger's Theorem for planar and bounded genus graphs","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10068","citing_title":"Coarse Menger property of quasi-minor excluded graphs and length spaces","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677","json":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677.json","graph_json":"https://pith.science/api/pith-number/QQX4FX3JSVUCFDSKX6BSXLX677/graph.json","events_json":"https://pith.science/api/pith-number/QQX4FX3JSVUCFDSKX6BSXLX677/events.json","paper":"https://pith.science/paper/QQX4FX3J"},"agent_actions":{"view_html":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677","download_json":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677.json","view_paper":"https://pith.science/paper/QQX4FX3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14332&json=true","fetch_graph":"https://pith.science/api/pith-number/QQX4FX3JSVUCFDSKX6BSXLX677/graph.json","fetch_events":"https://pith.science/api/pith-number/QQX4FX3JSVUCFDSKX6BSXLX677/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677/action/storage_attestation","attest_author":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677/action/author_attestation","sign_citation":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677/action/citation_signature","submit_replication":"https://pith.science/pith/QQX4FX3JSVUCFDSKX6BSXLX677/action/replication_record"}},"created_at":"2026-07-05T11:56:29.973959+00:00","updated_at":"2026-07-05T11:56:29.973959+00:00"}