{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SSKF425R52Y44G7MKCBRIIS5VV","short_pith_number":"pith:SSKF425R","schema_version":"1.0","canonical_sha256":"94945e6bb1eeb1ce1bec508314225dad7fec8f6b5628b0631f16fe01e360682d","source":{"kind":"arxiv","id":"2606.09415","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.09415","created_at":"2026-06-09T02:08:46.995925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.09415v1","created_at":"2026-06-09T02:08:46.995925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09415","created_at":"2026-06-09T02:08:46.995925+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSKF425R52Y4","created_at":"2026-06-09T02:08:46.995925+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSKF425R52Y44G7M","created_at":"2026-06-09T02:08:46.995925+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSKF425R","created_at":"2026-06-09T02:08:46.995925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV","json":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV.json","graph_json":"https://pith.science/api/pith-number/SSKF425R52Y44G7MKCBRIIS5VV/graph.json","events_json":"https://pith.science/api/pith-number/SSKF425R52Y44G7MKCBRIIS5VV/events.json","paper":"https://pith.science/paper/SSKF425R"},"agent_actions":{"view_html":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV","download_json":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV.json","view_paper":"https://pith.science/paper/SSKF425R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.09415&json=true","fetch_graph":"https://pith.science/api/pith-number/SSKF425R52Y44G7MKCBRIIS5VV/graph.json","fetch_events":"https://pith.science/api/pith-number/SSKF425R52Y44G7MKCBRIIS5VV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/action/storage_attestation","attest_author":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/action/author_attestation","sign_citation":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/action/citation_signature","submit_replication":"https://pith.science/pith/SSKF425R52Y44G7MKCBRIIS5VV/action/replication_record"}},"created_at":"2026-06-09T02:08:46.995925+00:00","updated_at":"2026-06-09T02:08:46.995925+00:00"}