{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TWTCJLEYD3ACPPYBUPDSSTEANR","short_pith_number":"pith:TWTCJLEY","schema_version":"1.0","canonical_sha256":"9da624ac981ec027bf01a3c7294c806c62cc92e2914633389d84d40d84df269d","source":{"kind":"arxiv","id":"1411.1224","version":1},"attestation_state":"computed","paper":{"title":"On the capacity of a new model of associative memory based on neural cliques","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","submitted_at":"2014-11-05T10:59:09Z","abstract_excerpt":"Based on recent work by Gripon and Berrou, we introduce a new model of an associative memory. We show that this model has an efficiency bounded away from 0 and is therefore significantly more effective than the well known Hopfield model. We prove that the synchronous and asynchronous retrieval dynamics converge and give upper and lower bounds on the memory capacity of the 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":"1411.1224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-05T10:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"c92d5f7445cd71e6933c8c83339944e7d0075d54bb6db1c86d92d39b02fda9c6","abstract_canon_sha256":"6a46fc1eb7bad05cd4c5cc32e90ef3f6c538af42c5bcd5f79d3a500a11061855"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:35.994553Z","signature_b64":"afbSuj64Z5IAVoCgM4wvuwyNypcIjGnfvAun31KreQJYwsjcQ2vnfrAzrnEWBJcPen594e12nwozgKIYUfJoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9da624ac981ec027bf01a3c7294c806c62cc92e2914633389d84d40d84df269d","last_reissued_at":"2026-05-18T02:38:35.993939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:35.993939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the capacity of a new model of associative memory based on neural cliques","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","submitted_at":"2014-11-05T10:59:09Z","abstract_excerpt":"Based on recent work by Gripon and Berrou, we introduce a new model of an associative memory. We show that this model has an efficiency bounded away from 0 and is therefore significantly more effective than the well known Hopfield model. We prove that the synchronous and asynchronous retrieval dynamics converge and give upper and lower bounds on the memory capacity of the model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1224","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":"1411.1224","created_at":"2026-05-18T02:38:35.994030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1224v1","created_at":"2026-05-18T02:38:35.994030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1224","created_at":"2026-05-18T02:38:35.994030+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWTCJLEYD3AC","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWTCJLEYD3ACPPYB","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWTCJLEY","created_at":"2026-05-18T12:28:52.271510+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/TWTCJLEYD3ACPPYBUPDSSTEANR","json":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR.json","graph_json":"https://pith.science/api/pith-number/TWTCJLEYD3ACPPYBUPDSSTEANR/graph.json","events_json":"https://pith.science/api/pith-number/TWTCJLEYD3ACPPYBUPDSSTEANR/events.json","paper":"https://pith.science/paper/TWTCJLEY"},"agent_actions":{"view_html":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR","download_json":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR.json","view_paper":"https://pith.science/paper/TWTCJLEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1224&json=true","fetch_graph":"https://pith.science/api/pith-number/TWTCJLEYD3ACPPYBUPDSSTEANR/graph.json","fetch_events":"https://pith.science/api/pith-number/TWTCJLEYD3ACPPYBUPDSSTEANR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR/action/storage_attestation","attest_author":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR/action/author_attestation","sign_citation":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR/action/citation_signature","submit_replication":"https://pith.science/pith/TWTCJLEYD3ACPPYBUPDSSTEANR/action/replication_record"}},"created_at":"2026-05-18T02:38:35.994030+00:00","updated_at":"2026-05-18T02:38:35.994030+00:00"}