{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IOPBDHHQITGHX4G4VV3YPSNBMM","short_pith_number":"pith:IOPBDHHQ","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"},"canonical_sha256":"439e119cf044cc7bf0dcad7787c9a163345f704637c66097391fcc72b43df2ff","source":{"kind":"arxiv","id":"2501.09839","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.09839","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2501.09839v3","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09839","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"IOPBDHHQITGH","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"IOPBDHHQITGHX4G4","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"IOPBDHHQ","created_at":"2026-07-05T12:05:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IOPBDHHQITGHX4G4VV3YPSNBMM","target":"record","payload":{"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"},"canonical_sha256":"439e119cf044cc7bf0dcad7787c9a163345f704637c66097391fcc72b43df2ff","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"},"source_kind":"arxiv","source_id":"2501.09839","source_version":3,"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-07-05T12:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVEcWkRf1JiPwaDTuZ7TJz6ae9b/ThpB/AdUyEdSdKIYu2M0TYPtWld6f7r1/BBnZSQuK1WjA2EPqYf+vvTuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:56:58.747559Z"},"content_sha256":"0570c9e9d96a4d6e332a066de5fa2fddd79cc895bdccf192309b314ba577f47d","schema_version":"1.0","event_id":"sha256:0570c9e9d96a4d6e332a066de5fa2fddd79cc895bdccf192309b314ba577f47d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IOPBDHHQITGHX4G4VV3YPSNBMM","target":"graph","payload":{"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"},"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-07-05T12:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlfROgL1KEHs1j3FEqxgTlm9jIj3Ixx3VIq1mF4XczVVKe+Szgktjwpkx9u+aJYLMO6WRWZsvcvLgtW2gez5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:56:58.748570Z"},"content_sha256":"2f1ae4cfc35a7a54673b5701764d24c13e710c50c512d06eb64797c5f7286bce","schema_version":"1.0","event_id":"sha256:2f1ae4cfc35a7a54673b5701764d24c13e710c50c512d06eb64797c5f7286bce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/bundle.json","state_url":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/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-08-05T15:56:58Z","links":{"resolver":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM","bundle":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/bundle.json","state":"https://pith.science/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOPBDHHQITGHX4G4VV3YPSNBMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IOPBDHHQITGHX4G4VV3YPSNBMM","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":"454f801fa7eac873ed4785029fc48867c1bb8e6df2ffba44afe855596dbd03fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-16T20:57:17Z","title_canon_sha256":"d01fe010767ba94c70d9a53ea805a78c08478aa83effbcb24d1889621efc1446"},"schema_version":"1.0","source":{"id":"2501.09839","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.09839","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2501.09839v3","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09839","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"IOPBDHHQITGH","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"IOPBDHHQITGHX4G4","created_at":"2026-07-05T12:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"IOPBDHHQ","created_at":"2026-07-05T12:05:12Z"}],"graph_snapshots":[{"event_id":"sha256:2f1ae4cfc35a7a54673b5701764d24c13e710c50c512d06eb64797c5f7286bce","target":"graph","created_at":"2026-07-05T12:05:12Z","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/2501.09839/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-16T20:57:17Z","title":"Asymptotic structure. I. Coarse tree-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09839","kind":"arxiv","version":3},"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:0570c9e9d96a4d6e332a066de5fa2fddd79cc895bdccf192309b314ba577f47d","target":"record","created_at":"2026-07-05T12:05:12Z","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":"454f801fa7eac873ed4785029fc48867c1bb8e6df2ffba44afe855596dbd03fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-16T20:57:17Z","title_canon_sha256":"d01fe010767ba94c70d9a53ea805a78c08478aa83effbcb24d1889621efc1446"},"schema_version":"1.0","source":{"id":"2501.09839","kind":"arxiv","version":3}},"canonical_sha256":"439e119cf044cc7bf0dcad7787c9a163345f704637c66097391fcc72b43df2ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"439e119cf044cc7bf0dcad7787c9a163345f704637c66097391fcc72b43df2ff","first_computed_at":"2026-07-05T12:05:12.356975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:05:12.356975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ig9TN+WWqWanhAyfO/qsCsnYdhNZIx61MrGLgAZybuS/uIjDOdPxixEqvW+oo20Gx8JoCCOQRvW6Y7qovzwBA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:05:12.357551Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.09839","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0570c9e9d96a4d6e332a066de5fa2fddd79cc895bdccf192309b314ba577f47d","sha256:2f1ae4cfc35a7a54673b5701764d24c13e710c50c512d06eb64797c5f7286bce"],"state_sha256":"3ea20d0789bfd30a6aa04acf79d93df2460072b7214cc13e3367e463b80bf283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0kuAddi9JPUakvfj68HojXuyGCq56yw4Aa8FkZ9UfrvNq+vLDuy41SB1RHDIODPvAlo/Ps666yuFwGc9umwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T15:56:58.752905Z","bundle_sha256":"98c463e7a567d6970e0973d0cf134845a383b16749825829a74942e44d3e72ab"}}