{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7E2QOHMGAMDJNWSTJAAUM2TZYR","short_pith_number":"pith:7E2QOHMG","canonical_record":{"source":{"id":"1511.06558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-20T11:13:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"44a747e11cefb1761c1ffac1da81223c5eca26bffeab220ef0937f91068e0454","abstract_canon_sha256":"d3e733a67580661aaac291abff923af6a8dbad1847a2aacec6a9a6668fea77f2"},"schema_version":"1.0"},"canonical_sha256":"f935071d86030696da534801466a79c4544117fd8c6aa0f454ac811c0c5100cc","source":{"kind":"arxiv","id":"1511.06558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06558","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06558v1","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06558","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"7E2QOHMGAMDJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7E2QOHMGAMDJNWST","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7E2QOHMG","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7E2QOHMGAMDJNWSTJAAUM2TZYR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-20T11:13:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"44a747e11cefb1761c1ffac1da81223c5eca26bffeab220ef0937f91068e0454","abstract_canon_sha256":"d3e733a67580661aaac291abff923af6a8dbad1847a2aacec6a9a6668fea77f2"},"schema_version":"1.0"},"canonical_sha256":"f935071d86030696da534801466a79c4544117fd8c6aa0f454ac811c0c5100cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.280123Z","signature_b64":"IRld86bK02PK9mfQeARyjxkmhWI/E2XLQq2Xr2olq92Xzolq5CAcOW0Kizdf/X62x4mzKk0A4UOx4MtXthI/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f935071d86030696da534801466a79c4544117fd8c6aa0f454ac811c0c5100cc","last_reissued_at":"2026-05-18T01:26:24.279697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.279697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06558","source_version":1,"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-18T01:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i3aUvlL+VI4CCRlLMfHVNnTeMQxFtSm/zE2W5VNOdgtT6Yp5jc117gYHNJyFmB9CKWSi0s28p/YuIiXyIYwHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:19:47.419446Z"},"content_sha256":"261e9fd6d8143537a2028c50af8d854bc46b48dbf02c4d342edfe79a822139f6","schema_version":"1.0","event_id":"sha256:261e9fd6d8143537a2028c50af8d854bc46b48dbf02c4d342edfe79a822139f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7E2QOHMGAMDJNWSTJAAUM2TZYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal UGC-hardness of Approximating Max k-CSP_R","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Luca Trevisan, Pasin Manurangsi, Preetum Nakkiran","submitted_at":"2015-11-20T11:13:10Z","abstract_excerpt":"In this paper, we prove an almost-optimal hardness for Max $k$-CSP$_R$ based on Khot's Unique Games Conjecture (UGC). In Max $k$-CSP$_R$, we are given a set of predicates each of which depends on exactly $k$ variables. Each variable can take any value from $1, 2, \\dots, R$. The goal is to find an assignment to variables that maximizes the number of satisfied predicates.\n  Assuming the Unique Games Conjecture, we show that it is NP-hard to approximate Max $k$-CSP$_R$ to within factor $2^{O(k \\log k)}(\\log R)^{k/2}/R^{k - 1}$ for any $k, R$. To the best of our knowledge, this result improves on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06558","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"},"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-18T01:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyGG4DEvOEIYIUrxL1V/mtLH68oK2N3Wd+bpakrbJaIRxHpHXEwWC9EszL+kiqPHcbJiHz8j13m4PvVb2Zn2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:19:47.419800Z"},"content_sha256":"76a2d4fc703ea54154dbb173d70db0603d0eebbdd211bc4b4b1cdf297a0307e8","schema_version":"1.0","event_id":"sha256:76a2d4fc703ea54154dbb173d70db0603d0eebbdd211bc4b4b1cdf297a0307e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR/bundle.json","state_url":"https://pith.science/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR/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-06-01T20:19:47Z","links":{"resolver":"https://pith.science/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR","bundle":"https://pith.science/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR/bundle.json","state":"https://pith.science/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7E2QOHMGAMDJNWSTJAAUM2TZYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7E2QOHMGAMDJNWSTJAAUM2TZYR","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":"d3e733a67580661aaac291abff923af6a8dbad1847a2aacec6a9a6668fea77f2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-20T11:13:10Z","title_canon_sha256":"44a747e11cefb1761c1ffac1da81223c5eca26bffeab220ef0937f91068e0454"},"schema_version":"1.0","source":{"id":"1511.06558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06558","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06558v1","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06558","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"7E2QOHMGAMDJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7E2QOHMGAMDJNWST","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7E2QOHMG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:76a2d4fc703ea54154dbb173d70db0603d0eebbdd211bc4b4b1cdf297a0307e8","target":"graph","created_at":"2026-05-18T01:26: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":"In this paper, we prove an almost-optimal hardness for Max $k$-CSP$_R$ based on Khot's Unique Games Conjecture (UGC). In Max $k$-CSP$_R$, we are given a set of predicates each of which depends on exactly $k$ variables. Each variable can take any value from $1, 2, \\dots, R$. The goal is to find an assignment to variables that maximizes the number of satisfied predicates.\n  Assuming the Unique Games Conjecture, we show that it is NP-hard to approximate Max $k$-CSP$_R$ to within factor $2^{O(k \\log k)}(\\log R)^{k/2}/R^{k - 1}$ for any $k, R$. To the best of our knowledge, this result improves on ","authors_text":"Luca Trevisan, Pasin Manurangsi, Preetum Nakkiran","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-20T11:13:10Z","title":"Near-Optimal UGC-hardness of Approximating Max k-CSP_R"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06558","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:261e9fd6d8143537a2028c50af8d854bc46b48dbf02c4d342edfe79a822139f6","target":"record","created_at":"2026-05-18T01:26: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":"d3e733a67580661aaac291abff923af6a8dbad1847a2aacec6a9a6668fea77f2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-20T11:13:10Z","title_canon_sha256":"44a747e11cefb1761c1ffac1da81223c5eca26bffeab220ef0937f91068e0454"},"schema_version":"1.0","source":{"id":"1511.06558","kind":"arxiv","version":1}},"canonical_sha256":"f935071d86030696da534801466a79c4544117fd8c6aa0f454ac811c0c5100cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f935071d86030696da534801466a79c4544117fd8c6aa0f454ac811c0c5100cc","first_computed_at":"2026-05-18T01:26:24.279697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:24.279697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IRld86bK02PK9mfQeARyjxkmhWI/E2XLQq2Xr2olq92Xzolq5CAcOW0Kizdf/X62x4mzKk0A4UOx4MtXthI/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:24.280123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:261e9fd6d8143537a2028c50af8d854bc46b48dbf02c4d342edfe79a822139f6","sha256:76a2d4fc703ea54154dbb173d70db0603d0eebbdd211bc4b4b1cdf297a0307e8"],"state_sha256":"da7a330214b9febdcd166460a1bf2bc0621c77cadfde9852ccf7c3934c6ca041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvVVvU3lm1QMqYbLl8cM3ZJLFQu0rCrqjOP6YKo/SdoPHVUzFSTuM9AZW653OZkCgf2CNN1koc8iHaudB4a1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:19:47.421825Z","bundle_sha256":"8e962e99414ebd54cd9552771a2c0511b4766bb48a86aa612c829330d9e3344d"}}