{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OXSWMDFWJKQNS7FNUWHWSFQWUV","short_pith_number":"pith:OXSWMDFW","canonical_record":{"source":{"id":"2408.15377","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-08-27T19:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"6555cb532cf59dd7e092398b9b1c7fa322bf4298f8dd7f5ac5f2800bd04d8368","abstract_canon_sha256":"aff2214d47cd732c6c5d0ef3d910ba4017d188d46ed20bc5efe43916b746e71e"},"schema_version":"1.0"},"canonical_sha256":"75e5660cb64aa0d97cada58f691616a55c7470d1ee7d2b18717dad776c170fa2","source":{"kind":"arxiv","id":"2408.15377","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15377","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15377v4","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15377","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"OXSWMDFWJKQN","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"OXSWMDFWJKQNS7FN","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"OXSWMDFW","created_at":"2026-05-20T01:04:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OXSWMDFWJKQNS7FNUWHWSFQWUV","target":"record","payload":{"canonical_record":{"source":{"id":"2408.15377","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-08-27T19:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"6555cb532cf59dd7e092398b9b1c7fa322bf4298f8dd7f5ac5f2800bd04d8368","abstract_canon_sha256":"aff2214d47cd732c6c5d0ef3d910ba4017d188d46ed20bc5efe43916b746e71e"},"schema_version":"1.0"},"canonical_sha256":"75e5660cb64aa0d97cada58f691616a55c7470d1ee7d2b18717dad776c170fa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:50.022530Z","signature_b64":"l+2d3tXBt9MNulCknGwYgvhefm2rsqss/HNboaZV8jZ4BQ/6w98BzSbLAk4N4TxPRbcOcduGY5PlhtGVpk3BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e5660cb64aa0d97cada58f691616a55c7470d1ee7d2b18717dad776c170fa2","last_reissued_at":"2026-05-20T01:04:50.021686Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:50.021686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.15377","source_version":4,"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-20T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSOKOuNQViVbxbuYdl8SBZDorF1L1nu9eiR3wD4AtyfncyuXnF0HlLzU1wB/+6RwKDGnCGh0mLgvpfCKvJYTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:55:03.694413Z"},"content_sha256":"36530d01a38bfd8c98494456bc9795dd973feed9f1ff8c22ff99f8ec38951bff","schema_version":"1.0","event_id":"sha256:36530d01a38bfd8c98494456bc9795dd973feed9f1ff8c22ff99f8ec38951bff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OXSWMDFWJKQNS7FNUWHWSFQWUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximability of Satisfiable k-CSPs: V","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amey Bhangale, Dor Minzer, Subhash Khot","submitted_at":"2024-08-27T19:30:26Z","abstract_excerpt":"We propose a framework of algorithm vs. hardness for all Max-CSPs and demonstrate it for a large class of predicates. This framework extends the work of Raghavendra [STOC, 2008], who showed a similar result for almost satisfiable Max-CSPs.\n  Our framework is based on a new hybrid approximation algorithm, which uses a combination of the Gaussian elimination technique (i.e., solving a system of linear equations over an Abelian group) and the semidefinite programming relaxation. We complement our algorithm with a matching dictator vs. quasirandom test that has perfect completeness.\n  The analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15377","kind":"arxiv","version":4},"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/2408.15377/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"},"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-20T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9YYQPEXOMT2q6fSjeyqHkOtDBvK0ixOstftatywufdQC8uAQ9q/y4vC9BXOCFcwOWnsVnPKRghUy1pu2CgxmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:55:03.695296Z"},"content_sha256":"6ef44600e4c8c0026da9c738543ac6a4378ac707a17dfac555853ac7c1f71a9d","schema_version":"1.0","event_id":"sha256:6ef44600e4c8c0026da9c738543ac6a4378ac707a17dfac555853ac7c1f71a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV/bundle.json","state_url":"https://pith.science/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV/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-28T21:55:03Z","links":{"resolver":"https://pith.science/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV","bundle":"https://pith.science/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV/bundle.json","state":"https://pith.science/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXSWMDFWJKQNS7FNUWHWSFQWUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OXSWMDFWJKQNS7FNUWHWSFQWUV","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":"aff2214d47cd732c6c5d0ef3d910ba4017d188d46ed20bc5efe43916b746e71e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-08-27T19:30:26Z","title_canon_sha256":"6555cb532cf59dd7e092398b9b1c7fa322bf4298f8dd7f5ac5f2800bd04d8368"},"schema_version":"1.0","source":{"id":"2408.15377","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15377","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15377v4","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15377","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"OXSWMDFWJKQN","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"OXSWMDFWJKQNS7FN","created_at":"2026-05-20T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"OXSWMDFW","created_at":"2026-05-20T01:04:50Z"}],"graph_snapshots":[{"event_id":"sha256:6ef44600e4c8c0026da9c738543ac6a4378ac707a17dfac555853ac7c1f71a9d","target":"graph","created_at":"2026-05-20T01:04:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.15377/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a framework of algorithm vs. hardness for all Max-CSPs and demonstrate it for a large class of predicates. This framework extends the work of Raghavendra [STOC, 2008], who showed a similar result for almost satisfiable Max-CSPs.\n  Our framework is based on a new hybrid approximation algorithm, which uses a combination of the Gaussian elimination technique (i.e., solving a system of linear equations over an Abelian group) and the semidefinite programming relaxation. We complement our algorithm with a matching dictator vs. quasirandom test that has perfect completeness.\n  The analysis","authors_text":"Amey Bhangale, Dor Minzer, Subhash Khot","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-08-27T19:30:26Z","title":"On Approximability of Satisfiable k-CSPs: V"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15377","kind":"arxiv","version":4},"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:36530d01a38bfd8c98494456bc9795dd973feed9f1ff8c22ff99f8ec38951bff","target":"record","created_at":"2026-05-20T01:04:50Z","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":"aff2214d47cd732c6c5d0ef3d910ba4017d188d46ed20bc5efe43916b746e71e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-08-27T19:30:26Z","title_canon_sha256":"6555cb532cf59dd7e092398b9b1c7fa322bf4298f8dd7f5ac5f2800bd04d8368"},"schema_version":"1.0","source":{"id":"2408.15377","kind":"arxiv","version":4}},"canonical_sha256":"75e5660cb64aa0d97cada58f691616a55c7470d1ee7d2b18717dad776c170fa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e5660cb64aa0d97cada58f691616a55c7470d1ee7d2b18717dad776c170fa2","first_computed_at":"2026-05-20T01:04:50.021686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:04:50.021686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l+2d3tXBt9MNulCknGwYgvhefm2rsqss/HNboaZV8jZ4BQ/6w98BzSbLAk4N4TxPRbcOcduGY5PlhtGVpk3BAg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:04:50.022530Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.15377","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36530d01a38bfd8c98494456bc9795dd973feed9f1ff8c22ff99f8ec38951bff","sha256:6ef44600e4c8c0026da9c738543ac6a4378ac707a17dfac555853ac7c1f71a9d"],"state_sha256":"5628e0cdac6cd7de0287e9369386be09a2d617912c90c61037189df74ca5b2ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzcoA6iwfaupfYqRdyBJu+GPxHa5natuG2fLsZG4GC9T2hI4JGCY48LULMa4DbFOUsYH2nzMU5XByfoHLWmdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:55:03.699796Z","bundle_sha256":"c9e801107865855e1653fec8dc997c6b1ad511c8f17d3f310dceb2aea1a9c9b1"}}