{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ETJ7SWILJPBZSDW2XANQH2BQ7A","short_pith_number":"pith:ETJ7SWIL","canonical_record":{"source":{"id":"2409.03407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-05T10:45:07Z","cross_cats_sorted":[],"title_canon_sha256":"cf3307bb944e50e1427998730cb7cb0ff9bb68329b7c3afeeb633febfb39085b","abstract_canon_sha256":"878237b25f1e73a1e3f10ed59310b5a3ded94b35e419a5d2c74b6fa3e5a9ea3c"},"schema_version":"1.0"},"canonical_sha256":"24d3f9590b4bc3990edab81b03e830f834914def155c1784094b47fad6c6c6fa","source":{"kind":"arxiv","id":"2409.03407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.03407","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"2409.03407v2","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.03407","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"ETJ7SWILJPBZ","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETJ7SWILJPBZSDW2","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETJ7SWIL","created_at":"2026-07-05T09:54:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ETJ7SWILJPBZSDW2XANQH2BQ7A","target":"record","payload":{"canonical_record":{"source":{"id":"2409.03407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-05T10:45:07Z","cross_cats_sorted":[],"title_canon_sha256":"cf3307bb944e50e1427998730cb7cb0ff9bb68329b7c3afeeb633febfb39085b","abstract_canon_sha256":"878237b25f1e73a1e3f10ed59310b5a3ded94b35e419a5d2c74b6fa3e5a9ea3c"},"schema_version":"1.0"},"canonical_sha256":"24d3f9590b4bc3990edab81b03e830f834914def155c1784094b47fad6c6c6fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:28.494912Z","signature_b64":"UdqhTAtOgZSpgsl0u/LlNLspipN7SJEaVlVwLWUE9jmHaLCTJgn3+RrJu+owDH2LmPdIJK+81Jz1jJhW/+beCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d3f9590b4bc3990edab81b03e830f834914def155c1784094b47fad6c6c6fa","last_reissued_at":"2026-07-05T09:54:28.494435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:28.494435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.03407","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-05T09:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSaj0nEUlCE8rLBP0rLdjLazxesKWcBPyiod6ilN5MZxe0+0qSK0mNkR9cFRyvd3A7rw7bfrleiUdUIVyL6VBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:05:19.999779Z"},"content_sha256":"7f95bf5c8effb9865209820ddd77b46539447e616f244b83b101f75e5935e7af","schema_version":"1.0","event_id":"sha256:7f95bf5c8effb9865209820ddd77b46539447e616f244b83b101f75e5935e7af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ETJ7SWILJPBZSDW2XANQH2BQ7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chromatic profiles of odd cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoli Yuan, Yuejian Peng, Zilong Yan","submitted_at":"2024-09-05T10:45:07Z","abstract_excerpt":"Erd\\H{o}s and Simonovits asked the following question: For an integer $c\\geq 2$ and a family of non-bipartite graphs $\\mathcal{F}$, what is the infimum of $\\alpha$ such that any $\\mathcal{F}$-free $n$-vertex graph with $n$ large enough and minimum degree at least $\\alpha n$ has chromatic number at most $c$? Denote the infimum as $\\delta_{\\chi}(\\mathcal{F}, c)$. A fundamental result of Erd\\H{o}s, Stone and Simonovits implies that if $3\\le r+1=\\chi(\\mathcal{F})=\\min\\{\\chi (F): F\\in \\mathcal{F}\\}$, then for any $c\\le r-1$, $\\delta_{\\chi}(\\mathcal{F}, c)=1-{1 \\over r}$. So the remaining challenge "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.03407","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/2409.03407/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-05T09:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0UhAI4PzZidRJIXvF8VSpTRIcUgs+k0wbzM+9FQZMGtUxQf3K4HtoJlPYfcwypTIJxSdwzzbkIwnkDOzFIvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:05:20.001323Z"},"content_sha256":"07af984aa7919b2b964f8b079aa89999cb029d5ac030c7da4a9745c4d1df832b","schema_version":"1.0","event_id":"sha256:07af984aa7919b2b964f8b079aa89999cb029d5ac030c7da4a9745c4d1df832b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A/bundle.json","state_url":"https://pith.science/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A/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-09T19:05:20Z","links":{"resolver":"https://pith.science/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A","bundle":"https://pith.science/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A/bundle.json","state":"https://pith.science/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETJ7SWILJPBZSDW2XANQH2BQ7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ETJ7SWILJPBZSDW2XANQH2BQ7A","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":"878237b25f1e73a1e3f10ed59310b5a3ded94b35e419a5d2c74b6fa3e5a9ea3c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-05T10:45:07Z","title_canon_sha256":"cf3307bb944e50e1427998730cb7cb0ff9bb68329b7c3afeeb633febfb39085b"},"schema_version":"1.0","source":{"id":"2409.03407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.03407","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"2409.03407v2","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.03407","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"ETJ7SWILJPBZ","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETJ7SWILJPBZSDW2","created_at":"2026-07-05T09:54:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETJ7SWIL","created_at":"2026-07-05T09:54:28Z"}],"graph_snapshots":[{"event_id":"sha256:07af984aa7919b2b964f8b079aa89999cb029d5ac030c7da4a9745c4d1df832b","target":"graph","created_at":"2026-07-05T09:54:28Z","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/2409.03407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Erd\\H{o}s and Simonovits asked the following question: For an integer $c\\geq 2$ and a family of non-bipartite graphs $\\mathcal{F}$, what is the infimum of $\\alpha$ such that any $\\mathcal{F}$-free $n$-vertex graph with $n$ large enough and minimum degree at least $\\alpha n$ has chromatic number at most $c$? Denote the infimum as $\\delta_{\\chi}(\\mathcal{F}, c)$. A fundamental result of Erd\\H{o}s, Stone and Simonovits implies that if $3\\le r+1=\\chi(\\mathcal{F})=\\min\\{\\chi (F): F\\in \\mathcal{F}\\}$, then for any $c\\le r-1$, $\\delta_{\\chi}(\\mathcal{F}, c)=1-{1 \\over r}$. So the remaining challenge ","authors_text":"Xiaoli Yuan, Yuejian Peng, Zilong Yan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-05T10:45:07Z","title":"Chromatic profiles of odd cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.03407","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:7f95bf5c8effb9865209820ddd77b46539447e616f244b83b101f75e5935e7af","target":"record","created_at":"2026-07-05T09:54:28Z","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":"878237b25f1e73a1e3f10ed59310b5a3ded94b35e419a5d2c74b6fa3e5a9ea3c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-05T10:45:07Z","title_canon_sha256":"cf3307bb944e50e1427998730cb7cb0ff9bb68329b7c3afeeb633febfb39085b"},"schema_version":"1.0","source":{"id":"2409.03407","kind":"arxiv","version":2}},"canonical_sha256":"24d3f9590b4bc3990edab81b03e830f834914def155c1784094b47fad6c6c6fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24d3f9590b4bc3990edab81b03e830f834914def155c1784094b47fad6c6c6fa","first_computed_at":"2026-07-05T09:54:28.494435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:28.494435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UdqhTAtOgZSpgsl0u/LlNLspipN7SJEaVlVwLWUE9jmHaLCTJgn3+RrJu+owDH2LmPdIJK+81Jz1jJhW/+beCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:28.494912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.03407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f95bf5c8effb9865209820ddd77b46539447e616f244b83b101f75e5935e7af","sha256:07af984aa7919b2b964f8b079aa89999cb029d5ac030c7da4a9745c4d1df832b"],"state_sha256":"655db505eb6ac6ed1ad4ef91aabafee640908c827d57d81ece89eaf297bdebca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVdt00txdvAotNtoq5d3tJCoQjG5vfzIiwtcqc12kIB4bJ3PWgFxnmmNDn9sg4eSAaYVxOsSeEbG0OM9X8kOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:05:20.005967Z","bundle_sha256":"551c26d10c865fdd1c2a91863911b181347b9c0ae55e69287d9813a943977bbf"}}