{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:72QVTI56ZTNBXGELWCO7RUFPXX","short_pith_number":"pith:72QVTI56","schema_version":"1.0","canonical_sha256":"fea159a3beccda1b988bb09df8d0afbdceb76e58d14f1b1b380d59d7139212db","source":{"kind":"arxiv","id":"1702.01929","version":2},"attestation_state":"computed","paper":{"title":"On a model of associative memory with huge storage capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Franck Vermet, Judith Heusel, Matthias L\\\"owe, Mete Demircigil, Sven Upgang","submitted_at":"2017-02-07T09:00:34Z","abstract_excerpt":"In [7] Krotov and Hopfield suggest a generalized version of the well-known Hopfield model of associative memory. In their version they consider a polynomial interaction function and claim that this increases the storage capacity of the model. We prove this claim and take the \"limit\" as the degree of the polynomial becomes infinite, i.e. an exponential interaction function. With this interaction we prove that model has an exponential storage capacity in the number of neurons, yet the basins of attraction are almost as large as in the standard Hopfield model."},"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":"1702.01929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-07T09:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"0529ed2241157fac2e316a96a57f6603b74838a864e61dc0c7e31fdd431f59a0","abstract_canon_sha256":"d6b3ada81d8c78df9ec27ff08639cc46a9d9784abf9cdfcae5592791178a6058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:12.535749Z","signature_b64":"XemmO/gdwilVxqteFl7suXTly+0+izRmYsO9U9NbyXGX2f14awPL5/TlmQFb077r+PLhQ+ZGxVhiIrKm9gIiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea159a3beccda1b988bb09df8d0afbdceb76e58d14f1b1b380d59d7139212db","last_reissued_at":"2026-05-18T00:41:12.534936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:12.534936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a model of associative memory with huge storage capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Franck Vermet, Judith Heusel, Matthias L\\\"owe, Mete Demircigil, Sven Upgang","submitted_at":"2017-02-07T09:00:34Z","abstract_excerpt":"In [7] Krotov and Hopfield suggest a generalized version of the well-known Hopfield model of associative memory. In their version they consider a polynomial interaction function and claim that this increases the storage capacity of the model. We prove this claim and take the \"limit\" as the degree of the polynomial becomes infinite, i.e. an exponential interaction function. With this interaction we prove that model has an exponential storage capacity in the number of neurons, yet the basins of attraction are almost as large as in the standard Hopfield model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01929","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":"1702.01929","created_at":"2026-05-18T00:41:12.535076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01929v2","created_at":"2026-05-18T00:41:12.535076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01929","created_at":"2026-05-18T00:41:12.535076+00:00"},{"alias_kind":"pith_short_12","alias_value":"72QVTI56ZTNB","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"72QVTI56ZTNBXGEL","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"72QVTI56","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.31110","citing_title":"Explaining Machine Learning and Memorization with Statistical Mechanics","ref_index":135,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX","json":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX.json","graph_json":"https://pith.science/api/pith-number/72QVTI56ZTNBXGELWCO7RUFPXX/graph.json","events_json":"https://pith.science/api/pith-number/72QVTI56ZTNBXGELWCO7RUFPXX/events.json","paper":"https://pith.science/paper/72QVTI56"},"agent_actions":{"view_html":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX","download_json":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX.json","view_paper":"https://pith.science/paper/72QVTI56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01929&json=true","fetch_graph":"https://pith.science/api/pith-number/72QVTI56ZTNBXGELWCO7RUFPXX/graph.json","fetch_events":"https://pith.science/api/pith-number/72QVTI56ZTNBXGELWCO7RUFPXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX/action/storage_attestation","attest_author":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX/action/author_attestation","sign_citation":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX/action/citation_signature","submit_replication":"https://pith.science/pith/72QVTI56ZTNBXGELWCO7RUFPXX/action/replication_record"}},"created_at":"2026-05-18T00:41:12.535076+00:00","updated_at":"2026-05-18T00:41:12.535076+00:00"}