{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WM4N2H4445F6ICYHR6YZ7LUUU6","short_pith_number":"pith:WM4N2H44","schema_version":"1.0","canonical_sha256":"b338dd1f9ce74be40b078fb19fae94a79b133abe73b90a788e04e01db7c991b6","source":{"kind":"arxiv","id":"1412.7979","version":1},"attestation_state":"computed","paper":{"title":"On the Lattice Smoothing Parameter Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chris Peikert, Daniel Dadush, Feng-Hao Liu, Kai-Min Chung","submitted_at":"2014-12-26T19:50:58Z","abstract_excerpt":"The smoothing parameter $\\eta_{\\epsilon}(\\mathcal{L})$ of a Euclidean lattice $\\mathcal{L}$, introduced by Micciancio and Regev (FOCS'04; SICOMP'07), is (informally) the smallest amount of Gaussian noise that \"smooths out\" the discrete structure of $\\mathcal{L}$ (up to error $\\epsilon$). It plays a central role in the best known worst-case/average-case reductions for lattice problems, a wealth of lattice-based cryptographic constructions, and (implicitly) the tightest known transference theorems for fundamental lattice quantities.\n  In this work we initiate a study of the complexity of approxi"},"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":"1412.7979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-26T19:50:58Z","cross_cats_sorted":[],"title_canon_sha256":"00f3e6de47842281f9540db6f3f020bf477f090ce1455be7569b07dc9029e590","abstract_canon_sha256":"abfee4e8e58f1a05eb2e3e163ee31e79d609cd995eb5c6d87b15827dc53b101f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:24.497749Z","signature_b64":"9maQRUQ1ebkmTPsrPsbO9N6cObk5keu3mvrav4G1XoLpX0Mw7naH2E8jNONXKPMD9JgJiA6vHxzbN6JLq7tqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b338dd1f9ce74be40b078fb19fae94a79b133abe73b90a788e04e01db7c991b6","last_reissued_at":"2026-05-18T02:30:24.497255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:24.497255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Lattice Smoothing Parameter Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chris Peikert, Daniel Dadush, Feng-Hao Liu, Kai-Min Chung","submitted_at":"2014-12-26T19:50:58Z","abstract_excerpt":"The smoothing parameter $\\eta_{\\epsilon}(\\mathcal{L})$ of a Euclidean lattice $\\mathcal{L}$, introduced by Micciancio and Regev (FOCS'04; SICOMP'07), is (informally) the smallest amount of Gaussian noise that \"smooths out\" the discrete structure of $\\mathcal{L}$ (up to error $\\epsilon$). It plays a central role in the best known worst-case/average-case reductions for lattice problems, a wealth of lattice-based cryptographic constructions, and (implicitly) the tightest known transference theorems for fundamental lattice quantities.\n  In this work we initiate a study of the complexity of approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7979","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.7979","created_at":"2026-05-18T02:30:24.497326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7979v1","created_at":"2026-05-18T02:30:24.497326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7979","created_at":"2026-05-18T02:30:24.497326+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM4N2H4445F6","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM4N2H4445F6ICYH","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM4N2H44","created_at":"2026-05-18T12:28:54.890064+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/WM4N2H4445F6ICYHR6YZ7LUUU6","json":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6.json","graph_json":"https://pith.science/api/pith-number/WM4N2H4445F6ICYHR6YZ7LUUU6/graph.json","events_json":"https://pith.science/api/pith-number/WM4N2H4445F6ICYHR6YZ7LUUU6/events.json","paper":"https://pith.science/paper/WM4N2H44"},"agent_actions":{"view_html":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6","download_json":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6.json","view_paper":"https://pith.science/paper/WM4N2H44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7979&json=true","fetch_graph":"https://pith.science/api/pith-number/WM4N2H4445F6ICYHR6YZ7LUUU6/graph.json","fetch_events":"https://pith.science/api/pith-number/WM4N2H4445F6ICYHR6YZ7LUUU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6/action/storage_attestation","attest_author":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6/action/author_attestation","sign_citation":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6/action/citation_signature","submit_replication":"https://pith.science/pith/WM4N2H4445F6ICYHR6YZ7LUUU6/action/replication_record"}},"created_at":"2026-05-18T02:30:24.497326+00:00","updated_at":"2026-05-18T02:30:24.497326+00:00"}