{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MYWP7UM3QSHJ7CRQ7IXFCJLWDI","short_pith_number":"pith:MYWP7UM3","canonical_record":{"source":{"id":"1803.01051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-02T21:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"3ac5b928430f4181347e5244dfb3e574bed99434286e9cabd7453b3a855cf336","abstract_canon_sha256":"7726cfc2356581dd84da3aae5f472acad0dec465ef4202a3b300d23b411ab290"},"schema_version":"1.0"},"canonical_sha256":"662cffd19b848e9f8a30fa2e5125761a119d619e7cd97f8ed365431d47eb2b10","source":{"kind":"arxiv","id":"1803.01051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01051","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01051v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01051","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"MYWP7UM3QSHJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYWP7UM3QSHJ7CRQ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYWP7UM3","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MYWP7UM3QSHJ7CRQ7IXFCJLWDI","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-02T21:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"3ac5b928430f4181347e5244dfb3e574bed99434286e9cabd7453b3a855cf336","abstract_canon_sha256":"7726cfc2356581dd84da3aae5f472acad0dec465ef4202a3b300d23b411ab290"},"schema_version":"1.0"},"canonical_sha256":"662cffd19b848e9f8a30fa2e5125761a119d619e7cd97f8ed365431d47eb2b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:01.886733Z","signature_b64":"B5l0z6xOzFs/bu0jTXu1YRr/CFL0g5RdUuqCn7i0lH7ifIunmvqdeazfIPfKC+jaa0cMaN+lYYTl/MUVTbpvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"662cffd19b848e9f8a30fa2e5125761a119d619e7cd97f8ed365431d47eb2b10","last_reissued_at":"2026-05-18T00:22:01.886205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:01.886205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01051","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-05-18T00:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RQGjXX+suDGvqE1oJdeJAKdVq/2jK689DwTyVnHlx2Kt1rxhFc/QA5yQRT1AZwBTlJ/sZuUUhX+i3HeI9mlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:16:28.369255Z"},"content_sha256":"1a42ce9b947a9dede259a8e93cd1d767ca6cedeb3c330b288fb1e304b64939da","schema_version":"1.0","event_id":"sha256:1a42ce9b947a9dede259a8e93cd1d767ca6cedeb3c330b288fb1e304b64939da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MYWP7UM3QSHJ7CRQ7IXFCJLWDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding $\\chi$ by a fraction of $\\Delta$ for graphs without large cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Marthe Bonamy, Peter Nelson, Tom Kelly","submitted_at":"2018-03-02T21:44:00Z","abstract_excerpt":"The greedy coloring algorithm shows that a graph of maximum degree at most $\\Delta$ has chromatic number at most $\\Delta + 1$, and this is tight for cliques. Much attention has been devoted to improving this \"greedy bound\" for graphs without large cliques. Brooks famously proved that this bound can be improved by one if $\\Delta \\geq 3$ and the graph contains no clique of size $\\Delta + 1$. Reed's Conjecture states that the \"greedy bound\" can be improved by $k$ if the graph contains no clique of size $\\Delta + 1 - 2k$. Johansson proved that the \"greedy bound\" can be improved by a factor of $\\Om"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01051","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":""},"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-18T00:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuqYl3UzI1TYcas7KIpfq8/0kKkL9VWy80F2YTWMPFa5djJHgJR/e/KGdCJ8zW8Oi8+8DI7xVBZmQJv+g5jFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:16:28.369613Z"},"content_sha256":"92859969cf52e5ebcfb0b7a43739f0901018b72e230aa4296affe1bbf215e3af","schema_version":"1.0","event_id":"sha256:92859969cf52e5ebcfb0b7a43739f0901018b72e230aa4296affe1bbf215e3af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI/bundle.json","state_url":"https://pith.science/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI/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-06-28T11:16:28Z","links":{"resolver":"https://pith.science/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI","bundle":"https://pith.science/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI/bundle.json","state":"https://pith.science/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYWP7UM3QSHJ7CRQ7IXFCJLWDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MYWP7UM3QSHJ7CRQ7IXFCJLWDI","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":"7726cfc2356581dd84da3aae5f472acad0dec465ef4202a3b300d23b411ab290","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-02T21:44:00Z","title_canon_sha256":"3ac5b928430f4181347e5244dfb3e574bed99434286e9cabd7453b3a855cf336"},"schema_version":"1.0","source":{"id":"1803.01051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01051","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01051v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01051","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"MYWP7UM3QSHJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYWP7UM3QSHJ7CRQ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYWP7UM3","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:92859969cf52e5ebcfb0b7a43739f0901018b72e230aa4296affe1bbf215e3af","target":"graph","created_at":"2026-05-18T00:22:01Z","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":"The greedy coloring algorithm shows that a graph of maximum degree at most $\\Delta$ has chromatic number at most $\\Delta + 1$, and this is tight for cliques. Much attention has been devoted to improving this \"greedy bound\" for graphs without large cliques. Brooks famously proved that this bound can be improved by one if $\\Delta \\geq 3$ and the graph contains no clique of size $\\Delta + 1$. Reed's Conjecture states that the \"greedy bound\" can be improved by $k$ if the graph contains no clique of size $\\Delta + 1 - 2k$. Johansson proved that the \"greedy bound\" can be improved by a factor of $\\Om","authors_text":"Luke Postle, Marthe Bonamy, Peter Nelson, Tom Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-02T21:44:00Z","title":"Bounding $\\chi$ by a fraction of $\\Delta$ for graphs without large cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01051","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:1a42ce9b947a9dede259a8e93cd1d767ca6cedeb3c330b288fb1e304b64939da","target":"record","created_at":"2026-05-18T00:22:01Z","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":"7726cfc2356581dd84da3aae5f472acad0dec465ef4202a3b300d23b411ab290","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-02T21:44:00Z","title_canon_sha256":"3ac5b928430f4181347e5244dfb3e574bed99434286e9cabd7453b3a855cf336"},"schema_version":"1.0","source":{"id":"1803.01051","kind":"arxiv","version":1}},"canonical_sha256":"662cffd19b848e9f8a30fa2e5125761a119d619e7cd97f8ed365431d47eb2b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"662cffd19b848e9f8a30fa2e5125761a119d619e7cd97f8ed365431d47eb2b10","first_computed_at":"2026-05-18T00:22:01.886205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:01.886205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5l0z6xOzFs/bu0jTXu1YRr/CFL0g5RdUuqCn7i0lH7ifIunmvqdeazfIPfKC+jaa0cMaN+lYYTl/MUVTbpvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:01.886733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a42ce9b947a9dede259a8e93cd1d767ca6cedeb3c330b288fb1e304b64939da","sha256:92859969cf52e5ebcfb0b7a43739f0901018b72e230aa4296affe1bbf215e3af"],"state_sha256":"d2afba9c3e1f719c6d49cddab986e5f364a6e62e15d689f94341aa7b7a2dd752"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1cvKNSNX2bxC/dDo+FRmPaAh+8WioHpK/DXCjRiSO5+2/n0DHZhIa/mylbeJvmM47Wbd94dTNWIu0bNkzA6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:16:28.371515Z","bundle_sha256":"788a16b8555a4213c5a9da9cdc90d389e73817ad9f7c0db9bfec73323ebda90c"}}