{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BYKUX7DBMH4UD2VGSVR76I5D4T","short_pith_number":"pith:BYKUX7DB","schema_version":"1.0","canonical_sha256":"0e154bfc6161f941eaa69563ff23a3e4c7e31b5614260223fd15db28f133b3ce","source":{"kind":"arxiv","id":"2106.10744","version":2},"attestation_state":"computed","paper":{"title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Zadik, Joan Bruna, Min Jae Song","submitted_at":"2021-06-20T20:03:52Z","abstract_excerpt":"We show a simple reduction which demonstrates the cryptographic hardness of learning a single periodic neuron over isotropic Gaussian distributions in the presence of noise. More precisely, our reduction shows that any polynomial-time algorithm (not necessarily gradient-based) for learning such functions under small noise implies a polynomial-time quantum algorithm for solving worst-case lattice problems, whose hardness form the foundation of lattice-based cryptography. Our core hard family of functions, which are well-approximated by one-layer neural networks, take the general form of a univa"},"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":"2106.10744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-20T20:03:52Z","cross_cats_sorted":["cs.CC","math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"90208347d5563d856d6f1c9ab47a48ba17704eeddd0c885d91fd9ace9d4394ab","abstract_canon_sha256":"5ae8bf64c92caa49b63b0d4af8a061251134354ad232cf9824dacfc353a515d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:56.103689Z","signature_b64":"Hl44DtCcPkRCmBFIl3uOCahka3sJOSSn+WT7zVEKVke3XL9cswZYyg0qumENhZJn2OoD2SSaQqzKhZvs4PAkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e154bfc6161f941eaa69563ff23a3e4c7e31b5614260223fd15db28f133b3ce","last_reissued_at":"2026-07-05T03:14:56.103343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:56.103343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Zadik, Joan Bruna, Min Jae Song","submitted_at":"2021-06-20T20:03:52Z","abstract_excerpt":"We show a simple reduction which demonstrates the cryptographic hardness of learning a single periodic neuron over isotropic Gaussian distributions in the presence of noise. More precisely, our reduction shows that any polynomial-time algorithm (not necessarily gradient-based) for learning such functions under small noise implies a polynomial-time quantum algorithm for solving worst-case lattice problems, whose hardness form the foundation of lattice-based cryptography. Our core hard family of functions, which are well-approximated by one-layer neural networks, take the general form of a univa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.10744","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.10744/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.10744","created_at":"2026-07-05T03:14:56.103400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.10744v2","created_at":"2026-07-05T03:14:56.103400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.10744","created_at":"2026-07-05T03:14:56.103400+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYKUX7DBMH4U","created_at":"2026-07-05T03:14:56.103400+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYKUX7DBMH4UD2VG","created_at":"2026-07-05T03:14:56.103400+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYKUX7DB","created_at":"2026-07-05T03:14:56.103400+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/BYKUX7DBMH4UD2VGSVR76I5D4T","json":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T.json","graph_json":"https://pith.science/api/pith-number/BYKUX7DBMH4UD2VGSVR76I5D4T/graph.json","events_json":"https://pith.science/api/pith-number/BYKUX7DBMH4UD2VGSVR76I5D4T/events.json","paper":"https://pith.science/paper/BYKUX7DB"},"agent_actions":{"view_html":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T","download_json":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T.json","view_paper":"https://pith.science/paper/BYKUX7DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.10744&json=true","fetch_graph":"https://pith.science/api/pith-number/BYKUX7DBMH4UD2VGSVR76I5D4T/graph.json","fetch_events":"https://pith.science/api/pith-number/BYKUX7DBMH4UD2VGSVR76I5D4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T/action/storage_attestation","attest_author":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T/action/author_attestation","sign_citation":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T/action/citation_signature","submit_replication":"https://pith.science/pith/BYKUX7DBMH4UD2VGSVR76I5D4T/action/replication_record"}},"created_at":"2026-07-05T03:14:56.103400+00:00","updated_at":"2026-07-05T03:14:56.103400+00:00"}