{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FQAGOJRX2XASNLFVJ25BDYP5CL","short_pith_number":"pith:FQAGOJRX","schema_version":"1.0","canonical_sha256":"2c00672637d5c126acb54eba11e1fd12ddc87962bd5ec77e93a1691ab8531f06","source":{"kind":"arxiv","id":"2311.06518","version":1},"attestation_state":"computed","paper":{"title":"Minimum Description Length Hopfield Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Emmanuel Chemla, Matan Abudy, Nur Lan, Roni Katzir","submitted_at":"2023-11-11T09:23:54Z","abstract_excerpt":"Associative memory architectures are designed for memorization but also offer, through their retrieval method, a form of generalization to unseen inputs: stored memories can be seen as prototypes from this point of view. Focusing on Modern Hopfield Networks (MHN), we show that a large memorization capacity undermines the generalization opportunity. We offer a solution to better optimize this tradeoff. It relies on Minimum Description Length (MDL) to determine during training which memories to store, as well as how many of them."},"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":"2311.06518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-11T09:23:54Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"133e52c153263a4ab407742a4ec1294d1432bd243af450e5e668aedd36537fc0","abstract_canon_sha256":"4927d22b3d514a8f754f9107b51a36c25e8444f7f1722ddde6820caaf7e34ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:41.303524Z","signature_b64":"kbxcWRu9PKJqyNBjUiEAnuVxcPsrd8LrZ2YndQIPwPcVlJ6Hgwe5lCFIANNxTcpTsePC6mmTGs9vBLdsiRGFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c00672637d5c126acb54eba11e1fd12ddc87962bd5ec77e93a1691ab8531f06","last_reissued_at":"2026-07-05T07:11:41.302901Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:41.302901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Description Length Hopfield Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Emmanuel Chemla, Matan Abudy, Nur Lan, Roni Katzir","submitted_at":"2023-11-11T09:23:54Z","abstract_excerpt":"Associative memory architectures are designed for memorization but also offer, through their retrieval method, a form of generalization to unseen inputs: stored memories can be seen as prototypes from this point of view. Focusing on Modern Hopfield Networks (MHN), we show that a large memorization capacity undermines the generalization opportunity. We offer a solution to better optimize this tradeoff. It relies on Minimum Description Length (MDL) to determine during training which memories to store, as well as how many of them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06518","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.06518/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":"2311.06518","created_at":"2026-07-05T07:11:41.302970+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06518v1","created_at":"2026-07-05T07:11:41.302970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06518","created_at":"2026-07-05T07:11:41.302970+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQAGOJRX2XAS","created_at":"2026-07-05T07:11:41.302970+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQAGOJRX2XASNLFV","created_at":"2026-07-05T07:11:41.302970+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQAGOJRX","created_at":"2026-07-05T07:11:41.302970+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.13398","citing_title":"A Minimum Description Length Approach to Regularization in Neural Networks","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL","json":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL.json","graph_json":"https://pith.science/api/pith-number/FQAGOJRX2XASNLFVJ25BDYP5CL/graph.json","events_json":"https://pith.science/api/pith-number/FQAGOJRX2XASNLFVJ25BDYP5CL/events.json","paper":"https://pith.science/paper/FQAGOJRX"},"agent_actions":{"view_html":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL","download_json":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL.json","view_paper":"https://pith.science/paper/FQAGOJRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06518&json=true","fetch_graph":"https://pith.science/api/pith-number/FQAGOJRX2XASNLFVJ25BDYP5CL/graph.json","fetch_events":"https://pith.science/api/pith-number/FQAGOJRX2XASNLFVJ25BDYP5CL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL/action/storage_attestation","attest_author":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL/action/author_attestation","sign_citation":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL/action/citation_signature","submit_replication":"https://pith.science/pith/FQAGOJRX2XASNLFVJ25BDYP5CL/action/replication_record"}},"created_at":"2026-07-05T07:11:41.302970+00:00","updated_at":"2026-07-05T07:11:41.302970+00:00"}