{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QAAEM3D543BD652FLXCDPBFJOL","short_pith_number":"pith:QAAEM3D5","canonical_record":{"source":{"id":"1504.00681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T20:05:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9c0c430bc7952d64f94816cca77e14605148bee332aac723b320074b089db769","abstract_canon_sha256":"c9064418169baa26883b9474164a7e21f06c7c5b60d4b997d250917a3685eba5"},"schema_version":"1.0"},"canonical_sha256":"8000466c7de6c23f77455dc43784a972d893dc834ddd6c3b105c0b3b6a582b85","source":{"kind":"arxiv","id":"1504.00681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00681","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00681v2","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00681","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"QAAEM3D543BD","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAAEM3D543BD652F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAAEM3D5","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QAAEM3D543BD652FLXCDPBFJOL","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T20:05:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9c0c430bc7952d64f94816cca77e14605148bee332aac723b320074b089db769","abstract_canon_sha256":"c9064418169baa26883b9474164a7e21f06c7c5b60d4b997d250917a3685eba5"},"schema_version":"1.0"},"canonical_sha256":"8000466c7de6c23f77455dc43784a972d893dc834ddd6c3b105c0b3b6a582b85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:35.547753Z","signature_b64":"EvosdBShhj+RbXfQZHw00IRvcbNnZIL0N+2/TfTtieIRwVsZUi6cbNP23RYsNQ7w55ArEz/Lt37e9JOqcUmhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8000466c7de6c23f77455dc43784a972d893dc834ddd6c3b105c0b3b6a582b85","last_reissued_at":"2026-05-18T02:19:35.547247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:35.547247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00681","source_version":2,"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:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1pfoc/cGwmzbcNv2QQFVYGgiHHjkAVXxLHuzVThV7XOJa/Rp7goYCAtGv8CL8/MJo6o4Ab8iZqlh+Hw0WFPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:37:37.442828Z"},"content_sha256":"f43a61000377bd96999e6f76f2554eabbdc5f1e3142e54ebbbf5664881417e0b","schema_version":"1.0","event_id":"sha256:f43a61000377bd96999e6f76f2554eabbdc5f1e3142e54ebbbf5664881417e0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QAAEM3D543BD652FLXCDPBFJOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of non-boolean 2CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Guy Kindler, Luca Trevisan","submitted_at":"2015-04-02T20:05:58Z","abstract_excerpt":"We develop a polynomial time $\\Omega\\left ( \\frac 1R \\log R \\right)$ approximate algorithm for Max 2CSP-$R$, the problem where we are given a collection of constraints, each involving two variables, where each variable ranges over a set of size $R$, and we want to find an assignment to the variables that maximizes the number of satisfied constraints. Assuming the Unique Games Conjecture, this is the best possible approximation up to constant factors.\n  Previously, a $1/R$-approximate algorithm was known, based on linear programming. Our algorithm is based on semidefinite programming (SDP) and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00681","kind":"arxiv","version":2},"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:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJebGbrVYc0tWif987R0hIAy0OOWTEoCPiiNmbWcpCfiTFgCziDk8tXU5siZhtK22dUK8G8G91unEZDI4PgTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:37:37.443437Z"},"content_sha256":"09a05da737e997778c5afaf9c71445e096a0e73be0c77a2ca16ff28e814ff2e4","schema_version":"1.0","event_id":"sha256:09a05da737e997778c5afaf9c71445e096a0e73be0c77a2ca16ff28e814ff2e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAAEM3D543BD652FLXCDPBFJOL/bundle.json","state_url":"https://pith.science/pith/QAAEM3D543BD652FLXCDPBFJOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAAEM3D543BD652FLXCDPBFJOL/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-30T02:37:37Z","links":{"resolver":"https://pith.science/pith/QAAEM3D543BD652FLXCDPBFJOL","bundle":"https://pith.science/pith/QAAEM3D543BD652FLXCDPBFJOL/bundle.json","state":"https://pith.science/pith/QAAEM3D543BD652FLXCDPBFJOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAAEM3D543BD652FLXCDPBFJOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QAAEM3D543BD652FLXCDPBFJOL","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":"c9064418169baa26883b9474164a7e21f06c7c5b60d4b997d250917a3685eba5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T20:05:58Z","title_canon_sha256":"9c0c430bc7952d64f94816cca77e14605148bee332aac723b320074b089db769"},"schema_version":"1.0","source":{"id":"1504.00681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00681","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00681v2","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00681","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"QAAEM3D543BD","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAAEM3D543BD652F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAAEM3D5","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:09a05da737e997778c5afaf9c71445e096a0e73be0c77a2ca16ff28e814ff2e4","target":"graph","created_at":"2026-05-18T02:19:35Z","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 develop a polynomial time $\\Omega\\left ( \\frac 1R \\log R \\right)$ approximate algorithm for Max 2CSP-$R$, the problem where we are given a collection of constraints, each involving two variables, where each variable ranges over a set of size $R$, and we want to find an assignment to the variables that maximizes the number of satisfied constraints. Assuming the Unique Games Conjecture, this is the best possible approximation up to constant factors.\n  Previously, a $1/R$-approximate algorithm was known, based on linear programming. Our algorithm is based on semidefinite programming (SDP) and ","authors_text":"Alexandra Kolla, Guy Kindler, Luca Trevisan","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T20:05:58Z","title":"Approximation of non-boolean 2CSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00681","kind":"arxiv","version":2},"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:f43a61000377bd96999e6f76f2554eabbdc5f1e3142e54ebbbf5664881417e0b","target":"record","created_at":"2026-05-18T02:19:35Z","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":"c9064418169baa26883b9474164a7e21f06c7c5b60d4b997d250917a3685eba5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T20:05:58Z","title_canon_sha256":"9c0c430bc7952d64f94816cca77e14605148bee332aac723b320074b089db769"},"schema_version":"1.0","source":{"id":"1504.00681","kind":"arxiv","version":2}},"canonical_sha256":"8000466c7de6c23f77455dc43784a972d893dc834ddd6c3b105c0b3b6a582b85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8000466c7de6c23f77455dc43784a972d893dc834ddd6c3b105c0b3b6a582b85","first_computed_at":"2026-05-18T02:19:35.547247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:35.547247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EvosdBShhj+RbXfQZHw00IRvcbNnZIL0N+2/TfTtieIRwVsZUi6cbNP23RYsNQ7w55ArEz/Lt37e9JOqcUmhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:35.547753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f43a61000377bd96999e6f76f2554eabbdc5f1e3142e54ebbbf5664881417e0b","sha256:09a05da737e997778c5afaf9c71445e096a0e73be0c77a2ca16ff28e814ff2e4"],"state_sha256":"e1763cb41de75883f145546a08abc5b6b665551ec0ddf47663a77c2cb4332b6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oyd/G8flc7XPaG0fs4lSj9nkk8Y/drJdzYDOiUpOQFKbAGlrQdNdqFWH7iSeDvBOE0Eoo0iZ/Fr4ZXkQ+HolBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:37:37.446590Z","bundle_sha256":"1ca82ca612f8537b868ca88d7ec2c23c9eba8e671af456a604f5780f94bb2e42"}}