{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6KCHT3VIDCV7I4UWIQPXLM4LV4","short_pith_number":"pith:6KCHT3VI","canonical_record":{"source":{"id":"1507.08348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T00:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"243427b9bd5c784fa67a3394ee2260fd0d664a296b9ebea85ce6ebe1eee204c7","abstract_canon_sha256":"9b358e8af2346138b287ac0633fbc675ee6168e00b82a278409d7f830f60bc90"},"schema_version":"1.0"},"canonical_sha256":"f28479eea818abf47296441f75b38baf0ab1b452a0ae5340a1514966e550cbac","source":{"kind":"arxiv","id":"1507.08348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08348","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08348v1","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08348","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"6KCHT3VIDCV7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6KCHT3VIDCV7I4UW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6KCHT3VI","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6KCHT3VIDCV7I4UWIQPXLM4LV4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T00:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"243427b9bd5c784fa67a3394ee2260fd0d664a296b9ebea85ce6ebe1eee204c7","abstract_canon_sha256":"9b358e8af2346138b287ac0633fbc675ee6168e00b82a278409d7f830f60bc90"},"schema_version":"1.0"},"canonical_sha256":"f28479eea818abf47296441f75b38baf0ab1b452a0ae5340a1514966e550cbac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:07.659157Z","signature_b64":"rmTwdt8jQorefcUow2syn3JnENyKmPlpe/mQPQVm/lJ5IBPP9gZ4WfVU69TA2COsHDqSMvkI6XcGqGEY0a8qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28479eea818abf47296441f75b38baf0ab1b452a0ae5340a1514966e550cbac","last_reissued_at":"2026-05-18T01:36:07.658741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:07.658741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08348","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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyFfQFWLmL9PhdKfpQ+OlwAaZc88yXEzu1NcSnOaIEpb/S+zuWjBQn3SgRKuRXhhVUfI+9MmT84UdSMyc0R1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:30:27.220984Z"},"content_sha256":"a3817fee49c898ab253e08aa4e96cf228d177563e0fb94ffb20d0bc7afdc447b","schema_version":"1.0","event_id":"sha256:a3817fee49c898ab253e08aa4e96cf228d177563e0fb94ffb20d0bc7afdc447b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6KCHT3VIDCV7I4UWIQPXLM4LV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Dense Max 2-CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dana Moshkovitz, Pasin Manurangsi","submitted_at":"2015-07-30T00:02:49Z","abstract_excerpt":"In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within $O(N^{\\varepsilon})$ approximation ratio for any constant $\\varepsilon > 0$. Using this algorithm, we also achieve similar results for free games, projection games on sufficiently dense random graphs, and the Densest $k$-Subgraph problem with sufficiently dense optimal solution. Note, however, that algorithms with similar guarantees to the last algorithm were in fact discovered prior to our work by Feige et al. and Suzuki and Tokuyama.\n  In addition,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08348","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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUl6sgZApKbClGtFTb7eFBoCEKLHkjlXmMefArOBCVN/K4O1bHlbZ1naqViw3Ywer1hZGHPNAARn3tuhcGrzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:30:27.221341Z"},"content_sha256":"cf997c9802f49d843b6d4f63a1f4c4ad441ff4c5f38bb83b88c74be8722b63bd","schema_version":"1.0","event_id":"sha256:cf997c9802f49d843b6d4f63a1f4c4ad441ff4c5f38bb83b88c74be8722b63bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4/bundle.json","state_url":"https://pith.science/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4/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-01T13:30:27Z","links":{"resolver":"https://pith.science/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4","bundle":"https://pith.science/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4/bundle.json","state":"https://pith.science/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KCHT3VIDCV7I4UWIQPXLM4LV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6KCHT3VIDCV7I4UWIQPXLM4LV4","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":"9b358e8af2346138b287ac0633fbc675ee6168e00b82a278409d7f830f60bc90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T00:02:49Z","title_canon_sha256":"243427b9bd5c784fa67a3394ee2260fd0d664a296b9ebea85ce6ebe1eee204c7"},"schema_version":"1.0","source":{"id":"1507.08348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08348","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08348v1","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08348","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"6KCHT3VIDCV7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6KCHT3VIDCV7I4UW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6KCHT3VI","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:cf997c9802f49d843b6d4f63a1f4c4ad441ff4c5f38bb83b88c74be8722b63bd","target":"graph","created_at":"2026-05-18T01:36:07Z","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 polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within $O(N^{\\varepsilon})$ approximation ratio for any constant $\\varepsilon > 0$. Using this algorithm, we also achieve similar results for free games, projection games on sufficiently dense random graphs, and the Densest $k$-Subgraph problem with sufficiently dense optimal solution. Note, however, that algorithms with similar guarantees to the last algorithm were in fact discovered prior to our work by Feige et al. and Suzuki and Tokuyama.\n  In addition,","authors_text":"Dana Moshkovitz, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T00:02:49Z","title":"Approximating Dense Max 2-CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08348","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:a3817fee49c898ab253e08aa4e96cf228d177563e0fb94ffb20d0bc7afdc447b","target":"record","created_at":"2026-05-18T01:36:07Z","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":"9b358e8af2346138b287ac0633fbc675ee6168e00b82a278409d7f830f60bc90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T00:02:49Z","title_canon_sha256":"243427b9bd5c784fa67a3394ee2260fd0d664a296b9ebea85ce6ebe1eee204c7"},"schema_version":"1.0","source":{"id":"1507.08348","kind":"arxiv","version":1}},"canonical_sha256":"f28479eea818abf47296441f75b38baf0ab1b452a0ae5340a1514966e550cbac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f28479eea818abf47296441f75b38baf0ab1b452a0ae5340a1514966e550cbac","first_computed_at":"2026-05-18T01:36:07.658741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:07.658741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rmTwdt8jQorefcUow2syn3JnENyKmPlpe/mQPQVm/lJ5IBPP9gZ4WfVU69TA2COsHDqSMvkI6XcGqGEY0a8qBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:07.659157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3817fee49c898ab253e08aa4e96cf228d177563e0fb94ffb20d0bc7afdc447b","sha256:cf997c9802f49d843b6d4f63a1f4c4ad441ff4c5f38bb83b88c74be8722b63bd"],"state_sha256":"aadf7a2c6d6671cf7e8787a2fcfc23d2601c849863fb46592ffb78240d15c992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pq6O4ZhlYcFcTyC/+YPQnZlArKhKVypQnTws6SI5b5Kv9u4Ceg8bfZf1eI9hMA9qHeXhPDaot8630sJM9KYzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:30:27.223396Z","bundle_sha256":"7d58d5d11b3d8ecab8f3f19c8207d7acd6c171859e039a3ad80ddcf87938b8a8"}}