{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RGFQHROXCEFSQPPNN6DPSFTYPT","short_pith_number":"pith:RGFQHROX","schema_version":"1.0","canonical_sha256":"898b03c5d7110b283ded6f86f916787cd6e73a5c309db3c43e3d947b4af2d161","source":{"kind":"arxiv","id":"2012.10624","version":2},"attestation_state":"computed","paper":{"title":"A strengthening on odd cycles in graphs of given chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Jun Gao, Qingyi Huo","submitted_at":"2020-12-19T08:05:06Z","abstract_excerpt":"Resolving a conjecture of Bollob\\'{a}s and Erd\\H{o}s, Gy\\'{a}rf\\'{a}s proved that every graph $G$ of chromatic number $k+1\\geq 3$ contains cycles of $\\lfloor\\frac{k}{2}\\rfloor$ distinct odd lengths. We strengthen this prominent result by showing that such $G$ contains cycles of $\\lfloor\\frac{k}{2}\\rfloor$ consecutive odd lengths. Along the way, combining extremal and structural tools, we prove a stronger statement that every graph of chromatic number $k+1\\geq 7$ contains $k$ cycles of consecutive lengths, except that some block is $K_{k+1}$. As corollaries, this confirms a conjecture of Verstr"},"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":"2012.10624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-19T08:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"a8d4757f41e0c496e2bafcc080658cfa1772be8d9801aef4492cac3a31b28638","abstract_canon_sha256":"46c0273f46eb81627141e2642c612aaf1571226042f045c7f47967dbf44a0925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:39.654937Z","signature_b64":"+wLt5Oh/PP9++tpYATvyjqOoFp7tzT4Kx0FPMRiR/hNEHUDfr7H769E5LWV3ZYrfIDyMvKS5MfQhuznU+fPTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898b03c5d7110b283ded6f86f916787cd6e73a5c309db3c43e3d947b4af2d161","last_reissued_at":"2026-07-05T02:29:39.654447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:39.654447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A strengthening on odd cycles in graphs of given chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Jun Gao, Qingyi Huo","submitted_at":"2020-12-19T08:05:06Z","abstract_excerpt":"Resolving a conjecture of Bollob\\'{a}s and Erd\\H{o}s, Gy\\'{a}rf\\'{a}s proved that every graph $G$ of chromatic number $k+1\\geq 3$ contains cycles of $\\lfloor\\frac{k}{2}\\rfloor$ distinct odd lengths. We strengthen this prominent result by showing that such $G$ contains cycles of $\\lfloor\\frac{k}{2}\\rfloor$ consecutive odd lengths. Along the way, combining extremal and structural tools, we prove a stronger statement that every graph of chromatic number $k+1\\geq 7$ contains $k$ cycles of consecutive lengths, except that some block is $K_{k+1}$. As corollaries, this confirms a conjecture of Verstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.10624","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.10624/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":"2012.10624","created_at":"2026-07-05T02:29:39.654509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.10624v2","created_at":"2026-07-05T02:29:39.654509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.10624","created_at":"2026-07-05T02:29:39.654509+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGFQHROXCEFS","created_at":"2026-07-05T02:29:39.654509+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGFQHROXCEFSQPPN","created_at":"2026-07-05T02:29:39.654509+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGFQHROX","created_at":"2026-07-05T02:29:39.654509+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/RGFQHROXCEFSQPPNN6DPSFTYPT","json":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT.json","graph_json":"https://pith.science/api/pith-number/RGFQHROXCEFSQPPNN6DPSFTYPT/graph.json","events_json":"https://pith.science/api/pith-number/RGFQHROXCEFSQPPNN6DPSFTYPT/events.json","paper":"https://pith.science/paper/RGFQHROX"},"agent_actions":{"view_html":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT","download_json":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT.json","view_paper":"https://pith.science/paper/RGFQHROX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.10624&json=true","fetch_graph":"https://pith.science/api/pith-number/RGFQHROXCEFSQPPNN6DPSFTYPT/graph.json","fetch_events":"https://pith.science/api/pith-number/RGFQHROXCEFSQPPNN6DPSFTYPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/action/storage_attestation","attest_author":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/action/author_attestation","sign_citation":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/action/citation_signature","submit_replication":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/action/replication_record"}},"created_at":"2026-07-05T02:29:39.654509+00:00","updated_at":"2026-07-05T02:29:39.654509+00:00"}