{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KONWM6BOIWCLHREZD5HHOTQ6UL","short_pith_number":"pith:KONWM6BO","schema_version":"1.0","canonical_sha256":"539b66782e4584b3c4991f4e774e1ea2e997d46dad7985395cb6cc2580f996cf","source":{"kind":"arxiv","id":"2606.07358","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree stability for graphs without odd-cycle blow-up","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yisai Xue","submitted_at":"2026-06-05T15:04:44Z","abstract_excerpt":"For fixed integers $g\\ge 2$ and $t\\ge 1$, and every $\\varepsilon>0$, we prove that there exists a constant $\\rho>0$ such that every $n$-vertex graph $G$ with $\\delta(G)\\ge (2/(2g+1)+\\varepsilon)n$ either contains $C_{2g-1}[t]$, or can be made bipartite by deleting $O(n^{2-\\rho})$ edges. This gives an affirmative answer to a question of Illingworth in [Minimum degree stability of $H$-free graphs, Combinatorica, 43(1):129-147, 2023.]"},"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":"2606.07358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-05T15:04:44Z","cross_cats_sorted":[],"title_canon_sha256":"4af8c627b635b7aa07cea846f40417d4fd864948f8555261bbb9e30839aa711e","abstract_canon_sha256":"601c4702b1e48784b1290731451abad1bb484bd33d8cef3918d62dfadf499d06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:21.914841Z","signature_b64":"4gld4C67VayqbsiHCryjcWDy4j9bFLv3Tgfddzp2e4M2BtdBHcImhuOdkjLrJKae7W+tchK1bcam73m+cObwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"539b66782e4584b3c4991f4e774e1ea2e997d46dad7985395cb6cc2580f996cf","last_reissued_at":"2026-06-08T01:05:21.914009Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:21.914009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree stability for graphs without odd-cycle blow-up","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yisai Xue","submitted_at":"2026-06-05T15:04:44Z","abstract_excerpt":"For fixed integers $g\\ge 2$ and $t\\ge 1$, and every $\\varepsilon>0$, we prove that there exists a constant $\\rho>0$ such that every $n$-vertex graph $G$ with $\\delta(G)\\ge (2/(2g+1)+\\varepsilon)n$ either contains $C_{2g-1}[t]$, or can be made bipartite by deleting $O(n^{2-\\rho})$ edges. This gives an affirmative answer to a question of Illingworth in [Minimum degree stability of $H$-free graphs, Combinatorica, 43(1):129-147, 2023.]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07358","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/2606.07358/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":"2606.07358","created_at":"2026-06-08T01:05:21.914138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07358v1","created_at":"2026-06-08T01:05:21.914138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07358","created_at":"2026-06-08T01:05:21.914138+00:00"},{"alias_kind":"pith_short_12","alias_value":"KONWM6BOIWCL","created_at":"2026-06-08T01:05:21.914138+00:00"},{"alias_kind":"pith_short_16","alias_value":"KONWM6BOIWCLHREZ","created_at":"2026-06-08T01:05:21.914138+00:00"},{"alias_kind":"pith_short_8","alias_value":"KONWM6BO","created_at":"2026-06-08T01:05:21.914138+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL","json":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL.json","graph_json":"https://pith.science/api/pith-number/KONWM6BOIWCLHREZD5HHOTQ6UL/graph.json","events_json":"https://pith.science/api/pith-number/KONWM6BOIWCLHREZD5HHOTQ6UL/events.json","paper":"https://pith.science/paper/KONWM6BO"},"agent_actions":{"view_html":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL","download_json":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL.json","view_paper":"https://pith.science/paper/KONWM6BO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07358&json=true","fetch_graph":"https://pith.science/api/pith-number/KONWM6BOIWCLHREZD5HHOTQ6UL/graph.json","fetch_events":"https://pith.science/api/pith-number/KONWM6BOIWCLHREZD5HHOTQ6UL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL/action/storage_attestation","attest_author":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL/action/author_attestation","sign_citation":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL/action/citation_signature","submit_replication":"https://pith.science/pith/KONWM6BOIWCLHREZD5HHOTQ6UL/action/replication_record"}},"created_at":"2026-06-08T01:05:21.914138+00:00","updated_at":"2026-06-08T01:05:21.914138+00:00"}