{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IOPBDHHQITGHX4G4VV3YPSNBMM","short_pith_number":"pith:IOPBDHHQ","schema_version":"1.0","canonical_sha256":"439e119cf044cc7bf0dcad7787c9a163345f704637c66097391fcc72b43df2ff","source":{"kind":"arxiv","id":"2501.09839","version":3},"attestation_state":"computed","paper":{"title":"Asymptotic structure. I. Coarse tree-width","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-01-16T20:57:17Z","abstract_excerpt":"In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a quasi-isometry to a graph with bounded tree-width. (The ``if'' half is easy, but the ``only if'' half is challenging.) This generalizes a recent result of Berger and Seymour, concerning tree-decompositions when each bag has bounded radius."},"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":"2501.09839","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-16T20:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"d01fe010767ba94c70d9a53ea805a78c08478aa83effbcb24d1889621efc1446","abstract_canon_sha256":"454f801fa7eac873ed4785029fc48867c1bb8e6df2ffba44afe855596dbd03fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:12.357551Z","signature_b64":"7ig9TN+WWqWanhAyfO/qsCsnYdhNZIx61MrGLgAZybuS/uIjDOdPxixEqvW+oo20Gx8JoCCOQRvW6Y7qovzwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439e119cf044cc7bf0dcad7787c9a163345f704637c66097391fcc72b43df2ff","last_reissued_at":"2026-07-05T12:05:12.356975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:12.356975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic structure. I. Coarse tree-width","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-01-16T20:57:17Z","abstract_excerpt":"In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a quasi-isometry to a graph with bounded tree-width. (The ``if'' half is easy, but the ``only if'' half is challenging.) This generalizes a recent result of Berger and Seymour, concerning tree-decompositions when each bag has bounded radius."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09839","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/2501.09839/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":"2501.09839","created_at":"2026-07-05T12:05:12.357044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.09839v3","created_at":"2026-07-05T12:05:12.357044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09839","created_at":"2026-07-05T12:05:12.357044+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOPBDHHQITGH","created_at":"2026-07-05T12:05:12.357044+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOPBDHHQITGHX4G4","created_at":"2026-07-05T12:05:12.357044+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOPBDHHQ","created_at":"2026-07-05T12:05:12.357044+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":16,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07111","citing_title":"A coarse block-cut tree theorem","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19473","citing_title":"Vertex cuts and median decompositions","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11112","citing_title":"A coarse Menger's Theorem for planar and bounded genus graphs","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10068","citing_title":"Coarse Menger property of quasi-minor excluded graphs and length spaces","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM","json":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM.json","graph_json":"https://pith.science/api/pith-number/IOPBDHHQITGHX4G4VV3YPSNBMM/graph.json","events_json":"https://pith.science/api/pith-number/IOPBDHHQITGHX4G4VV3YPSNBMM/events.json","paper":"https://pith.science/paper/IOPBDHHQ"},"agent_actions":{"view_html":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM","download_json":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM.json","view_paper":"https://pith.science/paper/IOPBDHHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.09839&json=true","fetch_graph":"https://pith.science/api/pith-number/IOPBDHHQITGHX4G4VV3YPSNBMM/graph.json","fetch_events":"https://pith.science/api/pith-number/IOPBDHHQITGHX4G4VV3YPSNBMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/action/storage_attestation","attest_author":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/action/author_attestation","sign_citation":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/action/citation_signature","submit_replication":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/action/replication_record"}},"created_at":"2026-07-05T12:05:12.357044+00:00","updated_at":"2026-07-05T12:05:12.357044+00:00"}