{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NRHWE4H32VIOSTEGIIY3DFINKC","short_pith_number":"pith:NRHWE4H3","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"},"canonical_sha256":"6c4f6270fbd550e94c864231b1950d508552a44cddeb02e9d1d1fa9ebc7ed8a4","source":{"kind":"arxiv","id":"2509.09035","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09035","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09035v3","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09035","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"pith_short_12","alias_value":"NRHWE4H32VIO","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"pith_short_16","alias_value":"NRHWE4H32VIOSTEG","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"pith_short_8","alias_value":"NRHWE4H3","created_at":"2026-06-11T01:09:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NRHWE4H32VIOSTEGIIY3DFINKC","target":"record","payload":{"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"},"canonical_sha256":"6c4f6270fbd550e94c864231b1950d508552a44cddeb02e9d1d1fa9ebc7ed8a4","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"},"source_kind":"arxiv","source_id":"2509.09035","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-06-11T01:09:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LZdP/zCZNvDAHNeIvAQHIAje81kyxD0ZoB3cVAvBko1G62CyTnEPzvRalDUSuo8MHVx/1LpHreKbZh3NMXvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:01:21.413533Z"},"content_sha256":"7084db8c0e28056be0f0c06446f78dee0bc910b42b782ed0424a9709a7877b4f","schema_version":"1.0","event_id":"sha256:7084db8c0e28056be0f0c06446f78dee0bc910b42b782ed0424a9709a7877b4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NRHWE4H32VIOSTEGIIY3DFINKC","target":"graph","payload":{"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"},"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-06-11T01:09:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BICEoC1pkCCv8o0X3ONOwdam0hLia6dNgWL/t1cI6LyNtJFmuX6B5Zs2p2h6I/LnmH8eTuc8kLn32XQpiWQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:01:21.413908Z"},"content_sha256":"5f31b5f06e2bc5467c39d29e15c092e296c7adac52bf5d68e9c22fef6a437d06","schema_version":"1.0","event_id":"sha256:5f31b5f06e2bc5467c39d29e15c092e296c7adac52bf5d68e9c22fef6a437d06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/bundle.json","state_url":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRHWE4H32VIOSTEGIIY3DFINKC/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-07-01T21:01:21Z","links":{"resolver":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC","bundle":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/bundle.json","state":"https://pith.science/pith/NRHWE4H32VIOSTEGIIY3DFINKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRHWE4H32VIOSTEGIIY3DFINKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NRHWE4H32VIOSTEGIIY3DFINKC","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":"13ca449b4eccd358fbcfe53d205114c53da576f06dc2c2b5bac1878257511631","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T22:11:08Z","title_canon_sha256":"7a16b1dc333478870d41eb832ec569fa46c56ed760f9d0e5f9d62c8b9cc50861"},"schema_version":"1.0","source":{"id":"2509.09035","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09035","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09035v3","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09035","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"pith_short_12","alias_value":"NRHWE4H32VIO","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"pith_short_16","alias_value":"NRHWE4H32VIOSTEG","created_at":"2026-06-11T01:09:16Z"},{"alias_kind":"pith_short_8","alias_value":"NRHWE4H3","created_at":"2026-06-11T01:09:16Z"}],"graph_snapshots":[{"event_id":"sha256:5f31b5f06e2bc5467c39d29e15c092e296c7adac52bf5d68e9c22fef6a437d06","target":"graph","created_at":"2026-06-11T01:09:16Z","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/2509.09035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 $","authors_text":"Alex Scott, Paul Seymour, Tung Nguyen","cross_cats":["math.MG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T22:11:08Z","title":"Asymptotic structure. III. Excluding a fat tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09035","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:7084db8c0e28056be0f0c06446f78dee0bc910b42b782ed0424a9709a7877b4f","target":"record","created_at":"2026-06-11T01:09:16Z","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":"13ca449b4eccd358fbcfe53d205114c53da576f06dc2c2b5bac1878257511631","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T22:11:08Z","title_canon_sha256":"7a16b1dc333478870d41eb832ec569fa46c56ed760f9d0e5f9d62c8b9cc50861"},"schema_version":"1.0","source":{"id":"2509.09035","kind":"arxiv","version":3}},"canonical_sha256":"6c4f6270fbd550e94c864231b1950d508552a44cddeb02e9d1d1fa9ebc7ed8a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c4f6270fbd550e94c864231b1950d508552a44cddeb02e9d1d1fa9ebc7ed8a4","first_computed_at":"2026-06-11T01:09:16.716921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:16.716921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkpezYXjB5s0iKwOWo3gPilmacm3r1eIG5+b7lr/YXSa6vGw1QHOg4NtZbD2pISkB7LcbvlH27KZATjJala3BQ==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:16.717889Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09035","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7084db8c0e28056be0f0c06446f78dee0bc910b42b782ed0424a9709a7877b4f","sha256:5f31b5f06e2bc5467c39d29e15c092e296c7adac52bf5d68e9c22fef6a437d06"],"state_sha256":"f1d9725422320172ae73442d6a9b9f38caf4f17c80085b358f9646639f3b0dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLpN3hr27IDAmyHMeqe7EG8RgeShuKr+n1liE6CAU50FjxLS4f95ZDz8T5jpYCLQ7aAABFCgDPyTAlXepVQkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:01:21.415956Z","bundle_sha256":"65d6defc9da9bd0310fcec1965c8de5d614e15168680cf9197653aa61f8f2d13"}}