{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q24HN7MJL7XP7RXBNRE6SQIWOS","short_pith_number":"pith:Q24HN7MJ","canonical_record":{"source":{"id":"1407.7759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T15:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"5e6f537ca69e84293db4e4820f95b069191f018fd3a952ddcde1780a4d5310c9","abstract_canon_sha256":"4f4fa596090e023b2ffa06fd4750c24653c4e91aca585cce967d144960b2e1e9"},"schema_version":"1.0"},"canonical_sha256":"86b876fd895feeffc6e16c49e9411674bcba5b85c157419d45fcccd6f64b194a","source":{"kind":"arxiv","id":"1407.7759","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7759","created_at":"2026-05-18T02:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7759v1","created_at":"2026-05-18T02:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7759","created_at":"2026-05-18T02:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"Q24HN7MJL7XP","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q24HN7MJL7XP7RXB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q24HN7MJ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q24HN7MJL7XP7RXBNRE6SQIWOS","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T15:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"5e6f537ca69e84293db4e4820f95b069191f018fd3a952ddcde1780a4d5310c9","abstract_canon_sha256":"4f4fa596090e023b2ffa06fd4750c24653c4e91aca585cce967d144960b2e1e9"},"schema_version":"1.0"},"canonical_sha256":"86b876fd895feeffc6e16c49e9411674bcba5b85c157419d45fcccd6f64b194a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:15.555532Z","signature_b64":"3IHYrRYlkZ3e26ShGWF8QJaUXMWy3h5w0rXMUmOcy1My4ainLUT5STM73VMAbUfarRikQceeydv22XRdMPSsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86b876fd895feeffc6e16c49e9411674bcba5b85c157419d45fcccd6f64b194a","last_reissued_at":"2026-05-18T02:46:15.554789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:15.554789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7759","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-18T02:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JICVdtRTUr/HyAt1XrGrD0+rM8vkP6K4GhgP1Z3q6aYFNKPEJ7U2dsCpGbBdIfMB4CwdiL71Lg+X/y41kFaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:42:24.688907Z"},"content_sha256":"82ee2dad7d99b1af11280164135d557bd5de82785579077ad0dc748014eb04bc","schema_version":"1.0","event_id":"sha256:82ee2dad7d99b1af11280164135d557bd5de82785579077ad0dc748014eb04bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q24HN7MJL7XP7RXBNRE6SQIWOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Approximation of Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amey Bhangale, Sushant Sachdeva, Swastik Kopparty","submitted_at":"2014-07-29T15:48:38Z","abstract_excerpt":"Given $k$ collections of 2SAT clauses on the same set of variables $V$, can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous constraint satisfaction problems, and design the first nontrivial approximation algorithms in this context.\n  Our main result is that for every CSP $F$, for $k < \\tilde{O}(\\log^{1/4} n)$, there is a polynomial time constant factor Pareto approximation algorithm for $k$ simultaneous Max-$F$-CSP instances. Our methods are quite general, and we also use them to give an improved approximation factor for sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7759","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-18T02:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jY09p132xhfs1kNGw2b9zz0n4UOSyiixzHBisLwbd99Xy+1WrltLkrCwfSTvlSy7bD9gRxNZBD3+6k6LTmh7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:42:24.689275Z"},"content_sha256":"99891f6050bc3c7c6065f4685440c882a290dc7d70a738de55256d04fe8b7593","schema_version":"1.0","event_id":"sha256:99891f6050bc3c7c6065f4685440c882a290dc7d70a738de55256d04fe8b7593"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS/bundle.json","state_url":"https://pith.science/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS/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-26T16:42:24Z","links":{"resolver":"https://pith.science/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS","bundle":"https://pith.science/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS/bundle.json","state":"https://pith.science/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q24HN7MJL7XP7RXBNRE6SQIWOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q24HN7MJL7XP7RXBNRE6SQIWOS","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":"4f4fa596090e023b2ffa06fd4750c24653c4e91aca585cce967d144960b2e1e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T15:48:38Z","title_canon_sha256":"5e6f537ca69e84293db4e4820f95b069191f018fd3a952ddcde1780a4d5310c9"},"schema_version":"1.0","source":{"id":"1407.7759","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7759","created_at":"2026-05-18T02:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7759v1","created_at":"2026-05-18T02:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7759","created_at":"2026-05-18T02:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"Q24HN7MJL7XP","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q24HN7MJL7XP7RXB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q24HN7MJ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:99891f6050bc3c7c6065f4685440c882a290dc7d70a738de55256d04fe8b7593","target":"graph","created_at":"2026-05-18T02:46:15Z","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":"Given $k$ collections of 2SAT clauses on the same set of variables $V$, can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous constraint satisfaction problems, and design the first nontrivial approximation algorithms in this context.\n  Our main result is that for every CSP $F$, for $k < \\tilde{O}(\\log^{1/4} n)$, there is a polynomial time constant factor Pareto approximation algorithm for $k$ simultaneous Max-$F$-CSP instances. Our methods are quite general, and we also use them to give an improved approximation factor for sim","authors_text":"Amey Bhangale, Sushant Sachdeva, Swastik Kopparty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T15:48:38Z","title":"Simultaneous Approximation of Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7759","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:82ee2dad7d99b1af11280164135d557bd5de82785579077ad0dc748014eb04bc","target":"record","created_at":"2026-05-18T02:46:15Z","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":"4f4fa596090e023b2ffa06fd4750c24653c4e91aca585cce967d144960b2e1e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T15:48:38Z","title_canon_sha256":"5e6f537ca69e84293db4e4820f95b069191f018fd3a952ddcde1780a4d5310c9"},"schema_version":"1.0","source":{"id":"1407.7759","kind":"arxiv","version":1}},"canonical_sha256":"86b876fd895feeffc6e16c49e9411674bcba5b85c157419d45fcccd6f64b194a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86b876fd895feeffc6e16c49e9411674bcba5b85c157419d45fcccd6f64b194a","first_computed_at":"2026-05-18T02:46:15.554789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:15.554789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3IHYrRYlkZ3e26ShGWF8QJaUXMWy3h5w0rXMUmOcy1My4ainLUT5STM73VMAbUfarRikQceeydv22XRdMPSsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:15.555532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7759","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ee2dad7d99b1af11280164135d557bd5de82785579077ad0dc748014eb04bc","sha256:99891f6050bc3c7c6065f4685440c882a290dc7d70a738de55256d04fe8b7593"],"state_sha256":"38aacc276cde303d5d0cf4e96d31b5abd8bbd3d0cc8e5a5a90c0eff96262a39a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vngtlSrDkjOHKogqeFSsFdJcwihoZLN4/EFeBM0+jOV24WF5n7lYvFk52m0GertHV6lMyOwYK5V6+xFulR7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:42:24.691807Z","bundle_sha256":"cbafedf562ebafa7345ab2c0d6e4fded01bd863ea240d9707afd675e7b61b21c"}}