{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6LLDORFODYUTX5WUK7NZB35GFI","short_pith_number":"pith:6LLDORFO","canonical_record":{"source":{"id":"1411.6465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T14:32:58Z","cross_cats_sorted":[],"title_canon_sha256":"f082817f4f80926632abe40cdba12508d4449fe422b6129df97af7cccfe080a5","abstract_canon_sha256":"5a0fb99fe2ddc0d04a4cc3da46d5014498bf21152750c55e921e762f3b2edc2d"},"schema_version":"1.0"},"canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","source":{"kind":"arxiv","id":"1411.6465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6465","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6465v2","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6465","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"6LLDORFODYUT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6LLDORFODYUTX5WU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6LLDORFO","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6LLDORFODYUTX5WUK7NZB35GFI","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T14:32:58Z","cross_cats_sorted":[],"title_canon_sha256":"f082817f4f80926632abe40cdba12508d4449fe422b6129df97af7cccfe080a5","abstract_canon_sha256":"5a0fb99fe2ddc0d04a4cc3da46d5014498bf21152750c55e921e762f3b2edc2d"},"schema_version":"1.0"},"canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.385263Z","signature_b64":"bDsTX1ubyVctKV3x0N6gRC5B/3PfiHEyQG8bCR1fGxGEf/CkttndtsHFi5S6i/m7CaIGY0Vw5QOkPqSA8n/sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","last_reissued_at":"2026-05-18T01:34:35.384498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.384498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6465","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-05-18T01:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbZNnubDCoY8rwuYNrfb2ptexI/rsSuWsY105JPH5QhttnW6Dpi0sAzALJonbUVa8aAE7g0s16E7gdi44ktSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:41.009654Z"},"content_sha256":"aefebc02e75025de3438d8fb918b98fd7687c516ea8ba12ad7a965bb9ebbe009","schema_version":"1.0","event_id":"sha256:aefebc02e75025de3438d8fb918b98fd7687c516ea8ba12ad7a965bb9ebbe009"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6LLDORFODYUTX5WUK7NZB35GFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","submitted_at":"2014-11-24T14:32:58Z","abstract_excerpt":"Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ and no odd hole of length more than $l$ has chromatic number bounded by a function of $k$ and $l$. We prove three weaker statements: (1) Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; (2) For all $l$, every triangle-free graph with sufficiently large chromatic number contains either a 5-hole or an odd hole of length more than $l$; (3) For all $k$, $l$, every graph with no clique of size more than $k$ and sufficiently large chroma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6465","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":""},"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-05-18T01:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfLNfAzrwJQqB5VAe8Nb4CruZF9u54E6MFAMXOU8g/h9OulTPDNSjRCGAt4a+5n08Mg+kVzkVWb5qgu7pgykDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:41.010051Z"},"content_sha256":"213f9c19413c91949f918cb5e9b3e88f3536a5fb945ff7417f4eebb2af0f0eeb","schema_version":"1.0","event_id":"sha256:213f9c19413c91949f918cb5e9b3e88f3536a5fb945ff7417f4eebb2af0f0eeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/bundle.json","state_url":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LLDORFODYUTX5WUK7NZB35GFI/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-05-27T23:18:41Z","links":{"resolver":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI","bundle":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/bundle.json","state":"https://pith.science/pith/6LLDORFODYUTX5WUK7NZB35GFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LLDORFODYUTX5WUK7NZB35GFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6LLDORFODYUTX5WUK7NZB35GFI","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":"5a0fb99fe2ddc0d04a4cc3da46d5014498bf21152750c55e921e762f3b2edc2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T14:32:58Z","title_canon_sha256":"f082817f4f80926632abe40cdba12508d4449fe422b6129df97af7cccfe080a5"},"schema_version":"1.0","source":{"id":"1411.6465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6465","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6465v2","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6465","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"6LLDORFODYUT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6LLDORFODYUTX5WU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6LLDORFO","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:213f9c19413c91949f918cb5e9b3e88f3536a5fb945ff7417f4eebb2af0f0eeb","target":"graph","created_at":"2026-05-18T01:34:35Z","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"},"paper":{"abstract_excerpt":"Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ and no odd hole of length more than $l$ has chromatic number bounded by a function of $k$ and $l$. We prove three weaker statements: (1) Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; (2) For all $l$, every triangle-free graph with sufficiently large chromatic number contains either a 5-hole or an odd hole of length more than $l$; (3) For all $k$, $l$, every graph with no clique of size more than $k$ and sufficiently large chroma","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T14:32:58Z","title":"Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6465","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:aefebc02e75025de3438d8fb918b98fd7687c516ea8ba12ad7a965bb9ebbe009","target":"record","created_at":"2026-05-18T01:34:35Z","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":"5a0fb99fe2ddc0d04a4cc3da46d5014498bf21152750c55e921e762f3b2edc2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T14:32:58Z","title_canon_sha256":"f082817f4f80926632abe40cdba12508d4449fe422b6129df97af7cccfe080a5"},"schema_version":"1.0","source":{"id":"1411.6465","kind":"arxiv","version":2}},"canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2d63744ae1e293bf6d457db90efa62a20d4d6cf0985fec96ccddf02224eda69","first_computed_at":"2026-05-18T01:34:35.384498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:35.384498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bDsTX1ubyVctKV3x0N6gRC5B/3PfiHEyQG8bCR1fGxGEf/CkttndtsHFi5S6i/m7CaIGY0Vw5QOkPqSA8n/sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:35.385263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aefebc02e75025de3438d8fb918b98fd7687c516ea8ba12ad7a965bb9ebbe009","sha256:213f9c19413c91949f918cb5e9b3e88f3536a5fb945ff7417f4eebb2af0f0eeb"],"state_sha256":"0aab6bd8fa2f070e65bce24bfad5bf4018cc57c43b028877774c3afbc2030d14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYU7bULEPyx3uwRIuSWkp6rw5IqKAFH3S7LWzTrfi3gPPNXYV0AhhkZtTL6u0WGM7b3G7VcwLuTxpMwcRTGxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:41.012882Z","bundle_sha256":"fa548174cc094eaeec6aa2d0c79d2b2eee45a0479eb665a79d4d5731d4ff0260"}}