{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RGFQHROXCEFSQPPNN6DPSFTYPT","short_pith_number":"pith:RGFQHROX","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"},"canonical_sha256":"898b03c5d7110b283ded6f86f916787cd6e73a5c309db3c43e3d947b4af2d161","source":{"kind":"arxiv","id":"2012.10624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.10624","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"2012.10624v2","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.10624","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"RGFQHROXCEFS","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RGFQHROXCEFSQPPN","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RGFQHROX","created_at":"2026-07-05T02:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RGFQHROXCEFSQPPNN6DPSFTYPT","target":"record","payload":{"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"},"canonical_sha256":"898b03c5d7110b283ded6f86f916787cd6e73a5c309db3c43e3d947b4af2d161","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"},"source_kind":"arxiv","source_id":"2012.10624","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGKtxbQ7XgOekuc7/IpwwWIMECWwkSn96QecJtZ21l/I7PTtXrldG0Rs5IzaGUnoYsTn9cEyyOkWjswSIp46Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:19:01.959824Z"},"content_sha256":"7560f7d254a6961179e406963d96bebdec721ec0d64fa75b03db1bda30e3d03b","schema_version":"1.0","event_id":"sha256:7560f7d254a6961179e406963d96bebdec721ec0d64fa75b03db1bda30e3d03b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RGFQHROXCEFSQPPNN6DPSFTYPT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiCyIxiQrzfi+fY6c3Job1pMUPQFeFKQ1uk3uFcYou0g12PB6PmNpYLUWkQtwEOnpHSc02XirzZYKHFlgimNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:19:01.960205Z"},"content_sha256":"5817de764a623b05f300da638cb26d9aad2120e70b945d6b7885da7381732e4b","schema_version":"1.0","event_id":"sha256:5817de764a623b05f300da638cb26d9aad2120e70b945d6b7885da7381732e4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/bundle.json","state_url":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-09T02:19:01Z","links":{"resolver":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT","bundle":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/bundle.json","state":"https://pith.science/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGFQHROXCEFSQPPNN6DPSFTYPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RGFQHROXCEFSQPPNN6DPSFTYPT","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":"46c0273f46eb81627141e2642c612aaf1571226042f045c7f47967dbf44a0925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-19T08:05:06Z","title_canon_sha256":"a8d4757f41e0c496e2bafcc080658cfa1772be8d9801aef4492cac3a31b28638"},"schema_version":"1.0","source":{"id":"2012.10624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.10624","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"2012.10624v2","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.10624","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"RGFQHROXCEFS","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RGFQHROXCEFSQPPN","created_at":"2026-07-05T02:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RGFQHROX","created_at":"2026-07-05T02:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5817de764a623b05f300da638cb26d9aad2120e70b945d6b7885da7381732e4b","target":"graph","created_at":"2026-07-05T02:29:39Z","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/2012.10624/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jie Ma, Jun Gao, Qingyi Huo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-19T08:05:06Z","title":"A strengthening on odd cycles in graphs of given chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.10624","kind":"arxiv","version":2},"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:7560f7d254a6961179e406963d96bebdec721ec0d64fa75b03db1bda30e3d03b","target":"record","created_at":"2026-07-05T02:29:39Z","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":"46c0273f46eb81627141e2642c612aaf1571226042f045c7f47967dbf44a0925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-19T08:05:06Z","title_canon_sha256":"a8d4757f41e0c496e2bafcc080658cfa1772be8d9801aef4492cac3a31b28638"},"schema_version":"1.0","source":{"id":"2012.10624","kind":"arxiv","version":2}},"canonical_sha256":"898b03c5d7110b283ded6f86f916787cd6e73a5c309db3c43e3d947b4af2d161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"898b03c5d7110b283ded6f86f916787cd6e73a5c309db3c43e3d947b4af2d161","first_computed_at":"2026-07-05T02:29:39.654447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:29:39.654447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+wLt5Oh/PP9++tpYATvyjqOoFp7tzT4Kx0FPMRiR/hNEHUDfr7H769E5LWV3ZYrfIDyMvKS5MfQhuznU+fPTDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:29:39.654937Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.10624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7560f7d254a6961179e406963d96bebdec721ec0d64fa75b03db1bda30e3d03b","sha256:5817de764a623b05f300da638cb26d9aad2120e70b945d6b7885da7381732e4b"],"state_sha256":"5c62f47f788de8e6166d101a1d2dc30bf69c409f05fb3aa7f73a12101e220869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3PMGPHGaGf5H8PbXqm1RoGdgaIVsawEsIP0+wbqVf1fRiL8nwRrvltlpOqdqhBVhRfMsjxL1sDFGlqTqdQVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T02:19:01.962431Z","bundle_sha256":"e28ca6e38709c70107d9d95bfbd29afa6adaa0c74bded066e5eec85d978bb4eb"}}