{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EQ3L55KTY2I3CXA5I2R5NHKWUF","short_pith_number":"pith:EQ3L55KT","schema_version":"1.0","canonical_sha256":"2436bef553c691b15c1d46a3d69d56a152d4990dd09029f57f94b3172fe23f95","source":{"kind":"arxiv","id":"2410.23126","version":2},"attestation_state":"computed","paper":{"title":"Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Dennis Wu, Han Liu, Jerry Yao-Chieh Hu","submitted_at":"2024-10-30T15:35:51Z","abstract_excerpt":"We study the optimal memorization capacity of modern Hopfield models and Kernelized Hopfield Models (KHMs), a transformer-compatible class of Dense Associative Memories. We present a tight analysis by establishing a connection between the memory configuration of KHMs and spherical codes from information theory. Specifically, we treat the stored memory set as a specialized spherical code. This enables us to cast the memorization problem in KHMs into a point arrangement problem on a hypersphere. We show that the optimal capacity of KHMs occurs when the feature space allows memories to form an op"},"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":"2410.23126","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-30T15:35:51Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"25b6b5beabb5941f411f85aae15d364eedcee40972853fc8d44f4b41043f9ab3","abstract_canon_sha256":"5c8bcdbfc1ce8601ecc01df8cc6e3c84d5882e0a5affe86a391badee05fc56c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:35.379624Z","signature_b64":"KXqK+AbauYN+ATmRaEiPJ3xIrgR0d296boJD4yZkpW6mmnOu3dJAbgHp1hovP2zNytEOsbZgBXKqSt+yNyXCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2436bef553c691b15c1d46a3d69d56a152d4990dd09029f57f94b3172fe23f95","last_reissued_at":"2026-07-05T09:29:35.379135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:35.379135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Dennis Wu, Han Liu, Jerry Yao-Chieh Hu","submitted_at":"2024-10-30T15:35:51Z","abstract_excerpt":"We study the optimal memorization capacity of modern Hopfield models and Kernelized Hopfield Models (KHMs), a transformer-compatible class of Dense Associative Memories. We present a tight analysis by establishing a connection between the memory configuration of KHMs and spherical codes from information theory. Specifically, we treat the stored memory set as a specialized spherical code. This enables us to cast the memorization problem in KHMs into a point arrangement problem on a hypersphere. We show that the optimal capacity of KHMs occurs when the feature space allows memories to form an op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23126","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/2410.23126/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":"2410.23126","created_at":"2026-07-05T09:29:35.379189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23126v2","created_at":"2026-07-05T09:29:35.379189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23126","created_at":"2026-07-05T09:29:35.379189+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQ3L55KTY2I3","created_at":"2026-07-05T09:29:35.379189+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQ3L55KTY2I3CXA5","created_at":"2026-07-05T09:29:35.379189+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQ3L55KT","created_at":"2026-07-05T09:29:35.379189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23735","citing_title":"ATLAS: Learning to Optimally Memorize the Context at Test Time","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF","json":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF.json","graph_json":"https://pith.science/api/pith-number/EQ3L55KTY2I3CXA5I2R5NHKWUF/graph.json","events_json":"https://pith.science/api/pith-number/EQ3L55KTY2I3CXA5I2R5NHKWUF/events.json","paper":"https://pith.science/paper/EQ3L55KT"},"agent_actions":{"view_html":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF","download_json":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF.json","view_paper":"https://pith.science/paper/EQ3L55KT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23126&json=true","fetch_graph":"https://pith.science/api/pith-number/EQ3L55KTY2I3CXA5I2R5NHKWUF/graph.json","fetch_events":"https://pith.science/api/pith-number/EQ3L55KTY2I3CXA5I2R5NHKWUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF/action/storage_attestation","attest_author":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF/action/author_attestation","sign_citation":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF/action/citation_signature","submit_replication":"https://pith.science/pith/EQ3L55KTY2I3CXA5I2R5NHKWUF/action/replication_record"}},"created_at":"2026-07-05T09:29:35.379189+00:00","updated_at":"2026-07-05T09:29:35.379189+00:00"}