{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CYO6PXCXNTA73S5Q5FNM7T7DEP","short_pith_number":"pith:CYO6PXCX","schema_version":"1.0","canonical_sha256":"161de7dc576cc1fdcbb0e95acfcfe323d0754fd6b8a6018345f7f735b2d1851f","source":{"kind":"arxiv","id":"1804.02676","version":2},"attestation_state":"computed","paper":{"title":"The Communication Complexity of Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Shahar Dobzinski, Yakov Babichenko","submitted_at":"2018-04-08T11:57:53Z","abstract_excerpt":"We study the following communication variant of local search. There is some fixed, commonly known graph $G$. Alice holds $f_A$ and Bob holds $f_B$, both are functions that specify a value for each vertex. The goal is to find a local maximum of $f_A+f_B$ with respect to $G$, i.e., a vertex $v$ for which $(f_A+f_B)(v)\\geq (f_A+f_B)(u)$ for every neighbor $u$ of $v$.\n  Our main result is that finding a local maximum requires polynomial (in the number of vertices) bits of communication. The result holds for the following families of graphs: three dimensional grids, hypercubes, odd graphs, and degr"},"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":"1804.02676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-04-08T11:57:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"544072ba37b0fb92c39bbb336693fbfb049435b8c5d05bf168215c9e7c71883a","abstract_canon_sha256":"62c1f6833ee102c01729bf2a8600d23afe4059ab8631f14c9d4efa52163e2614"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.177087Z","signature_b64":"hv892g+oG2bZC+m9YlghdChBslNkFAH3aq0Yr40TfEqPsHET8GTyThbjBgBkBmj5kDeHXVbymFjo7XatGRp6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161de7dc576cc1fdcbb0e95acfcfe323d0754fd6b8a6018345f7f735b2d1851f","last_reissued_at":"2026-05-18T00:03:56.176525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.176525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Communication Complexity of Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Shahar Dobzinski, Yakov Babichenko","submitted_at":"2018-04-08T11:57:53Z","abstract_excerpt":"We study the following communication variant of local search. There is some fixed, commonly known graph $G$. Alice holds $f_A$ and Bob holds $f_B$, both are functions that specify a value for each vertex. The goal is to find a local maximum of $f_A+f_B$ with respect to $G$, i.e., a vertex $v$ for which $(f_A+f_B)(v)\\geq (f_A+f_B)(u)$ for every neighbor $u$ of $v$.\n  Our main result is that finding a local maximum requires polynomial (in the number of vertices) bits of communication. The result holds for the following families of graphs: three dimensional grids, hypercubes, odd graphs, and degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02676","kind":"arxiv","version":2},"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":"1804.02676","created_at":"2026-05-18T00:03:56.176634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02676v2","created_at":"2026-05-18T00:03:56.176634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02676","created_at":"2026-05-18T00:03:56.176634+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYO6PXCXNTA7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYO6PXCXNTA73S5Q","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYO6PXCX","created_at":"2026-05-18T12:32:19.392346+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/CYO6PXCXNTA73S5Q5FNM7T7DEP","json":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP.json","graph_json":"https://pith.science/api/pith-number/CYO6PXCXNTA73S5Q5FNM7T7DEP/graph.json","events_json":"https://pith.science/api/pith-number/CYO6PXCXNTA73S5Q5FNM7T7DEP/events.json","paper":"https://pith.science/paper/CYO6PXCX"},"agent_actions":{"view_html":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP","download_json":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP.json","view_paper":"https://pith.science/paper/CYO6PXCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02676&json=true","fetch_graph":"https://pith.science/api/pith-number/CYO6PXCXNTA73S5Q5FNM7T7DEP/graph.json","fetch_events":"https://pith.science/api/pith-number/CYO6PXCXNTA73S5Q5FNM7T7DEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP/action/storage_attestation","attest_author":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP/action/author_attestation","sign_citation":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP/action/citation_signature","submit_replication":"https://pith.science/pith/CYO6PXCXNTA73S5Q5FNM7T7DEP/action/replication_record"}},"created_at":"2026-05-18T00:03:56.176634+00:00","updated_at":"2026-05-18T00:03:56.176634+00:00"}