{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2SZD37P32K7MRMOJYIFFUY7T25","short_pith_number":"pith:2SZD37P3","canonical_record":{"source":{"id":"1801.09796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T23:31:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f223e05a39d0ba4da0fca063a8f4b978ee2c8782838a7485aa5bcae1e0876c4d","abstract_canon_sha256":"15333a96c1b3ac7c5d9fdeca6f2f433cc768cb62638925251858b4cf0ee74a9e"},"schema_version":"1.0"},"canonical_sha256":"d4b23dfdfbd2bec8b1c9c20a5a63f3d745200fc5e8eac9053ba49a087af1736e","source":{"kind":"arxiv","id":"1801.09796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09796","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09796v1","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09796","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"2SZD37P32K7M","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SZD37P32K7MRMOJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SZD37P3","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2SZD37P32K7MRMOJYIFFUY7T25","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T23:31:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f223e05a39d0ba4da0fca063a8f4b978ee2c8782838a7485aa5bcae1e0876c4d","abstract_canon_sha256":"15333a96c1b3ac7c5d9fdeca6f2f433cc768cb62638925251858b4cf0ee74a9e"},"schema_version":"1.0"},"canonical_sha256":"d4b23dfdfbd2bec8b1c9c20a5a63f3d745200fc5e8eac9053ba49a087af1736e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:53.788858Z","signature_b64":"XdPznjDUtgm0Zks8FIJRumvpwGB7llDR/Ki7EUQKhJiLCtpJADbs6LqWAdtkp43JK9ftashEfMBU6FTT2pTDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b23dfdfbd2bec8b1c9c20a5a63f3d745200fc5e8eac9053ba49a087af1736e","last_reissued_at":"2026-05-18T00:24:53.788189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:53.788189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09796","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:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn266IKeLqX6sFIjL5UWXGRbj1oQB2VsshFFec842LurvyHD+nYOdU3ViU9Ds1dQ/paUQscYTk5ki0gdFEBwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:23:28.468760Z"},"content_sha256":"3ae44a6d6d91d1179963a18e371f8ce80d7d99c4e4be31010976c2da66d6d9c6","schema_version":"1.0","event_id":"sha256:3ae44a6d6d91d1179963a18e371f8ce80d7d99c4e4be31010976c2da66d6d9c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2SZD37P32K7MRMOJYIFFUY7T25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Efficient Search for an Approximate Closest Lattice Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maiara F. Bollauf, Sueli I. R. Costa, Vinay A. Vaishampayan","submitted_at":"2018-01-29T23:31:36Z","abstract_excerpt":"We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost and (ii) obtain the error probability. The approximate closest lattice point considered here is the one obtained using the nearest-plane (Babai) algorithm. Assuming a triangular special basis for the lattice, we develop communication-efficient protocols for computing the approximate lattice point and determine the communication cost for lattices of dimensio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09796","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:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HX9cLBJaThgd9UXeT045eahn87i+xkIskdTKKHE2RujnX52fD7fUcdENkVrOhv0StUI36jsBX5WM1HsTeCWOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:23:28.469099Z"},"content_sha256":"df39ec1f8987cfbdb624fc4f391cee3c99f3790fb552a3573996b8b19e75dc8c","schema_version":"1.0","event_id":"sha256:df39ec1f8987cfbdb624fc4f391cee3c99f3790fb552a3573996b8b19e75dc8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SZD37P32K7MRMOJYIFFUY7T25/bundle.json","state_url":"https://pith.science/pith/2SZD37P32K7MRMOJYIFFUY7T25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SZD37P32K7MRMOJYIFFUY7T25/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-06-20T18:23:28Z","links":{"resolver":"https://pith.science/pith/2SZD37P32K7MRMOJYIFFUY7T25","bundle":"https://pith.science/pith/2SZD37P32K7MRMOJYIFFUY7T25/bundle.json","state":"https://pith.science/pith/2SZD37P32K7MRMOJYIFFUY7T25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SZD37P32K7MRMOJYIFFUY7T25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2SZD37P32K7MRMOJYIFFUY7T25","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":"15333a96c1b3ac7c5d9fdeca6f2f433cc768cb62638925251858b4cf0ee74a9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T23:31:36Z","title_canon_sha256":"f223e05a39d0ba4da0fca063a8f4b978ee2c8782838a7485aa5bcae1e0876c4d"},"schema_version":"1.0","source":{"id":"1801.09796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09796","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09796v1","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09796","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"2SZD37P32K7M","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SZD37P32K7MRMOJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SZD37P3","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:df39ec1f8987cfbdb624fc4f391cee3c99f3790fb552a3573996b8b19e75dc8c","target":"graph","created_at":"2026-05-18T00:24:53Z","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":"We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost and (ii) obtain the error probability. The approximate closest lattice point considered here is the one obtained using the nearest-plane (Babai) algorithm. Assuming a triangular special basis for the lattice, we develop communication-efficient protocols for computing the approximate lattice point and determine the communication cost for lattices of dimensio","authors_text":"Maiara F. Bollauf, Sueli I. R. Costa, Vinay A. Vaishampayan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T23:31:36Z","title":"Communication-Efficient Search for an Approximate Closest Lattice Point"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09796","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:3ae44a6d6d91d1179963a18e371f8ce80d7d99c4e4be31010976c2da66d6d9c6","target":"record","created_at":"2026-05-18T00:24:53Z","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":"15333a96c1b3ac7c5d9fdeca6f2f433cc768cb62638925251858b4cf0ee74a9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T23:31:36Z","title_canon_sha256":"f223e05a39d0ba4da0fca063a8f4b978ee2c8782838a7485aa5bcae1e0876c4d"},"schema_version":"1.0","source":{"id":"1801.09796","kind":"arxiv","version":1}},"canonical_sha256":"d4b23dfdfbd2bec8b1c9c20a5a63f3d745200fc5e8eac9053ba49a087af1736e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4b23dfdfbd2bec8b1c9c20a5a63f3d745200fc5e8eac9053ba49a087af1736e","first_computed_at":"2026-05-18T00:24:53.788189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:53.788189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XdPznjDUtgm0Zks8FIJRumvpwGB7llDR/Ki7EUQKhJiLCtpJADbs6LqWAdtkp43JK9ftashEfMBU6FTT2pTDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:53.788858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae44a6d6d91d1179963a18e371f8ce80d7d99c4e4be31010976c2da66d6d9c6","sha256:df39ec1f8987cfbdb624fc4f391cee3c99f3790fb552a3573996b8b19e75dc8c"],"state_sha256":"7bfda6feaeca1620b74b0ef8b9fb5828bb0ce1d2d1dc704727bbd275b1137216"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mk9i+3KO+E0sW5B9jH1ZAIz0XjW00i8d+W4NhlLToUlXB4W+oQt47gJSYLGw3iU4JhJyWWzfwZSsNV1fR70ABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:23:28.470937Z","bundle_sha256":"db05042f70e694c34a44fb0896e3fbb2f279b008fb1238ef416cb2269312a8b6"}}