{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QDWLRJOKRHIDJZTTSFPQX4OGMJ","short_pith_number":"pith:QDWLRJOK","schema_version":"1.0","canonical_sha256":"80ecb8a5ca89d034e673915f0bf1c66260acdc0940f1e6d19822add5f934126f","source":{"kind":"arxiv","id":"1707.08496","version":1},"attestation_state":"computed","paper":{"title":"Fast Distributed Approximation for Max-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hadas Shachnai, Keren Censor-Hillel, Rina Levy","submitted_at":"2017-07-26T15:29:24Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.08496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T15:29:24Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"033d8e5fe61c037b08ad38c3d935fd8d316609bd075fc780919ecef58646d9a8","abstract_canon_sha256":"b386f52263f08ce1f2b7cff81a819c1ea3c0dd0c27f058f813ba6574a397e801"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.062017Z","signature_b64":"faoOqcZ6hHBf2xtM8NbOd6vCH/EVijM+f2t5HJreIvjaByEPK+2Oni8vfR/ei2vCwI08gow3Ch4FW5SgJ5yIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80ecb8a5ca89d034e673915f0bf1c66260acdc0940f1e6d19822add5f934126f","last_reissued_at":"2026-05-18T00:39:24.061454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.061454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Distributed Approximation for Max-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hadas Shachnai, Keren Censor-Hillel, Rina Levy","submitted_at":"2017-07-26T15:29:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08496","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.08496","created_at":"2026-05-18T00:39:24.061539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08496v1","created_at":"2026-05-18T00:39:24.061539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08496","created_at":"2026-05-18T00:39:24.061539+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDWLRJOKRHID","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDWLRJOKRHIDJZTT","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDWLRJOK","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ","json":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ.json","graph_json":"https://pith.science/api/pith-number/QDWLRJOKRHIDJZTTSFPQX4OGMJ/graph.json","events_json":"https://pith.science/api/pith-number/QDWLRJOKRHIDJZTTSFPQX4OGMJ/events.json","paper":"https://pith.science/paper/QDWLRJOK"},"agent_actions":{"view_html":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ","download_json":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ.json","view_paper":"https://pith.science/paper/QDWLRJOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08496&json=true","fetch_graph":"https://pith.science/api/pith-number/QDWLRJOKRHIDJZTTSFPQX4OGMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QDWLRJOKRHIDJZTTSFPQX4OGMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ/action/storage_attestation","attest_author":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ/action/author_attestation","sign_citation":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ/action/citation_signature","submit_replication":"https://pith.science/pith/QDWLRJOKRHIDJZTTSFPQX4OGMJ/action/replication_record"}},"created_at":"2026-05-18T00:39:24.061539+00:00","updated_at":"2026-05-18T00:39:24.061539+00:00"}