{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QNGORMMF2D4AIV4K757ZAWVBCW","short_pith_number":"pith:QNGORMMF","schema_version":"1.0","canonical_sha256":"834ce8b185d0f804578aff7f905aa115a79b33d0b595c5d0f07d866e7fe8cf0d","source":{"kind":"arxiv","id":"2607.04323","version":1},"attestation_state":"computed","paper":{"title":"On the structure of dense graphs with given odd girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shipeng Wang, Xingyan Lu","submitted_at":"2026-07-05T14:14:28Z","abstract_excerpt":"A classical theorem of Andr\\'asfai, Erd\\H{o}s, and S\\'os states that every $n$-vertex graph $G$ with odd girth at least $2k+1$ and minimum degree $\\delta(G)>\\frac{2n}{2k+1}$ is bipartite (i.e., homomorphic to $K_2$). Messuti and Schacht proved that the same odd girth condition with $\\delta(G)>\\frac{3n}{4k}$ forces a homomorphism to $C_{2k+1}$.\n  In this paper, we strengthen the above results by showing that every $n$-vertex graph $G$ with odd girth at least $2k+1$ and minimum degree $\\delta(G)>\\frac{4n}{6k-1}$ is homomorphic to the M\\\"obius ladder on $4k$ vertices. This answers a question of M"},"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":"2607.04323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-05T14:14:28Z","cross_cats_sorted":[],"title_canon_sha256":"888dededa2603272d6002caef0c80b51e9cef23bf8cf06551714a5269835e3f5","abstract_canon_sha256":"fca80e27c5719267a1d8d41cb4cb707c571ea1d2798f2b4a2b8368c83072808f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:08.771228Z","signature_b64":"VLybJXYZwdSQnOrP2htsf7zatGWf7s/LQXBvM80q8RUhCc3O8Gg8t0e9TPJTiifII1HC8VOQIYRaiQz8A+HHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"834ce8b185d0f804578aff7f905aa115a79b33d0b595c5d0f07d866e7fe8cf0d","last_reissued_at":"2026-07-07T02:19:08.770309Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:08.770309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the structure of dense graphs with given odd girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shipeng Wang, Xingyan Lu","submitted_at":"2026-07-05T14:14:28Z","abstract_excerpt":"A classical theorem of Andr\\'asfai, Erd\\H{o}s, and S\\'os states that every $n$-vertex graph $G$ with odd girth at least $2k+1$ and minimum degree $\\delta(G)>\\frac{2n}{2k+1}$ is bipartite (i.e., homomorphic to $K_2$). Messuti and Schacht proved that the same odd girth condition with $\\delta(G)>\\frac{3n}{4k}$ forces a homomorphism to $C_{2k+1}$.\n  In this paper, we strengthen the above results by showing that every $n$-vertex graph $G$ with odd girth at least $2k+1$ and minimum degree $\\delta(G)>\\frac{4n}{6k-1}$ is homomorphic to the M\\\"obius ladder on $4k$ vertices. This answers a question of M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04323","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.04323/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":"2607.04323","created_at":"2026-07-07T02:19:08.770463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04323v1","created_at":"2026-07-07T02:19:08.770463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04323","created_at":"2026-07-07T02:19:08.770463+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNGORMMF2D4A","created_at":"2026-07-07T02:19:08.770463+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNGORMMF2D4AIV4K","created_at":"2026-07-07T02:19:08.770463+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNGORMMF","created_at":"2026-07-07T02:19:08.770463+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/QNGORMMF2D4AIV4K757ZAWVBCW","json":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW.json","graph_json":"https://pith.science/api/pith-number/QNGORMMF2D4AIV4K757ZAWVBCW/graph.json","events_json":"https://pith.science/api/pith-number/QNGORMMF2D4AIV4K757ZAWVBCW/events.json","paper":"https://pith.science/paper/QNGORMMF"},"agent_actions":{"view_html":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW","download_json":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW.json","view_paper":"https://pith.science/paper/QNGORMMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04323&json=true","fetch_graph":"https://pith.science/api/pith-number/QNGORMMF2D4AIV4K757ZAWVBCW/graph.json","fetch_events":"https://pith.science/api/pith-number/QNGORMMF2D4AIV4K757ZAWVBCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW/action/storage_attestation","attest_author":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW/action/author_attestation","sign_citation":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW/action/citation_signature","submit_replication":"https://pith.science/pith/QNGORMMF2D4AIV4K757ZAWVBCW/action/replication_record"}},"created_at":"2026-07-07T02:19:08.770463+00:00","updated_at":"2026-07-07T02:19:08.770463+00:00"}