{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:I5THSR5XHNMZL5WJLPCS66KQ33","short_pith_number":"pith:I5THSR5X","canonical_record":{"source":{"id":"1003.0064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-27T06:33:42Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"21499f71146abd028593326ddb2a99742a9f23a0dc6418eeb2ce3af0479cb99c","abstract_canon_sha256":"3e5cb5f81571270235b2185bbd8d9b546d58e1e1b331f8ed9ba27daaaae18729"},"schema_version":"1.0"},"canonical_sha256":"47667947b73b5995f6c95bc52f7950ded032ecbd9e01c3bd3ceec2efb61860e6","source":{"kind":"arxiv","id":"1003.0064","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0064","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0064v2","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0064","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"I5THSR5XHNMZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"I5THSR5XHNMZL5WJ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"I5THSR5X","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:I5THSR5XHNMZL5WJLPCS66KQ33","target":"record","payload":{"canonical_record":{"source":{"id":"1003.0064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-27T06:33:42Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"21499f71146abd028593326ddb2a99742a9f23a0dc6418eeb2ce3af0479cb99c","abstract_canon_sha256":"3e5cb5f81571270235b2185bbd8d9b546d58e1e1b331f8ed9ba27daaaae18729"},"schema_version":"1.0"},"canonical_sha256":"47667947b73b5995f6c95bc52f7950ded032ecbd9e01c3bd3ceec2efb61860e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.693835Z","signature_b64":"ScBV6nZp5qRup+3pdpojd+nAGsG27fGTJLYCKO72i5814hZlVBQVTWuWWIAhR2GbwjCex3bQ0FTvODe6p+qZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47667947b73b5995f6c95bc52f7950ded032ecbd9e01c3bd3ceec2efb61860e6","last_reissued_at":"2026-05-18T00:58:47.693261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.693261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.0064","source_version":2,"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:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvP1nSLWuJG8mQ8ZbBHqmmR7iL8YoLWgBrj3OXDSFmq7DdD6HZeGtuqrq0IRr6BVy/lHwUwSRcgweXrJ9fs5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:31:55.504755Z"},"content_sha256":"206967d220eeda09601728554d75603ed36b95602bd2b90c5eb8b7ffb55919f3","schema_version":"1.0","event_id":"sha256:206967d220eeda09601728554d75603ed36b95602bd2b90c5eb8b7ffb55919f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:I5THSR5XHNMZL5WJLPCS66KQ33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Damien Stehl\\'e, Shuiyin Liu","submitted_at":"2010-02-27T06:33:42Z","abstract_excerpt":"Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performance, this paper presents randomized lattice decoding based on Klein's sampling technique, which is a randomized version of Babai's nearest plane algorithm (i.e., successive interference cancelation (SIC)). To find the closest lattice point, Klein's algorithm is used to sample some lattice points and the closest among those samples is chosen. Lattice reduction increases the probability of finding the closest lattice po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0064","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"},"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:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlyYZrJm+uGcqMm6TBXBITRH7lpwlUMe8jskV8DOo1eQ8W/kss3vhnrxB8VsjfQcsD6Z6tmkTlXzwiLY7LIaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:31:55.505416Z"},"content_sha256":"4ba029ef831e9f664c6bc2430bd74fdef832df6237f2992be538de27af4b6851","schema_version":"1.0","event_id":"sha256:4ba029ef831e9f664c6bc2430bd74fdef832df6237f2992be538de27af4b6851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5THSR5XHNMZL5WJLPCS66KQ33/bundle.json","state_url":"https://pith.science/pith/I5THSR5XHNMZL5WJLPCS66KQ33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5THSR5XHNMZL5WJLPCS66KQ33/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-05T23:31:55Z","links":{"resolver":"https://pith.science/pith/I5THSR5XHNMZL5WJLPCS66KQ33","bundle":"https://pith.science/pith/I5THSR5XHNMZL5WJLPCS66KQ33/bundle.json","state":"https://pith.science/pith/I5THSR5XHNMZL5WJLPCS66KQ33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5THSR5XHNMZL5WJLPCS66KQ33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:I5THSR5XHNMZL5WJLPCS66KQ33","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":"3e5cb5f81571270235b2185bbd8d9b546d58e1e1b331f8ed9ba27daaaae18729","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-27T06:33:42Z","title_canon_sha256":"21499f71146abd028593326ddb2a99742a9f23a0dc6418eeb2ce3af0479cb99c"},"schema_version":"1.0","source":{"id":"1003.0064","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0064","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0064v2","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0064","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"I5THSR5XHNMZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"I5THSR5XHNMZL5WJ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"I5THSR5X","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:4ba029ef831e9f664c6bc2430bd74fdef832df6237f2992be538de27af4b6851","target":"graph","created_at":"2026-05-18T00:58:47Z","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":"Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performance, this paper presents randomized lattice decoding based on Klein's sampling technique, which is a randomized version of Babai's nearest plane algorithm (i.e., successive interference cancelation (SIC)). To find the closest lattice point, Klein's algorithm is used to sample some lattice points and the closest among those samples is chosen. Lattice reduction increases the probability of finding the closest lattice po","authors_text":"Cong Ling, Damien Stehl\\'e, Shuiyin Liu","cross_cats":["math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-27T06:33:42Z","title":"Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0064","kind":"arxiv","version":2},"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:206967d220eeda09601728554d75603ed36b95602bd2b90c5eb8b7ffb55919f3","target":"record","created_at":"2026-05-18T00:58:47Z","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":"3e5cb5f81571270235b2185bbd8d9b546d58e1e1b331f8ed9ba27daaaae18729","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-27T06:33:42Z","title_canon_sha256":"21499f71146abd028593326ddb2a99742a9f23a0dc6418eeb2ce3af0479cb99c"},"schema_version":"1.0","source":{"id":"1003.0064","kind":"arxiv","version":2}},"canonical_sha256":"47667947b73b5995f6c95bc52f7950ded032ecbd9e01c3bd3ceec2efb61860e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47667947b73b5995f6c95bc52f7950ded032ecbd9e01c3bd3ceec2efb61860e6","first_computed_at":"2026-05-18T00:58:47.693261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:47.693261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ScBV6nZp5qRup+3pdpojd+nAGsG27fGTJLYCKO72i5814hZlVBQVTWuWWIAhR2GbwjCex3bQ0FTvODe6p+qZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:47.693835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.0064","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:206967d220eeda09601728554d75603ed36b95602bd2b90c5eb8b7ffb55919f3","sha256:4ba029ef831e9f664c6bc2430bd74fdef832df6237f2992be538de27af4b6851"],"state_sha256":"aa078249c669ee81face8cace534662f047ed892db0fb3a6d5055eec3edb6120"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+0U8/KIi1Au8hfHzApWBxqmK1R4QdR4+C0hfcF1ouYem86iK6RqiMEhtGds22OUx9nnnthHg1eUxpMoUvr0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:31:55.508800Z","bundle_sha256":"b504261a47b2abced4afba881ad26a819e8cafeac757190c51831ed99288d045"}}