{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SHEHLBO4277ICWSLSV37E3BP6L","short_pith_number":"pith:SHEHLBO4","canonical_record":{"source":{"id":"2410.02437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T12:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"571decb42fdff79224fcf579069ff9a7ec95fb25ec86c7ace0382f92df1672f6","abstract_canon_sha256":"13b192455cc0ad0b7c64183daece0af1872d787081a72c65b4133ae5b744da0f"},"schema_version":"1.0"},"canonical_sha256":"91c87585dcd7fe815a4b9577f26c2ff2cacb8b6e8f3351cf9230bec0c50a55f9","source":{"kind":"arxiv","id":"2410.02437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02437","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02437v1","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02437","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"SHEHLBO4277I","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"pith_short_16","alias_value":"SHEHLBO4277ICWSL","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"pith_short_8","alias_value":"SHEHLBO4","created_at":"2026-07-05T09:15:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SHEHLBO4277ICWSLSV37E3BP6L","target":"record","payload":{"canonical_record":{"source":{"id":"2410.02437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T12:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"571decb42fdff79224fcf579069ff9a7ec95fb25ec86c7ace0382f92df1672f6","abstract_canon_sha256":"13b192455cc0ad0b7c64183daece0af1872d787081a72c65b4133ae5b744da0f"},"schema_version":"1.0"},"canonical_sha256":"91c87585dcd7fe815a4b9577f26c2ff2cacb8b6e8f3351cf9230bec0c50a55f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:20.977913Z","signature_b64":"MZW7hZLr1WhJMNL44zoUAyIo3PhZV1HfIBSqPgWglYLXuCQSCEyckNHFMnsvWKotim7sRMpJpPoaH527/kQzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91c87585dcd7fe815a4b9577f26c2ff2cacb8b6e8f3351cf9230bec0c50a55f9","last_reissued_at":"2026-07-05T09:15:20.977489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:20.977489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.02437","source_version":1,"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:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghOQbv9qeTFgIQRylM/Crl2xO2Bov4P0e840lspXeRIty4daQfUXUeFwUtkPgowesZ6uwmx+/RWIq6OXPwwYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:31:12.615982Z"},"content_sha256":"93b7750fe9a384db1e174f89cb92de3da25aa9108243781b4d03984661e41f01","schema_version":"1.0","event_id":"sha256:93b7750fe9a384db1e174f89cb92de3da25aa9108243781b4d03984661e41f01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SHEHLBO4277ICWSLSV37E3BP6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chromatic number and regular subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnab\\'as Janzer, Benny Sudakov, Raphael Steiner","submitted_at":"2024-10-03T12:34:15Z","abstract_excerpt":"In 1992, Erd\\H{o}s and Hajnal posed the following natural problem: Does there exist, for every $r\\in \\mathbb{N}$, an integer $F(r)$ such that every graph with chromatic number at least $F(r)$ contains $r$ edge-disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist $n$-vertex graphs with fractional chromatic number $\\Omega\\left(\\frac{\\log \\log n}{\\log \\log \\log n}\\right)$ that do not even contain a $4$-regular subgraph. This implies that no such number $F(r)$ exists for $r\\ge 2$. We show that assuming a conjecture of Harris, the bound on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02437","kind":"arxiv","version":1},"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/2410.02437/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:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QsrIlWdu65NeE9Jyj1JSanvokNwm1M3AQxSCP+g3AMThnDssk6fZAzyoaiVENJFE0LE4a0+fLuqmyvouAEdHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:31:12.616511Z"},"content_sha256":"c0b1cf6c8bfa42d54da579a0e615f5285544403d6c272b73c92bbb5ddfd172e2","schema_version":"1.0","event_id":"sha256:c0b1cf6c8bfa42d54da579a0e615f5285544403d6c272b73c92bbb5ddfd172e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHEHLBO4277ICWSLSV37E3BP6L/bundle.json","state_url":"https://pith.science/pith/SHEHLBO4277ICWSLSV37E3BP6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHEHLBO4277ICWSLSV37E3BP6L/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-13T02:31:12Z","links":{"resolver":"https://pith.science/pith/SHEHLBO4277ICWSLSV37E3BP6L","bundle":"https://pith.science/pith/SHEHLBO4277ICWSLSV37E3BP6L/bundle.json","state":"https://pith.science/pith/SHEHLBO4277ICWSLSV37E3BP6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHEHLBO4277ICWSLSV37E3BP6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SHEHLBO4277ICWSLSV37E3BP6L","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":"13b192455cc0ad0b7c64183daece0af1872d787081a72c65b4133ae5b744da0f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T12:34:15Z","title_canon_sha256":"571decb42fdff79224fcf579069ff9a7ec95fb25ec86c7ace0382f92df1672f6"},"schema_version":"1.0","source":{"id":"2410.02437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02437","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02437v1","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02437","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"SHEHLBO4277I","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"pith_short_16","alias_value":"SHEHLBO4277ICWSL","created_at":"2026-07-05T09:15:20Z"},{"alias_kind":"pith_short_8","alias_value":"SHEHLBO4","created_at":"2026-07-05T09:15:20Z"}],"graph_snapshots":[{"event_id":"sha256:c0b1cf6c8bfa42d54da579a0e615f5285544403d6c272b73c92bbb5ddfd172e2","target":"graph","created_at":"2026-07-05T09:15:20Z","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/2410.02437/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1992, Erd\\H{o}s and Hajnal posed the following natural problem: Does there exist, for every $r\\in \\mathbb{N}$, an integer $F(r)$ such that every graph with chromatic number at least $F(r)$ contains $r$ edge-disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist $n$-vertex graphs with fractional chromatic number $\\Omega\\left(\\frac{\\log \\log n}{\\log \\log \\log n}\\right)$ that do not even contain a $4$-regular subgraph. This implies that no such number $F(r)$ exists for $r\\ge 2$. We show that assuming a conjecture of Harris, the bound on the ","authors_text":"Barnab\\'as Janzer, Benny Sudakov, Raphael Steiner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T12:34:15Z","title":"Chromatic number and regular subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02437","kind":"arxiv","version":1},"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:93b7750fe9a384db1e174f89cb92de3da25aa9108243781b4d03984661e41f01","target":"record","created_at":"2026-07-05T09:15:20Z","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":"13b192455cc0ad0b7c64183daece0af1872d787081a72c65b4133ae5b744da0f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T12:34:15Z","title_canon_sha256":"571decb42fdff79224fcf579069ff9a7ec95fb25ec86c7ace0382f92df1672f6"},"schema_version":"1.0","source":{"id":"2410.02437","kind":"arxiv","version":1}},"canonical_sha256":"91c87585dcd7fe815a4b9577f26c2ff2cacb8b6e8f3351cf9230bec0c50a55f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91c87585dcd7fe815a4b9577f26c2ff2cacb8b6e8f3351cf9230bec0c50a55f9","first_computed_at":"2026-07-05T09:15:20.977489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:20.977489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZW7hZLr1WhJMNL44zoUAyIo3PhZV1HfIBSqPgWglYLXuCQSCEyckNHFMnsvWKotim7sRMpJpPoaH527/kQzDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:20.977913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.02437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93b7750fe9a384db1e174f89cb92de3da25aa9108243781b4d03984661e41f01","sha256:c0b1cf6c8bfa42d54da579a0e615f5285544403d6c272b73c92bbb5ddfd172e2"],"state_sha256":"5a2bbccd66e4b65718e4c8da245fee575f234eb8f678a5902653140e97f2c138"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xe+MqPAXOe65W3Kl2RfgnxNUnKG/+lPptMtMdMwbQo0qObheCRK0f1hkfGgzVHLI3pRLmsdDpz1X/UwsKys6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:31:12.621241Z","bundle_sha256":"b93f6f60ba36d256de2f3bbef6cde373b82148b16f39556f8ffb8d6b63687bcd"}}