{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NRHWE4H32VIOSTEGIIY3DFINKC","short_pith_number":"pith:NRHWE4H3","schema_version":"1.0","canonical_sha256":"6c4f6270fbd550e94c864231b1950d508552a44cddeb02e9d1d1fa9ebc7ed8a4","source":{"kind":"arxiv","id":"2509.09035","version":3},"attestation_state":"computed","paper":{"title":"Asymptotic structure. III. Excluding a fat tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2025-09-10T22:11:08Z","abstract_excerpt":"Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every finite graph $G$ with an $H$ minor has path-width more than $k$. If we (twice) replace ``path-width'' by ``line-width'', the same is true for infinite graphs $G$.\n  We prove a ``coarse graph theory'' analogue, as follows. For every finite tree $H$ and every $c$, there exist $k,L,C$ such that every graph that does not contain $H$ as a $c$-fat minor admits an $"},"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.09035","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T22:11:08Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"7a16b1dc333478870d41eb832ec569fa46c56ed760f9d0e5f9d62c8b9cc50861","abstract_canon_sha256":"13ca449b4eccd358fbcfe53d205114c53da576f06dc2c2b5bac1878257511631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:16.717889Z","signature_b64":"jkpezYXjB5s0iKwOWo3gPilmacm3r1eIG5+b7lr/YXSa6vGw1QHOg4NtZbD2pISkB7LcbvlH27KZATjJala3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4f6270fbd550e94c864231b1950d508552a44cddeb02e9d1d1fa9ebc7ed8a4","last_reissued_at":"2026-06-11T01:09:16.716921Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:16.716921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic structure. III. Excluding a fat tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","submitted_at":"2025-09-10T22:11:08Z","abstract_excerpt":"Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every finite graph $G$ with an $H$ minor has path-width more than $k$. If we (twice) replace ``path-width'' by ``line-width'', the same is true for infinite graphs $G$.\n  We prove a ``coarse graph theory'' analogue, as follows. For every finite tree $H$ and every $c$, there exist $k,L,C$ such that every graph that does not contain $H$ as a $c$-fat minor admits an $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09035","kind":"arxiv","version":3},"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.09035/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.09035","created_at":"2026-06-11T01:09:16.717072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09035v3","created_at":"2026-06-11T01:09:16.717072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09035","created_at":"2026-06-11T01:09:16.717072+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRHWE4H32VIO","created_at":"2026-06-11T01:09:16.717072+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRHWE4H32VIOSTEG","created_at":"2026-06-11T01:09:16.717072+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRHWE4H3","created_at":"2026-06-11T01:09:16.717072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11112","citing_title":"A coarse Menger's Theorem for planar and bounded genus graphs","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC","json":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC.json","graph_json":"https://pith.science/api/pith-number/NRHWE4H32VIOSTEGIIY3DFINKC/graph.json","events_json":"https://pith.science/api/pith-number/NRHWE4H32VIOSTEGIIY3DFINKC/events.json","paper":"https://pith.science/paper/NRHWE4H3"},"agent_actions":{"view_html":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC","download_json":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC.json","view_paper":"https://pith.science/paper/NRHWE4H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09035&json=true","fetch_graph":"https://pith.science/api/pith-number/NRHWE4H32VIOSTEGIIY3DFINKC/graph.json","fetch_events":"https://pith.science/api/pith-number/NRHWE4H32VIOSTEGIIY3DFINKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/action/storage_attestation","attest_author":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/action/author_attestation","sign_citation":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/action/citation_signature","submit_replication":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/action/replication_record"}},"created_at":"2026-06-11T01:09:16.717072+00:00","updated_at":"2026-06-11T01:09:16.717072+00:00"}