{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WSUIWWOHB3PHPYLCZZZK5SEQTV","short_pith_number":"pith:WSUIWWOH","canonical_record":{"source":{"id":"1801.04497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-14T01:50:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7731a469c8e7a05ff7a02083b2041c3d7843b9e95c920f4bff076c9f671e0d7e","abstract_canon_sha256":"1af922e6783158e1890824c7657950a896af03f0b04fa8d2832b0bea5d842115"},"schema_version":"1.0"},"canonical_sha256":"b4a88b59c70ede77e162ce72aec8909d4484dc74c074a8662f86c23b81898fdd","source":{"kind":"arxiv","id":"1801.04497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04497","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04497v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04497","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"WSUIWWOHB3PH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WSUIWWOHB3PHPYLC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WSUIWWOH","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WSUIWWOHB3PHPYLCZZZK5SEQTV","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-14T01:50:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7731a469c8e7a05ff7a02083b2041c3d7843b9e95c920f4bff076c9f671e0d7e","abstract_canon_sha256":"1af922e6783158e1890824c7657950a896af03f0b04fa8d2832b0bea5d842115"},"schema_version":"1.0"},"canonical_sha256":"b4a88b59c70ede77e162ce72aec8909d4484dc74c074a8662f86c23b81898fdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:06.299994Z","signature_b64":"CkdSfKmu5PSxfmMBS+XQqVDdY9j8u0E1YZlSZ5mlc85bAfc7WnEzLnJZpvU9ePlMZ0+eY7cVor5qIySF3hgrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4a88b59c70ede77e162ce72aec8909d4484dc74c074a8662f86c23b81898fdd","last_reissued_at":"2026-05-18T00:26:06.299461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:06.299461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04497","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJZ2oSqKbse6GrkSmf3CKIdN78WBqNTKrODrYs5Ga9OI2GVHyhUDNS/nVR9+0WeO1H64kx4N+vJm0DZuJn8rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:52:53.803051Z"},"content_sha256":"aaeb13e92890531c4d0e540b96c4231938bb2cf03509cd8c0452afb51905fd91","schema_version":"1.0","event_id":"sha256:aaeb13e92890531c4d0e540b96c4231938bb2cf03509cd8c0452afb51905fd91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WSUIWWOHB3PHPYLCZZZK5SEQTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-optimal approximation algorithm for simultaneous Max-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amey Bhangale, Devanathan Thiruvenkatachari, Subhash Khot, Sushant Sachdeva, Swastik Kopparty","submitted_at":"2018-01-14T01:50:32Z","abstract_excerpt":"In the simultaneous Max-Cut problem, we are given $k$ weighted graphs on the same set of $n$ vertices, and the goal is to find a cut of the vertex set so that the minimum, over the $k$ graphs, of the cut value is as large as possible. Previous work [BKS15] gave a polynomial time algorithm which achieved an approximation factor of $1/2 - o(1)$ for this problem (and an approximation factor of $1/2 + \\epsilon_k$ in the unweighted case, where $\\epsilon_k \\rightarrow 0$ as $k \\rightarrow \\infty$).\n  In this work, we give a polynomial time approximation algorithm for simultaneous Max-Cut with an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04497","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8di3AT72ddiHRQANQpFKvX386i0joSEVWkhdQ1PtgI28KVtN0Fn/GtEl2FINi5X6wosnvDUVdEGJAjBX8a0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:52:53.803519Z"},"content_sha256":"01cd7bb74c89f4ed3eb05db24fdea66b5841c63cae4a25bc7fffbda11942cd01","schema_version":"1.0","event_id":"sha256:01cd7bb74c89f4ed3eb05db24fdea66b5841c63cae4a25bc7fffbda11942cd01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV/bundle.json","state_url":"https://pith.science/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV/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-26T21:52:53Z","links":{"resolver":"https://pith.science/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV","bundle":"https://pith.science/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV/bundle.json","state":"https://pith.science/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSUIWWOHB3PHPYLCZZZK5SEQTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WSUIWWOHB3PHPYLCZZZK5SEQTV","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":"1af922e6783158e1890824c7657950a896af03f0b04fa8d2832b0bea5d842115","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-14T01:50:32Z","title_canon_sha256":"7731a469c8e7a05ff7a02083b2041c3d7843b9e95c920f4bff076c9f671e0d7e"},"schema_version":"1.0","source":{"id":"1801.04497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04497","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04497v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04497","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"WSUIWWOHB3PH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WSUIWWOHB3PHPYLC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WSUIWWOH","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:01cd7bb74c89f4ed3eb05db24fdea66b5841c63cae4a25bc7fffbda11942cd01","target":"graph","created_at":"2026-05-18T00:26:06Z","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 the simultaneous Max-Cut problem, we are given $k$ weighted graphs on the same set of $n$ vertices, and the goal is to find a cut of the vertex set so that the minimum, over the $k$ graphs, of the cut value is as large as possible. Previous work [BKS15] gave a polynomial time algorithm which achieved an approximation factor of $1/2 - o(1)$ for this problem (and an approximation factor of $1/2 + \\epsilon_k$ in the unweighted case, where $\\epsilon_k \\rightarrow 0$ as $k \\rightarrow \\infty$).\n  In this work, we give a polynomial time approximation algorithm for simultaneous Max-Cut with an app","authors_text":"Amey Bhangale, Devanathan Thiruvenkatachari, Subhash Khot, Sushant Sachdeva, Swastik Kopparty","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-14T01:50:32Z","title":"Near-optimal approximation algorithm for simultaneous Max-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04497","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:aaeb13e92890531c4d0e540b96c4231938bb2cf03509cd8c0452afb51905fd91","target":"record","created_at":"2026-05-18T00:26:06Z","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":"1af922e6783158e1890824c7657950a896af03f0b04fa8d2832b0bea5d842115","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-14T01:50:32Z","title_canon_sha256":"7731a469c8e7a05ff7a02083b2041c3d7843b9e95c920f4bff076c9f671e0d7e"},"schema_version":"1.0","source":{"id":"1801.04497","kind":"arxiv","version":1}},"canonical_sha256":"b4a88b59c70ede77e162ce72aec8909d4484dc74c074a8662f86c23b81898fdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4a88b59c70ede77e162ce72aec8909d4484dc74c074a8662f86c23b81898fdd","first_computed_at":"2026-05-18T00:26:06.299461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:06.299461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkdSfKmu5PSxfmMBS+XQqVDdY9j8u0E1YZlSZ5mlc85bAfc7WnEzLnJZpvU9ePlMZ0+eY7cVor5qIySF3hgrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:06.299994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaeb13e92890531c4d0e540b96c4231938bb2cf03509cd8c0452afb51905fd91","sha256:01cd7bb74c89f4ed3eb05db24fdea66b5841c63cae4a25bc7fffbda11942cd01"],"state_sha256":"752fa53ac16f0a026ea6035ab18ace9559221d3ddcec5e84933c28a83836a314"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdSr2P4I4WkwjQKmSVnpdSv3ezBaM52A5PPmsUacpX+6hmb1/WU5gGr2pDOAnlUo14/s2KOTQbYp9rqh+bc9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:52:53.806702Z","bundle_sha256":"31fa3303bb2dededd209eb15e2470ac34db08cbe1d9fb5657d20da3001b7138a"}}