{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DPIWZHJBHD7LFPE5IL7HBL2NJM","short_pith_number":"pith:DPIWZHJB","schema_version":"1.0","canonical_sha256":"1bd16c9d2138feb2bc9d42fe70af4d4b236c221d38eed0bb929f090834ebf936","source":{"kind":"arxiv","id":"2409.15191","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.15191","created_at":"2026-07-05T09:10:37.457563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15191v1","created_at":"2026-07-05T09:10:37.457563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15191","created_at":"2026-07-05T09:10:37.457563+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPIWZHJBHD7L","created_at":"2026-07-05T09:10:37.457563+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPIWZHJBHD7LFPE5","created_at":"2026-07-05T09:10:37.457563+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPIWZHJB","created_at":"2026-07-05T09:10:37.457563+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02483","citing_title":"Robustness and hyperstability for the Erd\\H{o}s-Gallai theorem","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM","json":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM.json","graph_json":"https://pith.science/api/pith-number/DPIWZHJBHD7LFPE5IL7HBL2NJM/graph.json","events_json":"https://pith.science/api/pith-number/DPIWZHJBHD7LFPE5IL7HBL2NJM/events.json","paper":"https://pith.science/paper/DPIWZHJB"},"agent_actions":{"view_html":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM","download_json":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM.json","view_paper":"https://pith.science/paper/DPIWZHJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15191&json=true","fetch_graph":"https://pith.science/api/pith-number/DPIWZHJBHD7LFPE5IL7HBL2NJM/graph.json","fetch_events":"https://pith.science/api/pith-number/DPIWZHJBHD7LFPE5IL7HBL2NJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/action/storage_attestation","attest_author":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/action/author_attestation","sign_citation":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/action/citation_signature","submit_replication":"https://pith.science/pith/DPIWZHJBHD7LFPE5IL7HBL2NJM/action/replication_record"}},"created_at":"2026-07-05T09:10:37.457563+00:00","updated_at":"2026-07-05T09:10:37.457563+00:00"}