{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HM3IX5EOQUNNVAXRL2LHWC4KEI","short_pith_number":"pith:HM3IX5EO","schema_version":"1.0","canonical_sha256":"3b368bf48e851ada82f15e967b0b8a2201015c58aac84631a32da00f1b98a151","source":{"kind":"arxiv","id":"1704.02673","version":2},"attestation_state":"computed","paper":{"title":"Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Zheng Wang","submitted_at":"2017-04-09T23:42:33Z","abstract_excerpt":"Sampling from the lattice Gaussian distribution plays an important role in various research fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is advanced in several fronts. Firstly, the spectral gap for the independent Metropolis-Hastings-Klein (MHK) algorithm is derived, which is then extended to Peikert's algorithm and rejection sampling; we show that independent MHK exhibits faster convergence. Then, the performance of bounded distance decoding using MCMC is analyzed, revealing a flexible trade-off between the decoding radius and complexity. MCMC is further"},"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":"1704.02673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-09T23:42:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8d37a981fee3ccb98f0fedd284bf17d77eb51da392fc4e4ef574db38cc14ede","abstract_canon_sha256":"a1416bce88f5ae5e960b216f0d718a7e7652dbf6910421f9be902aff2481ff26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:36.685662Z","signature_b64":"DSL1rmeZt7G3JeWyjc5E0TMbzSbXDSZPfRsPELQozh1RodJO+BZNjK2AqJNMhPMgRc/tjqvY/ymwfpGZ+KBGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b368bf48e851ada82f15e967b0b8a2201015c58aac84631a32da00f1b98a151","last_reissued_at":"2026-05-18T00:09:36.685210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:36.685210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Zheng Wang","submitted_at":"2017-04-09T23:42:33Z","abstract_excerpt":"Sampling from the lattice Gaussian distribution plays an important role in various research fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is advanced in several fronts. Firstly, the spectral gap for the independent Metropolis-Hastings-Klein (MHK) algorithm is derived, which is then extended to Peikert's algorithm and rejection sampling; we show that independent MHK exhibits faster convergence. Then, the performance of bounded distance decoding using MCMC is analyzed, revealing a flexible trade-off between the decoding radius and complexity. MCMC is further"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02673","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":"1704.02673","created_at":"2026-05-18T00:09:36.685283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02673v2","created_at":"2026-05-18T00:09:36.685283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02673","created_at":"2026-05-18T00:09:36.685283+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM3IX5EOQUNN","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM3IX5EOQUNNVAXR","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM3IX5EO","created_at":"2026-05-18T12:31:18.294218+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/HM3IX5EOQUNNVAXRL2LHWC4KEI","json":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI.json","graph_json":"https://pith.science/api/pith-number/HM3IX5EOQUNNVAXRL2LHWC4KEI/graph.json","events_json":"https://pith.science/api/pith-number/HM3IX5EOQUNNVAXRL2LHWC4KEI/events.json","paper":"https://pith.science/paper/HM3IX5EO"},"agent_actions":{"view_html":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI","download_json":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI.json","view_paper":"https://pith.science/paper/HM3IX5EO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02673&json=true","fetch_graph":"https://pith.science/api/pith-number/HM3IX5EOQUNNVAXRL2LHWC4KEI/graph.json","fetch_events":"https://pith.science/api/pith-number/HM3IX5EOQUNNVAXRL2LHWC4KEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI/action/storage_attestation","attest_author":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI/action/author_attestation","sign_citation":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI/action/citation_signature","submit_replication":"https://pith.science/pith/HM3IX5EOQUNNVAXRL2LHWC4KEI/action/replication_record"}},"created_at":"2026-05-18T00:09:36.685283+00:00","updated_at":"2026-05-18T00:09:36.685283+00:00"}