{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DHNISXQ2HH2FHZNDGHZRQL7BMB","short_pith_number":"pith:DHNISXQ2","schema_version":"1.0","canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","source":{"kind":"arxiv","id":"1602.03904","version":2},"attestation_state":"computed","paper":{"title":"On the structure of graphs with given odd girth and large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mathias Schacht, Silvia Messuti","submitted_at":"2016-02-11T21:27:16Z","abstract_excerpt":"We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\\'asfai, Erd\\H os, and S\\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{2}{2k+1}n$ must be bipartite. We consider graphs with a weaker condition on the minimum degree. Generalizing results of H\\\"aggkvist and of H\\\"aggkvist and Jin for the cases $k=2$ and $3$, we show that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{3}{4k}n$ is homomorphic to the cycle of length $2k+1$."},"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":"1602.03904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T21:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"c1404f6c37299647fc0412ec80e0982b63c6f2d904b240f27da881363957b697","abstract_canon_sha256":"7f84f303a686c1a4af87696e03599a01b4fb5cf874c77100e4cf6326645981be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.898735Z","signature_b64":"RjRdjuWLfOvR6y3EeC8AS4/3n4xaRomB7S9X7bfEVEustSDjF74D/a/MkBzbANRHBXiGl2+d+4CgGJzKe3/MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","last_reissued_at":"2026-05-18T01:19:10.898123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.898123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the structure of graphs with given odd girth and large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mathias Schacht, Silvia Messuti","submitted_at":"2016-02-11T21:27:16Z","abstract_excerpt":"We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\\'asfai, Erd\\H os, and S\\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{2}{2k+1}n$ must be bipartite. We consider graphs with a weaker condition on the minimum degree. Generalizing results of H\\\"aggkvist and of H\\\"aggkvist and Jin for the cases $k=2$ and $3$, we show that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{3}{4k}n$ is homomorphic to the cycle of length $2k+1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03904","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1602.03904","created_at":"2026-05-18T01:19:10.898205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03904v2","created_at":"2026-05-18T01:19:10.898205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03904","created_at":"2026-05-18T01:19:10.898205+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHNISXQ2HH2F","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHNISXQ2HH2FHZND","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHNISXQ2","created_at":"2026-05-18T12:30:12.583610+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/DHNISXQ2HH2FHZNDGHZRQL7BMB","json":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB.json","graph_json":"https://pith.science/api/pith-number/DHNISXQ2HH2FHZNDGHZRQL7BMB/graph.json","events_json":"https://pith.science/api/pith-number/DHNISXQ2HH2FHZNDGHZRQL7BMB/events.json","paper":"https://pith.science/paper/DHNISXQ2"},"agent_actions":{"view_html":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB","download_json":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB.json","view_paper":"https://pith.science/paper/DHNISXQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03904&json=true","fetch_graph":"https://pith.science/api/pith-number/DHNISXQ2HH2FHZNDGHZRQL7BMB/graph.json","fetch_events":"https://pith.science/api/pith-number/DHNISXQ2HH2FHZNDGHZRQL7BMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/action/storage_attestation","attest_author":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/action/author_attestation","sign_citation":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/action/citation_signature","submit_replication":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/action/replication_record"}},"created_at":"2026-05-18T01:19:10.898205+00:00","updated_at":"2026-05-18T01:19:10.898205+00:00"}