{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZTRXQGV2N3WUHFHVMSP4AIFQTI","short_pith_number":"pith:ZTRXQGV2","schema_version":"1.0","canonical_sha256":"cce3781aba6eed4394f5649fc020b09a2c682248c68896beb5bceddce658ec85","source":{"kind":"arxiv","id":"1407.5128","version":2},"attestation_state":"computed","paper":{"title":"A Sane Proof that COLk \\le COL3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"William Gasarch","submitted_at":"2014-07-18T22:33:30Z","abstract_excerpt":"Let COLk be the set of all k-colorable graphs. It is easy to show that if a<b then COLa \\le COLb (poly time reduction). Using the Cook-Levin theorem it is easy to show that if 3 \\le a< b then COLb \\le COLa. However this proof is insane in that it translates a graph to a formula and then the formula to a graph. We give a simple proof that COLk \\le COL3."},"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":"1407.5128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-18T22:33:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1ebeb402e9948c97cd46451fe5c50a086c3612a5da5b37c5008ca36e6e02f77f","abstract_canon_sha256":"342f8cf1f61f619c85e85fef48a7e6edfe18650717b3395fd60752a09cfa74ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:45.235102Z","signature_b64":"DW+d+IwAHw6SYBREMXLBEV1M4XfGap6fIsyEwFvmHhEbrQ1yUpDNh/zzy98OmudH4ZraI7GidTA2c4EDumkpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce3781aba6eed4394f5649fc020b09a2c682248c68896beb5bceddce658ec85","last_reissued_at":"2026-05-18T01:21:45.234452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:45.234452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sane Proof that COLk \\le COL3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"William Gasarch","submitted_at":"2014-07-18T22:33:30Z","abstract_excerpt":"Let COLk be the set of all k-colorable graphs. It is easy to show that if a<b then COLa \\le COLb (poly time reduction). Using the Cook-Levin theorem it is easy to show that if 3 \\le a< b then COLb \\le COLa. However this proof is insane in that it translates a graph to a formula and then the formula to a graph. We give a simple proof that COLk \\le COL3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5128","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.5128","created_at":"2026-05-18T01:21:45.234558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5128v2","created_at":"2026-05-18T01:21:45.234558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5128","created_at":"2026-05-18T01:21:45.234558+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTRXQGV2N3WU","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTRXQGV2N3WUHFHV","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTRXQGV2","created_at":"2026-05-18T12:28:59.999130+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/ZTRXQGV2N3WUHFHVMSP4AIFQTI","json":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI.json","graph_json":"https://pith.science/api/pith-number/ZTRXQGV2N3WUHFHVMSP4AIFQTI/graph.json","events_json":"https://pith.science/api/pith-number/ZTRXQGV2N3WUHFHVMSP4AIFQTI/events.json","paper":"https://pith.science/paper/ZTRXQGV2"},"agent_actions":{"view_html":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI","download_json":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI.json","view_paper":"https://pith.science/paper/ZTRXQGV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5128&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTRXQGV2N3WUHFHVMSP4AIFQTI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTRXQGV2N3WUHFHVMSP4AIFQTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI/action/storage_attestation","attest_author":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI/action/author_attestation","sign_citation":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI/action/citation_signature","submit_replication":"https://pith.science/pith/ZTRXQGV2N3WUHFHVMSP4AIFQTI/action/replication_record"}},"created_at":"2026-05-18T01:21:45.234558+00:00","updated_at":"2026-05-18T01:21:45.234558+00:00"}