{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SN7ZOWA2EAAI46NG2ARFPZWTFH","short_pith_number":"pith:SN7ZOWA2","canonical_record":{"source":{"id":"1809.00739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-03T23:01:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"09a376920125204298544947a099bf766f67eed5a6114a5dd00b967fd14cba55","abstract_canon_sha256":"d64dffe2033e7d9d46c4e3ceccec3153a256e6e591d2dbe8be9f25ea50c2d3af"},"schema_version":"1.0"},"canonical_sha256":"937f97581a20008e79a6d02257e6d329cdef7399fcd8b94ae7759116579145cb","source":{"kind":"arxiv","id":"1809.00739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00739","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00739v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00739","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"SN7ZOWA2EAAI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SN7ZOWA2EAAI46NG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SN7ZOWA2","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SN7ZOWA2EAAI46NG2ARFPZWTFH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-03T23:01:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"09a376920125204298544947a099bf766f67eed5a6114a5dd00b967fd14cba55","abstract_canon_sha256":"d64dffe2033e7d9d46c4e3ceccec3153a256e6e591d2dbe8be9f25ea50c2d3af"},"schema_version":"1.0"},"canonical_sha256":"937f97581a20008e79a6d02257e6d329cdef7399fcd8b94ae7759116579145cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.610397Z","signature_b64":"VYDM7385fGxNr9hM592g5TkKr/4zzNwpyD6BBhIUaljhohcBgtiO+mefXzBfmpNZRul1blnJZcH6eDN0wpBtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"937f97581a20008e79a6d02257e6d329cdef7399fcd8b94ae7759116579145cb","last_reissued_at":"2026-05-18T00:06:32.609907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.609907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00739","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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcWveTXew9PINUTyhZbnmyY8aPwn42n+FSi8DSK1g00RhOy3CdFSh8aF3kOYTWJq0ACIuilT3zjKoRqwjTRLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:09:04.642833Z"},"content_sha256":"563ca550d45b481d905098c8f1d2c0fe5a54f57eb912a9b5c386e0baf0f7352a","schema_version":"1.0","event_id":"sha256:563ca550d45b481d905098c8f1d2c0fe5a54f57eb912a9b5c386e0baf0f7352a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SN7ZOWA2EAAI46NG2ARFPZWTFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal $\\chi$-Bound for ($P_6$, diamond)-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kathie Cameron, Owen Merkel, Shenwei Huang","submitted_at":"2018-09-03T23:01:01Z","abstract_excerpt":"Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices and $K_t$ be the complete graph on $t$ vertices. The diamond is the graph obtained from $K_4$ by removing an edge. In this paper we show that every ($P_6$, diamond)-free graph $G$ satisfies $\\chi(G)\\le \\omega(G)+3$, where $\\chi(G)$ and $\\omega(G)$ are the chromatic number and clique number of $G$, respectively. Our bound is attained by the complement of the famous 27-vertex Schl\\\"afli graph. Our result unifies previously known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00739","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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1286LGj/vBgVtDe/uR96ALCxdC2gBhFECgERvPKgtf1cvMKuK6e93vKSc8H0vjTfQBza7iPs5qYIoFuo5xwMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:09:04.643546Z"},"content_sha256":"607793a11ceffed80e934e93aa5229d14d82253354893bf4116f9e53c33b5f55","schema_version":"1.0","event_id":"sha256:607793a11ceffed80e934e93aa5229d14d82253354893bf4116f9e53c33b5f55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH/bundle.json","state_url":"https://pith.science/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH/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-25T15:09:04Z","links":{"resolver":"https://pith.science/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH","bundle":"https://pith.science/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH/bundle.json","state":"https://pith.science/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SN7ZOWA2EAAI46NG2ARFPZWTFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SN7ZOWA2EAAI46NG2ARFPZWTFH","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":"d64dffe2033e7d9d46c4e3ceccec3153a256e6e591d2dbe8be9f25ea50c2d3af","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-03T23:01:01Z","title_canon_sha256":"09a376920125204298544947a099bf766f67eed5a6114a5dd00b967fd14cba55"},"schema_version":"1.0","source":{"id":"1809.00739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00739","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00739v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00739","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"SN7ZOWA2EAAI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SN7ZOWA2EAAI46NG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SN7ZOWA2","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:607793a11ceffed80e934e93aa5229d14d82253354893bf4116f9e53c33b5f55","target":"graph","created_at":"2026-05-18T00:06:32Z","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":"Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices and $K_t$ be the complete graph on $t$ vertices. The diamond is the graph obtained from $K_4$ by removing an edge. In this paper we show that every ($P_6$, diamond)-free graph $G$ satisfies $\\chi(G)\\le \\omega(G)+3$, where $\\chi(G)$ and $\\omega(G)$ are the chromatic number and clique number of $G$, respectively. Our bound is attained by the complement of the famous 27-vertex Schl\\\"afli graph. Our result unifies previously known ","authors_text":"Kathie Cameron, Owen Merkel, Shenwei Huang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-03T23:01:01Z","title":"An Optimal $\\chi$-Bound for ($P_6$, diamond)-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00739","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:563ca550d45b481d905098c8f1d2c0fe5a54f57eb912a9b5c386e0baf0f7352a","target":"record","created_at":"2026-05-18T00:06:32Z","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":"d64dffe2033e7d9d46c4e3ceccec3153a256e6e591d2dbe8be9f25ea50c2d3af","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-03T23:01:01Z","title_canon_sha256":"09a376920125204298544947a099bf766f67eed5a6114a5dd00b967fd14cba55"},"schema_version":"1.0","source":{"id":"1809.00739","kind":"arxiv","version":1}},"canonical_sha256":"937f97581a20008e79a6d02257e6d329cdef7399fcd8b94ae7759116579145cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"937f97581a20008e79a6d02257e6d329cdef7399fcd8b94ae7759116579145cb","first_computed_at":"2026-05-18T00:06:32.609907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:32.609907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VYDM7385fGxNr9hM592g5TkKr/4zzNwpyD6BBhIUaljhohcBgtiO+mefXzBfmpNZRul1blnJZcH6eDN0wpBtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:32.610397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:563ca550d45b481d905098c8f1d2c0fe5a54f57eb912a9b5c386e0baf0f7352a","sha256:607793a11ceffed80e934e93aa5229d14d82253354893bf4116f9e53c33b5f55"],"state_sha256":"d156cdcedc946fb1541c17936a1f532ec9d335fe7608dd15bda76a44123392c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFXJ4mu6RVjGa6SRW+JN7Rgj2Ufk4+uqPpjmzxF3kwC4KzsV+6HEduVgxMIdrFYTJDvpEJtjTwh4IbxrRtZ/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:09:04.647442Z","bundle_sha256":"9ccd6e096efa359d2c5e6d324ed02a8a59ac6a39cf60a6788b6bc2aed129ac63"}}