{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T26VD7C4Y6NI22AANRJ6V6PG7U","short_pith_number":"pith:T26VD7C4","canonical_record":{"source":{"id":"2607.02483","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-02T17:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"25fe539dd87bb978187ed751b5618c210618b7d2422cc40d24de981f158ad6b0","abstract_canon_sha256":"e20ecc892b0372dc6fc017c13562a0bbe9a82d7d32800a4cfc999cb7e425cf68"},"schema_version":"1.0"},"canonical_sha256":"9ebd51fc5cc79a8d68006c53eaf9e6fd288a827c037f2018966a504f2cc1f017","source":{"kind":"arxiv","id":"2607.02483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02483","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02483v1","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02483","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"T26VD7C4Y6NI","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"pith_short_16","alias_value":"T26VD7C4Y6NI22AA","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"pith_short_8","alias_value":"T26VD7C4","created_at":"2026-07-03T01:18:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T26VD7C4Y6NI22AANRJ6V6PG7U","target":"record","payload":{"canonical_record":{"source":{"id":"2607.02483","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-02T17:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"25fe539dd87bb978187ed751b5618c210618b7d2422cc40d24de981f158ad6b0","abstract_canon_sha256":"e20ecc892b0372dc6fc017c13562a0bbe9a82d7d32800a4cfc999cb7e425cf68"},"schema_version":"1.0"},"canonical_sha256":"9ebd51fc5cc79a8d68006c53eaf9e6fd288a827c037f2018966a504f2cc1f017","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:18:00.476665Z","signature_b64":"TaylSMAnZzkxUTOcpDYC2GzHbNcDLrsOPiuIroBjuzQBSft2SaTmr3WqK8E/b9Ht5vro9jFE8zW7672VRa6NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ebd51fc5cc79a8d68006c53eaf9e6fd288a827c037f2018966a504f2cc1f017","last_reissued_at":"2026-07-03T01:18:00.476274Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:18:00.476274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.02483","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-03T01:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6ix+KpQRIaq9fAmz+Xq81SdU4Vz7aGfgJ50KACAwgtfvqmxVxJUVi1yQOg+zFYmLSIlBuciBWcjRcoQ1FpDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T04:59:08.492628Z"},"content_sha256":"36f5b89f3b01db2e680be57335332006798c042bde0b42162301f0256ac521ec","schema_version":"1.0","event_id":"sha256:36f5b89f3b01db2e680be57335332006798c042bde0b42162301f0256ac521ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T26VD7C4Y6NI22AANRJ6V6PG7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness and hyperstability for the Erd\\H{o}s-Gallai theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Micha Christoph, Yuval Wigderson","submitted_at":"2026-07-02T17:50:56Z","abstract_excerpt":"The Erd\\H{o}s-Gallai theorem states that every graph of average degree $d$ contains a cycle of length at least $d$. We prove the following robust extension of the Erd\\H{o}s-Gallai theorem: For every $c>0$ there exists $K$ such that for all $d\\geq K$, $p\\geq K/d$ and every graph $G$ with average degree $d$, the random graph $G_p$ obtained by independently percolating each edge of $G$ with probability $p$ contains a cycle of length $(1-c)d$ asymptotically almost surely as $|V(G)|\\to \\infty$. With related methods, we prove the following hyperstability version of the Erd\\H{o}s-Gallai theorem: any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02483","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/2607.02483/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-03T01:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWoRtrpvlODHo2haHzi7VrGoDxToA5SZxwrQ+tPba8ZFHV70Rj0lQqbN8pNs14ylgzkhXCh0UV+t7yJ7gcw9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T04:59:08.493033Z"},"content_sha256":"b32e3f72e139736124694c6d7314ff3fbfe8516c4e51e0324c89a26a37bb6b8b","schema_version":"1.0","event_id":"sha256:b32e3f72e139736124694c6d7314ff3fbfe8516c4e51e0324c89a26a37bb6b8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T26VD7C4Y6NI22AANRJ6V6PG7U/bundle.json","state_url":"https://pith.science/pith/T26VD7C4Y6NI22AANRJ6V6PG7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T26VD7C4Y6NI22AANRJ6V6PG7U/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-08T04:59:08Z","links":{"resolver":"https://pith.science/pith/T26VD7C4Y6NI22AANRJ6V6PG7U","bundle":"https://pith.science/pith/T26VD7C4Y6NI22AANRJ6V6PG7U/bundle.json","state":"https://pith.science/pith/T26VD7C4Y6NI22AANRJ6V6PG7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T26VD7C4Y6NI22AANRJ6V6PG7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T26VD7C4Y6NI22AANRJ6V6PG7U","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":"e20ecc892b0372dc6fc017c13562a0bbe9a82d7d32800a4cfc999cb7e425cf68","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-02T17:50:56Z","title_canon_sha256":"25fe539dd87bb978187ed751b5618c210618b7d2422cc40d24de981f158ad6b0"},"schema_version":"1.0","source":{"id":"2607.02483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02483","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02483v1","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02483","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"T26VD7C4Y6NI","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"pith_short_16","alias_value":"T26VD7C4Y6NI22AA","created_at":"2026-07-03T01:18:00Z"},{"alias_kind":"pith_short_8","alias_value":"T26VD7C4","created_at":"2026-07-03T01:18:00Z"}],"graph_snapshots":[{"event_id":"sha256:b32e3f72e139736124694c6d7314ff3fbfe8516c4e51e0324c89a26a37bb6b8b","target":"graph","created_at":"2026-07-03T01:18:00Z","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/2607.02483/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Erd\\H{o}s-Gallai theorem states that every graph of average degree $d$ contains a cycle of length at least $d$. We prove the following robust extension of the Erd\\H{o}s-Gallai theorem: For every $c>0$ there exists $K$ such that for all $d\\geq K$, $p\\geq K/d$ and every graph $G$ with average degree $d$, the random graph $G_p$ obtained by independently percolating each edge of $G$ with probability $p$ contains a cycle of length $(1-c)d$ asymptotically almost surely as $|V(G)|\\to \\infty$. With related methods, we prove the following hyperstability version of the Erd\\H{o}s-Gallai theorem: any ","authors_text":"Alp M\\\"uyesser, Micha Christoph, Yuval Wigderson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-02T17:50:56Z","title":"Robustness and hyperstability for the Erd\\H{o}s-Gallai theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02483","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:36f5b89f3b01db2e680be57335332006798c042bde0b42162301f0256ac521ec","target":"record","created_at":"2026-07-03T01:18:00Z","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":"e20ecc892b0372dc6fc017c13562a0bbe9a82d7d32800a4cfc999cb7e425cf68","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-02T17:50:56Z","title_canon_sha256":"25fe539dd87bb978187ed751b5618c210618b7d2422cc40d24de981f158ad6b0"},"schema_version":"1.0","source":{"id":"2607.02483","kind":"arxiv","version":1}},"canonical_sha256":"9ebd51fc5cc79a8d68006c53eaf9e6fd288a827c037f2018966a504f2cc1f017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ebd51fc5cc79a8d68006c53eaf9e6fd288a827c037f2018966a504f2cc1f017","first_computed_at":"2026-07-03T01:18:00.476274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:18:00.476274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TaylSMAnZzkxUTOcpDYC2GzHbNcDLrsOPiuIroBjuzQBSft2SaTmr3WqK8E/b9Ht5vro9jFE8zW7672VRa6NCw==","signature_status":"signed_v1","signed_at":"2026-07-03T01:18:00.476665Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.02483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36f5b89f3b01db2e680be57335332006798c042bde0b42162301f0256ac521ec","sha256:b32e3f72e139736124694c6d7314ff3fbfe8516c4e51e0324c89a26a37bb6b8b"],"state_sha256":"c4e3f11e10fbe68e4026b01b11c6b8439a45766fb1cd75eedfa5299b6dcf5dec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SlF78xuGyQxoCgWEGYiHi141G2fJaxCWdpJDvEqAA0/nLUjPjnrjIK41YYE7+09jnx97k4OIiQByC2xZjwmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T04:59:08.495570Z","bundle_sha256":"e2322b5be5af56b43287cbcb676c7d98d588d8c80337562f4a34ed3b6a05ca2d"}}