{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LPPJEPZXNNM22DHR2RJRJKKJDX","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":"252dec873eb48bc92fb345a435c130d40c5a60cef4c8f0d0b33ac81a4bcfaa3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-22T08:18:58Z","title_canon_sha256":"22f1692db3eccdcf9eb7577b6fb98aa126c464c33c364f25ca04c5ac813fb1c5"},"schema_version":"1.0","source":{"id":"2508.16199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.16199","created_at":"2026-07-05T11:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"2508.16199v1","created_at":"2026-07-05T11:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16199","created_at":"2026-07-05T11:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPPJEPZXNNM2","created_at":"2026-07-05T11:57:43Z"},{"alias_kind":"pith_short_16","alias_value":"LPPJEPZXNNM22DHR","created_at":"2026-07-05T11:57:43Z"},{"alias_kind":"pith_short_8","alias_value":"LPPJEPZX","created_at":"2026-07-05T11:57:43Z"}],"graph_snapshots":[{"event_id":"sha256:61095f852a5feff2a45d102c1122c46b1321b88d1e74ae166f130a8950c6a0d6","target":"graph","created_at":"2026-07-05T11:57:43Z","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/2508.16199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In strengthening a result of Andr\\'asfai, Erd\\H{o}s and S\\'os in 1974, H\\\"{a}ggkvist proved that if $G$ is an $n$-vertex $C_{2k+1}$-free graph with minimum degree $\\delta(G)>\\frac{2n}{2k+3}$ and $n>\\binom{k+2}{2}(2k+3)(3k+2)$, then $G$ contains no odd cycle of length greater than $\\frac{k+1}{2}$. This result has many applications.In this paper, we consider a similar problem by replacing minimum degree condition with edge number condition. We prove that for integers $n,k,r$ with $k\\geq 2,3\\leq r\\leq 2k$ and $n \\geq 2\\left(r+2\\right)\\left(r+1\\right)\\left(r+2k\\right)$, if $G$ is an $n$-vertex $C_","authors_text":"Rui Wang, Shipeng Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16199","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:1962568184c974d252c197b79755fa255a42b3fa51da1fbc090dd01ad1efaca9","target":"record","created_at":"2026-07-05T11:57:43Z","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":"252dec873eb48bc92fb345a435c130d40c5a60cef4c8f0d0b33ac81a4bcfaa3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-22T08:18:58Z","title_canon_sha256":"22f1692db3eccdcf9eb7577b6fb98aa126c464c33c364f25ca04c5ac813fb1c5"},"schema_version":"1.0","source":{"id":"2508.16199","kind":"arxiv","version":1}},"canonical_sha256":"5bde923f376b59ad0cf1d45314a9491df7947cdcfd3833705edd02ccc4adfebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bde923f376b59ad0cf1d45314a9491df7947cdcfd3833705edd02ccc4adfebf","first_computed_at":"2026-07-05T11:57:43.871733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:57:43.871733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i0GAexs0MXPpGUYY9SuxxNKnya4ZJY9Fz2FBy+N6HbSeUzNhYnBXTZc9mraGFbMPUrsboz8MIqI1DDI2ZVcuAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:57:43.872134Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.16199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1962568184c974d252c197b79755fa255a42b3fa51da1fbc090dd01ad1efaca9","sha256:61095f852a5feff2a45d102c1122c46b1321b88d1e74ae166f130a8950c6a0d6"],"state_sha256":"1bfca2ed36ca1d5c60101a75e90f1506cd0a06198fa37aa32da75060512339ef"}