{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:K52RIBM2FLJWC2ENXMTBEATBYH","short_pith_number":"pith:K52RIBM2","schema_version":"1.0","canonical_sha256":"577514059a2ad361688dbb26120261c1dc84d7de42351c7b276dc11ea7ed7b64","source":{"kind":"arxiv","id":"0910.2271","version":3},"attestation_state":"computed","paper":{"title":"Improved Inapproximability Results for Maximum k-Colorable Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2009-10-12T23:49:08Z","abstract_excerpt":"We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction of edges are properly colored (i.e. their endpoints receive different colors). A random k-coloring properly colors an expected fraction 1-1/k of edges. We prove that given a graph promised to be k-colorable, it is NP-hard to find a k-coloring that properly colors more than a fraction ~1-O(1/k} of edges. Previously, only a hardness factor of 1-O(1/k^2) was known. Our result pins down the correct asymptotic dependence "},"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":"0910.2271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-12T23:49:08Z","cross_cats_sorted":[],"title_canon_sha256":"aaa979b61f21ec676cb08208e4b262407554753826728d60268d786a18bfe8a4","abstract_canon_sha256":"3e8d1da1992f598d273b006e6e1fa91464273b2c0b3981af08b5df519ea19fb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:24.331714Z","signature_b64":"ALLVNSuGIh6a9wI60ODqfEqKC2LJbHshcw4snv9gcg6t8GfoGnvPlEnr3ZX74iesw9EFd58B5jyynZf82nPKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577514059a2ad361688dbb26120261c1dc84d7de42351c7b276dc11ea7ed7b64","last_reissued_at":"2026-05-18T02:11:24.331130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:24.331130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Inapproximability Results for Maximum k-Colorable Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2009-10-12T23:49:08Z","abstract_excerpt":"We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction of edges are properly colored (i.e. their endpoints receive different colors). A random k-coloring properly colors an expected fraction 1-1/k of edges. We prove that given a graph promised to be k-colorable, it is NP-hard to find a k-coloring that properly colors more than a fraction ~1-O(1/k} of edges. Previously, only a hardness factor of 1-O(1/k^2) was known. Our result pins down the correct asymptotic dependence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2271","kind":"arxiv","version":3},"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":"0910.2271","created_at":"2026-05-18T02:11:24.331230+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.2271v3","created_at":"2026-05-18T02:11:24.331230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2271","created_at":"2026-05-18T02:11:24.331230+00:00"},{"alias_kind":"pith_short_12","alias_value":"K52RIBM2FLJW","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"K52RIBM2FLJWC2EN","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"K52RIBM2","created_at":"2026-05-18T12:26:00.592388+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/K52RIBM2FLJWC2ENXMTBEATBYH","json":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH.json","graph_json":"https://pith.science/api/pith-number/K52RIBM2FLJWC2ENXMTBEATBYH/graph.json","events_json":"https://pith.science/api/pith-number/K52RIBM2FLJWC2ENXMTBEATBYH/events.json","paper":"https://pith.science/paper/K52RIBM2"},"agent_actions":{"view_html":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH","download_json":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH.json","view_paper":"https://pith.science/paper/K52RIBM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.2271&json=true","fetch_graph":"https://pith.science/api/pith-number/K52RIBM2FLJWC2ENXMTBEATBYH/graph.json","fetch_events":"https://pith.science/api/pith-number/K52RIBM2FLJWC2ENXMTBEATBYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/action/storage_attestation","attest_author":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/action/author_attestation","sign_citation":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/action/citation_signature","submit_replication":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/action/replication_record"}},"created_at":"2026-05-18T02:11:24.331230+00:00","updated_at":"2026-05-18T02:11:24.331230+00:00"}