{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GIFIDKULUG3DAAWFPH4D642GSM","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":"de87cdabbcd88e2b5d0380fac6309c4a63fe4308b8c4578c9ae0e8bd63a891b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-15T22:40:40Z","title_canon_sha256":"64eb417ff4b57c4b9033753eb6b29d52a91e3f3f9d08388d292c1d8588cbec70"},"schema_version":"1.0","source":{"id":"1206.3603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3603","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3603v1","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3603","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"GIFIDKULUG3D","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GIFIDKULUG3DAAWF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GIFIDKUL","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:bdafedeb1274b067989e184b8ffbb392e828756d6cabc0e8e644edc1f7279d97","target":"graph","created_at":"2026-05-18T03:53:19Z","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":"In this paper, we present a randomized polynomial-time approximation algorithm for k-CSPd. In k-CSPd, we are given a set of predicates of arity k over an alphabet of size d. Our goal is to find an assignment that maximizes the number of satisfied constraints.\n  Our algorithm has approximation factor Omega(kd/d^k) (when k > \\Omega(log d)). This bound is asymptotically optimal assuming the Unique Games Conjecture. The best previously known algorithm has approximation factor Omega(k log d/d^k).\n  We also give an approximation algorithm for the boolean MAX k-CSP2 problem with a slightly improved a","authors_text":"Konstantin Makarychev, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-15T22:40:40Z","title":"Approximation Algorithm for Non-Boolean MAX k-CSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3603","kind":"arxiv","version":1},"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:8fbfe2bad03541e85c0c5e2888104b26023d164997c37b23e6b93ee471f5b406","target":"record","created_at":"2026-05-18T03:53:19Z","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":"de87cdabbcd88e2b5d0380fac6309c4a63fe4308b8c4578c9ae0e8bd63a891b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-15T22:40:40Z","title_canon_sha256":"64eb417ff4b57c4b9033753eb6b29d52a91e3f3f9d08388d292c1d8588cbec70"},"schema_version":"1.0","source":{"id":"1206.3603","kind":"arxiv","version":1}},"canonical_sha256":"320a81aa8ba1b63002c579f83f7346931c42cd2ac3cb96c6d7ed4f7fc5dcd39c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320a81aa8ba1b63002c579f83f7346931c42cd2ac3cb96c6d7ed4f7fc5dcd39c","first_computed_at":"2026-05-18T03:53:19.357911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:19.357911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"43lMVFHzalvVFH8G8ulCSkz4ZVRTTQP7evt4zxRHs3nrwP8AppyeuiOiEfWnd8QUp2XzZBgFB8FfWalku6o2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:19.358604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fbfe2bad03541e85c0c5e2888104b26023d164997c37b23e6b93ee471f5b406","sha256:bdafedeb1274b067989e184b8ffbb392e828756d6cabc0e8e644edc1f7279d97"],"state_sha256":"474019e5bacff0bb00b440e8df08898655e3c5bad1cf276885cb0c4704b90e11"}