{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HW2HCRGLJLUZH5VBGTIGV7ZDFL","short_pith_number":"pith:HW2HCRGL","schema_version":"1.0","canonical_sha256":"3db47144cb4ae993f6a134d06aff232ad28d30587e9f6b8dbe1379ae9499cbc7","source":{"kind":"arxiv","id":"1707.03888","version":1},"attestation_state":"computed","paper":{"title":"Additive non-approximability of chromatic number in proper minor-closed classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ken-ichi Kawarabayashi, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-07-12T19:55:03Z","abstract_excerpt":"Robin Thomas asked whether for every proper minor-closed class C, there exists a polynomial-time algorithm approximating the chromatic number of graphs from C up to a constant additive error independent on the class C. We show this is not the case: unless P=NP, for every integer k>=1, there is no polynomial-time algorithm to color a K_{4k+1}-minor-free graph G using at most chi(G)+k-1 colors. More generally, for every k>=1 and 1<=\\beta<=4/3, there is no polynomial-time algorithm to color a K_{4k+1}-minor-free graph G using less than beta.chi(G)+(4-3beta)k colors. As far as we know, this is the"},"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":"1707.03888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-12T19:55:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2a78f9a087f62b3d468f61347d0874728ad17e82c0de1b9cd41ded0395de4eb7","abstract_canon_sha256":"ca4fd03fdfa5f39e441f072458020e9cc01fc08d371b8642aa89b0bd4d67cb2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:23.248113Z","signature_b64":"LEfrvwDeT41gvlE/q3a4e2Rw8GdteJiTrSLx9hCmwFFKEtmrvnfg7VQ257y7IcrMEKxXXrWKI8Z3aNJ4YOOqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db47144cb4ae993f6a134d06aff232ad28d30587e9f6b8dbe1379ae9499cbc7","last_reissued_at":"2026-05-18T00:40:23.247558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:23.247558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Additive non-approximability of chromatic number in proper minor-closed classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ken-ichi Kawarabayashi, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-07-12T19:55:03Z","abstract_excerpt":"Robin Thomas asked whether for every proper minor-closed class C, there exists a polynomial-time algorithm approximating the chromatic number of graphs from C up to a constant additive error independent on the class C. We show this is not the case: unless P=NP, for every integer k>=1, there is no polynomial-time algorithm to color a K_{4k+1}-minor-free graph G using at most chi(G)+k-1 colors. More generally, for every k>=1 and 1<=\\beta<=4/3, there is no polynomial-time algorithm to color a K_{4k+1}-minor-free graph G using less than beta.chi(G)+(4-3beta)k colors. As far as we know, this is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03888","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03888","created_at":"2026-05-18T00:40:23.247657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03888v1","created_at":"2026-05-18T00:40:23.247657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03888","created_at":"2026-05-18T00:40:23.247657+00:00"},{"alias_kind":"pith_short_12","alias_value":"HW2HCRGLJLUZ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HW2HCRGLJLUZH5VB","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HW2HCRGL","created_at":"2026-05-18T12:31:21.493067+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/HW2HCRGLJLUZH5VBGTIGV7ZDFL","json":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL.json","graph_json":"https://pith.science/api/pith-number/HW2HCRGLJLUZH5VBGTIGV7ZDFL/graph.json","events_json":"https://pith.science/api/pith-number/HW2HCRGLJLUZH5VBGTIGV7ZDFL/events.json","paper":"https://pith.science/paper/HW2HCRGL"},"agent_actions":{"view_html":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL","download_json":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL.json","view_paper":"https://pith.science/paper/HW2HCRGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03888&json=true","fetch_graph":"https://pith.science/api/pith-number/HW2HCRGLJLUZH5VBGTIGV7ZDFL/graph.json","fetch_events":"https://pith.science/api/pith-number/HW2HCRGLJLUZH5VBGTIGV7ZDFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL/action/storage_attestation","attest_author":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL/action/author_attestation","sign_citation":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL/action/citation_signature","submit_replication":"https://pith.science/pith/HW2HCRGLJLUZH5VBGTIGV7ZDFL/action/replication_record"}},"created_at":"2026-05-18T00:40:23.247657+00:00","updated_at":"2026-05-18T00:40:23.247657+00:00"}