{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QDWLRJOKRHIDJZTTSFPQX4OGMJ","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":"b386f52263f08ce1f2b7cff81a819c1ea3c0dd0c27f058f813ba6574a397e801","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T15:29:24Z","title_canon_sha256":"033d8e5fe61c037b08ad38c3d935fd8d316609bd075fc780919ecef58646d9a8"},"schema_version":"1.0","source":{"id":"1707.08496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08496","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08496v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08496","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"QDWLRJOKRHID","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QDWLRJOKRHIDJZTT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QDWLRJOK","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:bc29fc73e9644190b139314e9ee8c6717db76f80e1d4a2e814c743588e57cf52","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the $\\mathcal{LOCAL}$ or $\\mathcal{CONGEST}$ models. We amend this by obtaining almost optimal algorithms for Max-Cut on a wide class of graphs in these models. In particular, for any $\\epsilon > 0$, we develop randomized approximation algorithms achieving a ratio of $(1-\\epsilon)$ to the optimum for Max-Cut on b","authors_text":"Hadas Shachnai, Keren Censor-Hillel, Rina Levy","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T15:29:24Z","title":"Fast Distributed Approximation for Max-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08496","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:676ed8b6a4996e35bc615956a6d34dee656c2993c172c76ac6b96b3853105163","target":"record","created_at":"2026-05-18T00:39:24Z","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":"b386f52263f08ce1f2b7cff81a819c1ea3c0dd0c27f058f813ba6574a397e801","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T15:29:24Z","title_canon_sha256":"033d8e5fe61c037b08ad38c3d935fd8d316609bd075fc780919ecef58646d9a8"},"schema_version":"1.0","source":{"id":"1707.08496","kind":"arxiv","version":1}},"canonical_sha256":"80ecb8a5ca89d034e673915f0bf1c66260acdc0940f1e6d19822add5f934126f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80ecb8a5ca89d034e673915f0bf1c66260acdc0940f1e6d19822add5f934126f","first_computed_at":"2026-05-18T00:39:24.061454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.061454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"faoOqcZ6hHBf2xtM8NbOd6vCH/EVijM+f2t5HJreIvjaByEPK+2Oni8vfR/ei2vCwI08gow3Ch4FW5SgJ5yIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.062017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:676ed8b6a4996e35bc615956a6d34dee656c2993c172c76ac6b96b3853105163","sha256:bc29fc73e9644190b139314e9ee8c6717db76f80e1d4a2e814c743588e57cf52"],"state_sha256":"b4ae2f7e541e6fffc36d2f8085dd200782bf3cb63631efe16d5735f7958cbf8b"}