{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DPIWZHJBHD7LFPE5IL7HBL2NJM","short_pith_number":"pith:DPIWZHJB","canonical_record":{"source":{"id":"2409.15191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T16:41:30Z","cross_cats_sorted":[],"title_canon_sha256":"20f93373e0011777caa624c3fa8c31b53722eda9bed07fd08186d776b57e0317","abstract_canon_sha256":"67b7ca9ffe6b04290dde5aee37d609cf1021386bbe4a1c3587f433a0ea57ee90"},"schema_version":"1.0"},"canonical_sha256":"1bd16c9d2138feb2bc9d42fe70af4d4b236c221d38eed0bb929f090834ebf936","source":{"kind":"arxiv","id":"2409.15191","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.15191","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"2409.15191v1","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15191","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"DPIWZHJBHD7L","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"pith_short_16","alias_value":"DPIWZHJBHD7LFPE5","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"pith_short_8","alias_value":"DPIWZHJB","created_at":"2026-07-05T09:10:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DPIWZHJBHD7LFPE5IL7HBL2NJM","target":"record","payload":{"canonical_record":{"source":{"id":"2409.15191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T16:41:30Z","cross_cats_sorted":[],"title_canon_sha256":"20f93373e0011777caa624c3fa8c31b53722eda9bed07fd08186d776b57e0317","abstract_canon_sha256":"67b7ca9ffe6b04290dde5aee37d609cf1021386bbe4a1c3587f433a0ea57ee90"},"schema_version":"1.0"},"canonical_sha256":"1bd16c9d2138feb2bc9d42fe70af4d4b236c221d38eed0bb929f090834ebf936","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:37.457926Z","signature_b64":"6lQcapRBk4jMYEIAGJ88t5QdqrMeMF0SI3LIbh2crtBkLMmxzWbEE0FjVwZmTL2+itw3oGov+Hsa9BtrsSndAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd16c9d2138feb2bc9d42fe70af4d4b236c221d38eed0bb929f090834ebf936","last_reissued_at":"2026-07-05T09:10:37.457505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:37.457505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.15191","source_version":1,"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-05T09:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbB6dQAtRFvnDNIV20BRVzYULHohTHdq4zfXMHYQdr2QRMQIuxS/vEziHKajE2VqzCvJC7AuDgyLuHC5Hi60Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:31:41.162047Z"},"content_sha256":"80741a784e504c3af7c877a379c2fb4c7e6a8dd56685f29647767b817e60eb3b","schema_version":"1.0","event_id":"sha256:80741a784e504c3af7c877a379c2fb4c7e6a8dd56685f29647767b817e60eb3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DPIWZHJBHD7LFPE5IL7HBL2NJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hyperstability in the Erd\\H{o}s-S\\'os Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy","submitted_at":"2024-09-23T16:41:30Z","abstract_excerpt":"A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order $3|T|$.\n  This theorem has the ability to turn questions about sparse $T$-free graphs (about which relatively little is known), into questions about dense $T$-free graphs (for which we have powerful techniques like regularity). There are various applications, the most notable being a proof of the Erd\\H{o}s-S\\'os Conjecture for large, bounded degree trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15191","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/2409.15191/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-05T09:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3cMUGa7+/Eep13HeYvq3A4B7NufV66p0Hp5+ZzT8p4/AV68h555YnySfQaxk2yWLrd1DKNLjHb72Kc5/RN+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:31:41.162432Z"},"content_sha256":"794c5e51cbb86e821ba654d7dafda418190ccf8ad45304a2da2a58a161f1accd","schema_version":"1.0","event_id":"sha256:794c5e51cbb86e821ba654d7dafda418190ccf8ad45304a2da2a58a161f1accd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/bundle.json","state_url":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/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-06T18:31:41Z","links":{"resolver":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM","bundle":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/bundle.json","state":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DPIWZHJBHD7LFPE5IL7HBL2NJM","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":"67b7ca9ffe6b04290dde5aee37d609cf1021386bbe4a1c3587f433a0ea57ee90","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T16:41:30Z","title_canon_sha256":"20f93373e0011777caa624c3fa8c31b53722eda9bed07fd08186d776b57e0317"},"schema_version":"1.0","source":{"id":"2409.15191","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.15191","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"2409.15191v1","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15191","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"DPIWZHJBHD7L","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"pith_short_16","alias_value":"DPIWZHJBHD7LFPE5","created_at":"2026-07-05T09:10:37Z"},{"alias_kind":"pith_short_8","alias_value":"DPIWZHJB","created_at":"2026-07-05T09:10:37Z"}],"graph_snapshots":[{"event_id":"sha256:794c5e51cbb86e821ba654d7dafda418190ccf8ad45304a2da2a58a161f1accd","target":"graph","created_at":"2026-07-05T09:10:37Z","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/2409.15191/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order $3|T|$.\n  This theorem has the ability to turn questions about sparse $T$-free graphs (about which relatively little is known), into questions about dense $T$-free graphs (for which we have powerful techniques like regularity). There are various applications, the most notable being a proof of the Erd\\H{o}s-S\\'os Conjecture for large, bounded degree trees.","authors_text":"Alexey Pokrovskiy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T16:41:30Z","title":"Hyperstability in the Erd\\H{o}s-S\\'os Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15191","kind":"arxiv","version":1},"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:80741a784e504c3af7c877a379c2fb4c7e6a8dd56685f29647767b817e60eb3b","target":"record","created_at":"2026-07-05T09:10:37Z","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":"67b7ca9ffe6b04290dde5aee37d609cf1021386bbe4a1c3587f433a0ea57ee90","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T16:41:30Z","title_canon_sha256":"20f93373e0011777caa624c3fa8c31b53722eda9bed07fd08186d776b57e0317"},"schema_version":"1.0","source":{"id":"2409.15191","kind":"arxiv","version":1}},"canonical_sha256":"1bd16c9d2138feb2bc9d42fe70af4d4b236c221d38eed0bb929f090834ebf936","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bd16c9d2138feb2bc9d42fe70af4d4b236c221d38eed0bb929f090834ebf936","first_computed_at":"2026-07-05T09:10:37.457505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:10:37.457505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6lQcapRBk4jMYEIAGJ88t5QdqrMeMF0SI3LIbh2crtBkLMmxzWbEE0FjVwZmTL2+itw3oGov+Hsa9BtrsSndAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:10:37.457926Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.15191","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80741a784e504c3af7c877a379c2fb4c7e6a8dd56685f29647767b817e60eb3b","sha256:794c5e51cbb86e821ba654d7dafda418190ccf8ad45304a2da2a58a161f1accd"],"state_sha256":"2499848de745b97b3db8253efa6951fb0d221e8685627fe17ce7b69ad9a6170c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKJyMS/3B+J+C0MD9CjHSaksZWHUSBZPkmvqO/Naqesu2kJzoSTvzpiBJjg2y5jBniUUuI3EgI6kXS1mIQdtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:31:41.164455Z","bundle_sha256":"2a7412c65875aa8e072b99c4204f932a7d8bdffa2f0c32b03cab1e90640acad3"}}