{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SSKF425R52Y44G7MKCBRIIS5VV","short_pith_number":"pith:SSKF425R","canonical_record":{"source":{"id":"2606.09415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T12:29:23Z","cross_cats_sorted":[],"title_canon_sha256":"6a25b0186fa1110b6c2b4eb4ab430b1814f28dcdc3e911493bb8ecabe2e6bb7c","abstract_canon_sha256":"3be84c219763d19432e4a64e110727ec82fc6d155d4a63cd21a2f23c918033d3"},"schema_version":"1.0"},"canonical_sha256":"94945e6bb1eeb1ce1bec508314225dad7fec8f6b5628b0631f16fe01e360682d","source":{"kind":"arxiv","id":"2606.09415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09415","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09415v1","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09415","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"SSKF425R52Y4","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"SSKF425R52Y44G7M","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"SSKF425R","created_at":"2026-06-09T02:08:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SSKF425R52Y44G7MKCBRIIS5VV","target":"record","payload":{"canonical_record":{"source":{"id":"2606.09415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T12:29:23Z","cross_cats_sorted":[],"title_canon_sha256":"6a25b0186fa1110b6c2b4eb4ab430b1814f28dcdc3e911493bb8ecabe2e6bb7c","abstract_canon_sha256":"3be84c219763d19432e4a64e110727ec82fc6d155d4a63cd21a2f23c918033d3"},"schema_version":"1.0"},"canonical_sha256":"94945e6bb1eeb1ce1bec508314225dad7fec8f6b5628b0631f16fe01e360682d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:46.996724Z","signature_b64":"5/RvTjvySbpcRhPbaFbTml1RnL+kdsf4W8Pd85rA91fdBmercQxi6mT5gtNktWuRKsk+tG305MiAmmmjvF1nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94945e6bb1eeb1ce1bec508314225dad7fec8f6b5628b0631f16fe01e360682d","last_reissued_at":"2026-06-09T02:08:46.995761Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:46.995761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.09415","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-06-09T02:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJ0iuznYyDLEEjWgo+eP5FcrlUBRRjv/eoJnSIE6zFerAgToMiE531RWCGycCQc0b2IHnTgeQSSvzkD8sUgoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:34:47.226158Z"},"content_sha256":"9b803ed178f0a64158ddf6586800332b2f83d5e106b6611f292349169436263a","schema_version":"1.0","event_id":"sha256:9b803ed178f0a64158ddf6586800332b2f83d5e106b6611f292349169436263a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SSKF425R52Y44G7MKCBRIIS5VV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the chromatic number of the union of comparability graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Davies, Linda Cook, Maria Chudnovsky, Sang-il Oum, Seokbeom Kim","submitted_at":"2026-06-08T12:29:23Z","abstract_excerpt":"Resolving in a strong sense an old problem of Gy\\'arf\\'as from the 1980s on the union of two perfect graphs, we prove that for every pair of positive integers $d$ and $k$, there is a graph $G$ with clique number $k$ and chromatic number $k^d$ that is the union of $d$ comparability graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09415","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/2606.09415/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-06-09T02:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFXQL9lAE3Ejd4LFmesWNilYiofWCsf+0X+VSAJgo9KLrA5XKNfYOUOYk+XZANzS0ssAqfrH4nsP9LFR8lmfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:34:47.226557Z"},"content_sha256":"ae2a2bdbec6ba5003894fd75626e30aaaa83746ded58739db2c63251059d44a3","schema_version":"1.0","event_id":"sha256:ae2a2bdbec6ba5003894fd75626e30aaaa83746ded58739db2c63251059d44a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/bundle.json","state_url":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSKF425R52Y44G7MKCBRIIS5VV/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-09T14:34:47Z","links":{"resolver":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV","bundle":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/bundle.json","state":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSKF425R52Y44G7MKCBRIIS5VV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SSKF425R52Y44G7MKCBRIIS5VV","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":"3be84c219763d19432e4a64e110727ec82fc6d155d4a63cd21a2f23c918033d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T12:29:23Z","title_canon_sha256":"6a25b0186fa1110b6c2b4eb4ab430b1814f28dcdc3e911493bb8ecabe2e6bb7c"},"schema_version":"1.0","source":{"id":"2606.09415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09415","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09415v1","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09415","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"SSKF425R52Y4","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"SSKF425R52Y44G7M","created_at":"2026-06-09T02:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"SSKF425R","created_at":"2026-06-09T02:08:46Z"}],"graph_snapshots":[{"event_id":"sha256:ae2a2bdbec6ba5003894fd75626e30aaaa83746ded58739db2c63251059d44a3","target":"graph","created_at":"2026-06-09T02:08:46Z","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/2606.09415/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Resolving in a strong sense an old problem of Gy\\'arf\\'as from the 1980s on the union of two perfect graphs, we prove that for every pair of positive integers $d$ and $k$, there is a graph $G$ with clique number $k$ and chromatic number $k^d$ that is the union of $d$ comparability graphs.","authors_text":"James Davies, Linda Cook, Maria Chudnovsky, Sang-il Oum, Seokbeom Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T12:29:23Z","title":"On the chromatic number of the union of comparability graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09415","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:9b803ed178f0a64158ddf6586800332b2f83d5e106b6611f292349169436263a","target":"record","created_at":"2026-06-09T02:08:46Z","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":"3be84c219763d19432e4a64e110727ec82fc6d155d4a63cd21a2f23c918033d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T12:29:23Z","title_canon_sha256":"6a25b0186fa1110b6c2b4eb4ab430b1814f28dcdc3e911493bb8ecabe2e6bb7c"},"schema_version":"1.0","source":{"id":"2606.09415","kind":"arxiv","version":1}},"canonical_sha256":"94945e6bb1eeb1ce1bec508314225dad7fec8f6b5628b0631f16fe01e360682d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94945e6bb1eeb1ce1bec508314225dad7fec8f6b5628b0631f16fe01e360682d","first_computed_at":"2026-06-09T02:08:46.995761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:46.995761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/RvTjvySbpcRhPbaFbTml1RnL+kdsf4W8Pd85rA91fdBmercQxi6mT5gtNktWuRKsk+tG305MiAmmmjvF1nDA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:46.996724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b803ed178f0a64158ddf6586800332b2f83d5e106b6611f292349169436263a","sha256:ae2a2bdbec6ba5003894fd75626e30aaaa83746ded58739db2c63251059d44a3"],"state_sha256":"469c0d515ce66a80edecab3aaf169d3838d7d73af8445617f4966765d9b3f950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fhVRXOecOnCYr8xuGzF6A289seR1gnQAI3LJHd924xhDBCrsKUmkbW8LiQ5leBsDcASyyAIt+aexuSvtr3b5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:34:47.228624Z","bundle_sha256":"1dc4e85edd224ec696fca61356bf3d06eccdb5549c49fe2ab4d2c1107f984c36"}}