{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YGSSWWFGECFGFBS7RF2TRS3QNF","short_pith_number":"pith:YGSSWWFG","schema_version":"1.0","canonical_sha256":"c1a52b58a6208a62865f897538cb706942dbd5c1e3094130b64e357c1fc3fcca","source":{"kind":"arxiv","id":"2608.05331","version":1},"attestation_state":"computed","paper":{"title":"On the Approximability of Boolean Max-$k$-CSP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ainesh Bakshi","submitted_at":"2026-08-05T18:41:43Z","abstract_excerpt":"Consider the problem of maximizing the number of satisfied constraints of an arbitrary boolean constraint satisfaction problem with arity $k$. We obtain a polynomial time algorithm that achieves a $(k/2^k)$-approximation, improving on the previous best guarantee of $0.626612\\; k/2^k$, due to Makarychev and Makarychev (arXiv:1206.3603). Assuming the Unique Games Conjecture, De and Mossel (arXiv:1202.5258) showed that achieving an approximation ratio better than $(k+1)/2^k$ for odd $k$ and $(k+2)/2^k$ for even $k$, is NP-hard. The main technical ingredient is an extension of a recently establish"},"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":"2608.05331","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-05T18:41:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7e8ffa00bfa05d38bd1380c5660e86a566ee7fdbbd6cac00ebd3960908ad4e50","abstract_canon_sha256":"ba8c22fb4da1da8ccc6b8b95847f694dc80449e33281c784823228a31905a4ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:47:01.521799Z","signature_b64":"1Igt4y+hU8S7EokkOTT+D1ce8voqEfiN3TI6v9l3wuYNzhtImEPkEMaHvM1OXmdKfmTA52zXDPxqoJ6AeudRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a52b58a6208a62865f897538cb706942dbd5c1e3094130b64e357c1fc3fcca","last_reissued_at":"2026-08-07T00:47:01.520215Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:47:01.520215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximability of Boolean Max-$k$-CSP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ainesh Bakshi","submitted_at":"2026-08-05T18:41:43Z","abstract_excerpt":"Consider the problem of maximizing the number of satisfied constraints of an arbitrary boolean constraint satisfaction problem with arity $k$. We obtain a polynomial time algorithm that achieves a $(k/2^k)$-approximation, improving on the previous best guarantee of $0.626612\\; k/2^k$, due to Makarychev and Makarychev (arXiv:1206.3603). Assuming the Unique Games Conjecture, De and Mossel (arXiv:1202.5258) showed that achieving an approximation ratio better than $(k+1)/2^k$ for odd $k$ and $(k+2)/2^k$ for even $k$, is NP-hard. The main technical ingredient is an extension of a recently establish"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05331","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.05331/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.05331","created_at":"2026-08-07T00:47:01.521617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05331v1","created_at":"2026-08-07T00:47:01.521617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05331","created_at":"2026-08-07T00:47:01.521617+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGSSWWFGECFG","created_at":"2026-08-07T00:47:01.521617+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGSSWWFGECFGFBS7","created_at":"2026-08-07T00:47:01.521617+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGSSWWFG","created_at":"2026-08-07T00:47:01.521617+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/YGSSWWFGECFGFBS7RF2TRS3QNF","json":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF.json","graph_json":"https://pith.science/api/pith-number/YGSSWWFGECFGFBS7RF2TRS3QNF/graph.json","events_json":"https://pith.science/api/pith-number/YGSSWWFGECFGFBS7RF2TRS3QNF/events.json","paper":"https://pith.science/paper/YGSSWWFG"},"agent_actions":{"view_html":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF","download_json":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF.json","view_paper":"https://pith.science/paper/YGSSWWFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05331&json=true","fetch_graph":"https://pith.science/api/pith-number/YGSSWWFGECFGFBS7RF2TRS3QNF/graph.json","fetch_events":"https://pith.science/api/pith-number/YGSSWWFGECFGFBS7RF2TRS3QNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF/action/storage_attestation","attest_author":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF/action/author_attestation","sign_citation":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF/action/citation_signature","submit_replication":"https://pith.science/pith/YGSSWWFGECFGFBS7RF2TRS3QNF/action/replication_record"}},"created_at":"2026-08-07T00:47:01.521617+00:00","updated_at":"2026-08-07T00:47:01.521617+00:00"}