{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TAMP35FAMW5MQFQQKSSOGPNGD6","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":"f3fcdd2e31af97eeecddd8d35ea3f4e441d54371b00114ba03fab7cc420ee976","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T17:26:03Z","title_canon_sha256":"8b68f665837992a0618571e93df94cf55e7a8cab45a6c07c29b55b7a9bb04a6f"},"schema_version":"1.0","source":{"id":"1711.04714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04714","created_at":"2026-05-18T00:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04714v3","created_at":"2026-05-18T00:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04714","created_at":"2026-05-18T00:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"TAMP35FAMW5M","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TAMP35FAMW5MQFQQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TAMP35FA","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:c8eef38ba9046f692213e0c269911b90aef31fc63938e38239d8c492ab6fb652","target":"graph","created_at":"2026-05-18T00:20:16Z","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":"Upper bounds on the communication complexity of finding the nearest lattice point in a given lattice $\\Lambda \\subset \\mathbb{R}^2$ was considered in earlier works~\\cite{VB:2017}, for a two party, interactive communication model. Here we derive a lower bound on the communication complexity of a key step in that procedure. Specifically, the problem considered is that of interactively finding $\\min(X_1,X_2)$, when $(X_1,X_2)$ is uniformly distributed on the unit square. A lower bound is derived on the single-shot interactive communication complexity and shown to be tight. This is accomplished by","authors_text":"Vinay A. Vaishampayan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T17:26:03Z","title":"Towards a Converse for the Nearest Lattice Point Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04714","kind":"arxiv","version":3},"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:a60257c47f73e1fb293dced7aabdc693170bba95308e17969fc6ec960f456d08","target":"record","created_at":"2026-05-18T00:20:16Z","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":"f3fcdd2e31af97eeecddd8d35ea3f4e441d54371b00114ba03fab7cc420ee976","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T17:26:03Z","title_canon_sha256":"8b68f665837992a0618571e93df94cf55e7a8cab45a6c07c29b55b7a9bb04a6f"},"schema_version":"1.0","source":{"id":"1711.04714","kind":"arxiv","version":3}},"canonical_sha256":"9818fdf4a065bac8161054a4e33da61f947515ad1d4f6af72cf2c76e7578f85b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9818fdf4a065bac8161054a4e33da61f947515ad1d4f6af72cf2c76e7578f85b","first_computed_at":"2026-05-18T00:20:16.520262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:16.520262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Ce1vvkBEstoJL1p7xidi5Nngkw5tzT780YzbrJsOalAzmmZqDDbGK2CHGqhuO/Zre+iW/Dy2pTbcK2uko2QCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:16.520776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a60257c47f73e1fb293dced7aabdc693170bba95308e17969fc6ec960f456d08","sha256:c8eef38ba9046f692213e0c269911b90aef31fc63938e38239d8c492ab6fb652"],"state_sha256":"250df8292c7f2cff31ec6f2c113a6ef35d98a5279259f5da3150355952f8cdbe"}