{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:K52RIBM2FLJWC2ENXMTBEATBYH","short_pith_number":"pith:K52RIBM2","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"},"canonical_sha256":"577514059a2ad361688dbb26120261c1dc84d7de42351c7b276dc11ea7ed7b64","source":{"kind":"arxiv","id":"0910.2271","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2271","created_at":"2026-05-18T02:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2271v3","created_at":"2026-05-18T02:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2271","created_at":"2026-05-18T02:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"K52RIBM2FLJW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"K52RIBM2FLJWC2EN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"K52RIBM2","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:K52RIBM2FLJWC2ENXMTBEATBYH","target":"record","payload":{"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"},"canonical_sha256":"577514059a2ad361688dbb26120261c1dc84d7de42351c7b276dc11ea7ed7b64","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"},"source_kind":"arxiv","source_id":"0910.2271","source_version":3,"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-05-18T02:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8o/E6hF+5PHEXPz41VuAVDsPu+JGehO8zE+Ri+JTVQMsa/o916xfMLD++0HwUetq4/N5wSCjE1awqoT7uavECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:25:55.381459Z"},"content_sha256":"13b7a9e37a7b51381f463e3e6e398ffe1721fa63432a72b3fd26eccc3510e487","schema_version":"1.0","event_id":"sha256:13b7a9e37a7b51381f463e3e6e398ffe1721fa63432a72b3fd26eccc3510e487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:K52RIBM2FLJWC2ENXMTBEATBYH","target":"graph","payload":{"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"},"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-05-18T02:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQijy2qVtBpsWSCU5A8utdJBI86DEIL822HUWE6GDFTtvUWqHAiZpwlqagH4yvua6cokabFRRHztpiZyX3w5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:25:55.382076Z"},"content_sha256":"eaf0d28a7d5d03928c87c862d1591d1da6cadfbf5100e7fdc2c0439465f56245","schema_version":"1.0","event_id":"sha256:eaf0d28a7d5d03928c87c862d1591d1da6cadfbf5100e7fdc2c0439465f56245"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/bundle.json","state_url":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K52RIBM2FLJWC2ENXMTBEATBYH/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-05-31T22:25:55Z","links":{"resolver":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH","bundle":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/bundle.json","state":"https://pith.science/pith/K52RIBM2FLJWC2ENXMTBEATBYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K52RIBM2FLJWC2ENXMTBEATBYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:K52RIBM2FLJWC2ENXMTBEATBYH","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":"3e8d1da1992f598d273b006e6e1fa91464273b2c0b3981af08b5df519ea19fb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-12T23:49:08Z","title_canon_sha256":"aaa979b61f21ec676cb08208e4b262407554753826728d60268d786a18bfe8a4"},"schema_version":"1.0","source":{"id":"0910.2271","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2271","created_at":"2026-05-18T02:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2271v3","created_at":"2026-05-18T02:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2271","created_at":"2026-05-18T02:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"K52RIBM2FLJW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"K52RIBM2FLJWC2EN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"K52RIBM2","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:eaf0d28a7d5d03928c87c862d1591d1da6cadfbf5100e7fdc2c0439465f56245","target":"graph","created_at":"2026-05-18T02:11:24Z","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"},"paper":{"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 ","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-12T23:49:08Z","title":"Improved Inapproximability Results for Maximum k-Colorable Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2271","kind":"arxiv","version":3},"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:13b7a9e37a7b51381f463e3e6e398ffe1721fa63432a72b3fd26eccc3510e487","target":"record","created_at":"2026-05-18T02:11:24Z","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":"3e8d1da1992f598d273b006e6e1fa91464273b2c0b3981af08b5df519ea19fb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-12T23:49:08Z","title_canon_sha256":"aaa979b61f21ec676cb08208e4b262407554753826728d60268d786a18bfe8a4"},"schema_version":"1.0","source":{"id":"0910.2271","kind":"arxiv","version":3}},"canonical_sha256":"577514059a2ad361688dbb26120261c1dc84d7de42351c7b276dc11ea7ed7b64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577514059a2ad361688dbb26120261c1dc84d7de42351c7b276dc11ea7ed7b64","first_computed_at":"2026-05-18T02:11:24.331130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:11:24.331130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ALLVNSuGIh6a9wI60ODqfEqKC2LJbHshcw4snv9gcg6t8GfoGnvPlEnr3ZX74iesw9EFd58B5jyynZf82nPKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:11:24.331714Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.2271","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13b7a9e37a7b51381f463e3e6e398ffe1721fa63432a72b3fd26eccc3510e487","sha256:eaf0d28a7d5d03928c87c862d1591d1da6cadfbf5100e7fdc2c0439465f56245"],"state_sha256":"dba57690d778a04f92cae2eb3ed7f023703ffb2d41ed67e4c32d3822a3a53e7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvu8iDffS8DufzJ6mGSJmXV0jRzsZ+cgrQkrVMUyNfEO1LX0rYkATVBmckaeaoau46+xyB3mbZuD8VS3FxWaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:25:55.385128Z","bundle_sha256":"d11fda73cda2c85bb837069229b8ed31b9acc69daf8ac9e19c3cf7a84db030a1"}}