{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VHGRZGOHUTLHCBVQ7WEPY7EJR5","short_pith_number":"pith:VHGRZGOH","canonical_record":{"source":{"id":"2302.01875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-03T17:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"51ae6d98be6f7dd647d3c5c6d37506d53878ddee4e7d9fbbbcdbc8ac2dee2557","abstract_canon_sha256":"fd4279671f47dc8ea38125d6fb70904b04469d6c92e5091e0f80eca87be4974d"},"schema_version":"1.0"},"canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","source":{"kind":"arxiv","id":"2302.01875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.01875","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"2302.01875v2","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.01875","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"VHGRZGOHUTLH","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"pith_short_16","alias_value":"VHGRZGOHUTLHCBVQ","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"pith_short_8","alias_value":"VHGRZGOH","created_at":"2026-07-05T05:48:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VHGRZGOHUTLHCBVQ7WEPY7EJR5","target":"record","payload":{"canonical_record":{"source":{"id":"2302.01875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-03T17:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"51ae6d98be6f7dd647d3c5c6d37506d53878ddee4e7d9fbbbcdbc8ac2dee2557","abstract_canon_sha256":"fd4279671f47dc8ea38125d6fb70904b04469d6c92e5091e0f80eca87be4974d"},"schema_version":"1.0"},"canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:50.346207Z","signature_b64":"wi09yJrSzNNxK66TksEJFM3H6n2+uZmjFbmrIHwyfXuEDYvLyT5IVCX/7orxLjMCFLCyigK4B9thIhN5C1mpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","last_reissued_at":"2026-07-05T05:48:50.345758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:50.345758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.01875","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-05T05:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuZNicJ5Zz7HY95wlLJpQZ+eea9kbZx/pU0evkUwjHE1u9fBOjuwayiWvsks/x6drIX1OKg+s8kGiAY1PbXwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:16:05.838780Z"},"content_sha256":"a8d8581348b38d3f1caa51518d15a196f2b67b34c5134e092bb3bd4a670d55f7","schema_version":"1.0","event_id":"sha256:a8d8581348b38d3f1caa51518d15a196f2b67b34c5134e092bb3bd4a670d55f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VHGRZGOHUTLHCBVQ7WEPY7EJR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with large minimum degree and no small odd cycles are $3$-colourable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domenico Mergoni Cecchelli, Jozef Skokan, Julia B\\\"ottcher, N\\'ora Frankl, Olaf Parczyk","submitted_at":"2023-02-03T17:24:54Z","abstract_excerpt":"Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$-vertex graph $G$ with minimum degree at least $\\frac{1}{2k-1}n$ and without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we prove a stronger result that works with a slightly smaller minimum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.01875","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/2302.01875/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-05T05:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MvPEbUA/WHdfdrE4b4hR1l545IA0sxgzDQ70jgLeXFekD1TYcxEIhfJ3lKV5cyoE0NZCN/Rdd/yc+gbvGfwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:16:05.839295Z"},"content_sha256":"5a22ce15125eeb934aa6814c3c903ec6e9fca571556fc787dc9caca8fe70a655","schema_version":"1.0","event_id":"sha256:5a22ce15125eeb934aa6814c3c903ec6e9fca571556fc787dc9caca8fe70a655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/bundle.json","state_url":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/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-08-05T23:16:05Z","links":{"resolver":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5","bundle":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/bundle.json","state":"https://pith.science/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHGRZGOHUTLHCBVQ7WEPY7EJR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VHGRZGOHUTLHCBVQ7WEPY7EJR5","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":"fd4279671f47dc8ea38125d6fb70904b04469d6c92e5091e0f80eca87be4974d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-03T17:24:54Z","title_canon_sha256":"51ae6d98be6f7dd647d3c5c6d37506d53878ddee4e7d9fbbbcdbc8ac2dee2557"},"schema_version":"1.0","source":{"id":"2302.01875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.01875","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"2302.01875v2","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.01875","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"VHGRZGOHUTLH","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"pith_short_16","alias_value":"VHGRZGOHUTLHCBVQ","created_at":"2026-07-05T05:48:50Z"},{"alias_kind":"pith_short_8","alias_value":"VHGRZGOH","created_at":"2026-07-05T05:48:50Z"}],"graph_snapshots":[{"event_id":"sha256:5a22ce15125eeb934aa6814c3c903ec6e9fca571556fc787dc9caca8fe70a655","target":"graph","created_at":"2026-07-05T05:48:50Z","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/2302.01875/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$-vertex graph $G$ with minimum degree at least $\\frac{1}{2k-1}n$ and without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we prove a stronger result that works with a slightly smaller minimum degree.","authors_text":"Domenico Mergoni Cecchelli, Jozef Skokan, Julia B\\\"ottcher, N\\'ora Frankl, Olaf Parczyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-03T17:24:54Z","title":"Graphs with large minimum degree and no small odd cycles are $3$-colourable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.01875","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:a8d8581348b38d3f1caa51518d15a196f2b67b34c5134e092bb3bd4a670d55f7","target":"record","created_at":"2026-07-05T05:48:50Z","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":"fd4279671f47dc8ea38125d6fb70904b04469d6c92e5091e0f80eca87be4974d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-03T17:24:54Z","title_canon_sha256":"51ae6d98be6f7dd647d3c5c6d37506d53878ddee4e7d9fbbbcdbc8ac2dee2557"},"schema_version":"1.0","source":{"id":"2302.01875","kind":"arxiv","version":2}},"canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9cd1c99c7a4d67106b0fd88fc7c898f6093a2cf168ea031ba47b1f67f26417d","first_computed_at":"2026-07-05T05:48:50.345758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:48:50.345758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wi09yJrSzNNxK66TksEJFM3H6n2+uZmjFbmrIHwyfXuEDYvLyT5IVCX/7orxLjMCFLCyigK4B9thIhN5C1mpBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:48:50.346207Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.01875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8d8581348b38d3f1caa51518d15a196f2b67b34c5134e092bb3bd4a670d55f7","sha256:5a22ce15125eeb934aa6814c3c903ec6e9fca571556fc787dc9caca8fe70a655"],"state_sha256":"d5d7e4756c976e54824e0350d9216816b2f57e5ebf53c5a3ecf1d096b9f54645"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ViBST1wAGl+fGNMPjmUKnwrRoekMG/mSq7iY01mwL6iPJK5sV5A2yAv7uiv7m4lXaRLkEYKuvz+XB9sCc6bpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:16:05.843993Z","bundle_sha256":"2e42a2d7f3ebe7f9cac027a3b2a22adf49fb1b99306aedeeea0281a5b5301734"}}