{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AG2IMIXGSHWGWEAH3MDKEFTXEC","short_pith_number":"pith:AG2IMIXG","canonical_record":{"source":{"id":"1102.2936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T00:20:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db848187782503266a809bf4dfcabc4b25d39503d090b743a741b2f36c6739da","abstract_canon_sha256":"d2df12b6ee5d3415e723b7505017a8d50dd1de907ca1c97cc1089f0aeaefd210"},"schema_version":"1.0"},"canonical_sha256":"01b48622e691ec6b1007db06a2167720b9a099749b0ead704433e7c6a569ee02","source":{"kind":"arxiv","id":"1102.2936","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2936","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2936v3","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2936","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"AG2IMIXGSHWG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AG2IMIXGSHWGWEAH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AG2IMIXG","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AG2IMIXGSHWGWEAH3MDKEFTXEC","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T00:20:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db848187782503266a809bf4dfcabc4b25d39503d090b743a741b2f36c6739da","abstract_canon_sha256":"d2df12b6ee5d3415e723b7505017a8d50dd1de907ca1c97cc1089f0aeaefd210"},"schema_version":"1.0"},"canonical_sha256":"01b48622e691ec6b1007db06a2167720b9a099749b0ead704433e7c6a569ee02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.637871Z","signature_b64":"0KeERdByHpSFlZzVuzWAusjxU+HcO1d8RseaohGpL5LtP76WNkeTAW2/l7yT+zO01RPTCmGoPXkQylRPpoBABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b48622e691ec6b1007db06a2167720b9a099749b0ead704433e7c6a569ee02","last_reissued_at":"2026-05-18T00:58:43.637201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.637201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2936","source_version":3,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLLsCIAvBW+tPTJWGrO7mWBPGB0fFoRwodujIKj1uAxu6BTQlUCZvAEr0voERi84i7eAqZEhnSOSWscVstSMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:00.176072Z"},"content_sha256":"cd3648d8eda05abce7c2ab57fb47d054c0f816a4e4848424969ebe588f2bab90","schema_version":"1.0","event_id":"sha256:cd3648d8eda05abce7c2ab57fb47d054c0f816a4e4848424969ebe588f2bab90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AG2IMIXGSHWGWEAH3MDKEFTXEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding by Embedding: Correct Decoding Radius and DMT Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Damien Stehle, Laura Luzzi","submitted_at":"2011-02-15T00:20:12Z","abstract_excerpt":"The closest vector problem (CVP) and shortest (nonzero) vector problem (SVP) are the core algorithmic problems on Euclidean lattices. They are central to the applications of lattices in many problems of communications and cryptography. Kannan's \\emph{embedding technique} is a powerful technique for solving the approximate CVP, yet its remarkable practical performance is not well understood. In this paper, the embedding technique is analyzed from a \\emph{bounded distance decoding} (BDD) viewpoint. We present two complementary analyses of the embedding technique: We establish a reduction from BD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2936","kind":"arxiv","version":3},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ajKzOKgrQWQArP2AD+e0OICY+sx0AFFpE8rR8keIVtVpyVWlfumNehmJUEVw67MKq1wd3VZNhb8FYJc4ddnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:00.176707Z"},"content_sha256":"699b429bdfe5677408bbc0c744bc7e5bc24e63a9b51d94ccb88ec8c11a214bb3","schema_version":"1.0","event_id":"sha256:699b429bdfe5677408bbc0c744bc7e5bc24e63a9b51d94ccb88ec8c11a214bb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC/bundle.json","state_url":"https://pith.science/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC/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-05-27T03:17:00Z","links":{"resolver":"https://pith.science/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC","bundle":"https://pith.science/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC/bundle.json","state":"https://pith.science/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AG2IMIXGSHWGWEAH3MDKEFTXEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AG2IMIXGSHWGWEAH3MDKEFTXEC","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":"d2df12b6ee5d3415e723b7505017a8d50dd1de907ca1c97cc1089f0aeaefd210","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T00:20:12Z","title_canon_sha256":"db848187782503266a809bf4dfcabc4b25d39503d090b743a741b2f36c6739da"},"schema_version":"1.0","source":{"id":"1102.2936","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2936","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2936v3","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2936","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"AG2IMIXGSHWG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AG2IMIXGSHWGWEAH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AG2IMIXG","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:699b429bdfe5677408bbc0c744bc7e5bc24e63a9b51d94ccb88ec8c11a214bb3","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"The closest vector problem (CVP) and shortest (nonzero) vector problem (SVP) are the core algorithmic problems on Euclidean lattices. They are central to the applications of lattices in many problems of communications and cryptography. Kannan's \\emph{embedding technique} is a powerful technique for solving the approximate CVP, yet its remarkable practical performance is not well understood. In this paper, the embedding technique is analyzed from a \\emph{bounded distance decoding} (BDD) viewpoint. We present two complementary analyses of the embedding technique: We establish a reduction from BD","authors_text":"Cong Ling, Damien Stehle, Laura Luzzi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T00:20:12Z","title":"Decoding by Embedding: Correct Decoding Radius and DMT Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2936","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:cd3648d8eda05abce7c2ab57fb47d054c0f816a4e4848424969ebe588f2bab90","target":"record","created_at":"2026-05-18T00:58:43Z","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":"d2df12b6ee5d3415e723b7505017a8d50dd1de907ca1c97cc1089f0aeaefd210","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T00:20:12Z","title_canon_sha256":"db848187782503266a809bf4dfcabc4b25d39503d090b743a741b2f36c6739da"},"schema_version":"1.0","source":{"id":"1102.2936","kind":"arxiv","version":3}},"canonical_sha256":"01b48622e691ec6b1007db06a2167720b9a099749b0ead704433e7c6a569ee02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01b48622e691ec6b1007db06a2167720b9a099749b0ead704433e7c6a569ee02","first_computed_at":"2026-05-18T00:58:43.637201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.637201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0KeERdByHpSFlZzVuzWAusjxU+HcO1d8RseaohGpL5LtP76WNkeTAW2/l7yT+zO01RPTCmGoPXkQylRPpoBABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.637871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2936","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd3648d8eda05abce7c2ab57fb47d054c0f816a4e4848424969ebe588f2bab90","sha256:699b429bdfe5677408bbc0c744bc7e5bc24e63a9b51d94ccb88ec8c11a214bb3"],"state_sha256":"ce801ec7db9ddd8b0d68bcc0ff74317987cbb4dd7b0b0ff2bd690036e67b2de3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTtFlOOk4TW2Kj2F3Rp4aRIyVdqnostzVeyWS87nbsAabS3wd4onuTbO8iFHqNbaHbO5WoLUsACYsOraBId2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:17:00.180066Z","bundle_sha256":"117aa770b7e3c272c1d74ddd9a569d209a7d8c5492010b2f5ea61e899ddd2881"}}