{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:32YW3FTUM6BPAHOK4EKCBK462K","short_pith_number":"pith:32YW3FTU","schema_version":"1.0","canonical_sha256":"deb16d96746782f01dcae11420ab9ed2a198da95ebfffdbf3f0e645f69c27e26","source":{"kind":"arxiv","id":"1512.08892","version":3},"attestation_state":"computed","paper":{"title":"A Comparative Study of Sparse Associative Memories","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, Vincent Gripon","submitted_at":"2015-12-30T09:52:57Z","abstract_excerpt":"We study various models of associative memories with sparse information, i.e. a pattern to be stored is a random string of $0$s and $1$s with about $\\log N$ $1$s, only. We compare different synaptic weights, architectures and retrieval mechanisms to shed light on the influence of the various parameters on the storage capacity."},"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":"1512.08892","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-30T09:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"4888436049cfa5e90ce4214a5f70a69dda0e0c34beca120720ebed1f7c9ded3e","abstract_canon_sha256":"2a3bf845f08f2173c959a55d178a4d8c9873c92a919d3dd163e7ee5cd7f35cf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.709261Z","signature_b64":"b5KrfphOzW4SbRpHtLlhymCZqnvK4v9bmH5BE3CXZmFtwBnqF7ElBbn2PU3zhotdCbCUGziYgKH9K9P2tcczBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb16d96746782f01dcae11420ab9ed2a198da95ebfffdbf3f0e645f69c27e26","last_reissued_at":"2026-05-18T01:11:57.708925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.708925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparative Study of Sparse Associative Memories","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, Vincent Gripon","submitted_at":"2015-12-30T09:52:57Z","abstract_excerpt":"We study various models of associative memories with sparse information, i.e. a pattern to be stored is a random string of $0$s and $1$s with about $\\log N$ $1$s, only. We compare different synaptic weights, architectures and retrieval mechanisms to shed light on the influence of the various parameters on the storage capacity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08892","kind":"arxiv","version":3},"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":"1512.08892","created_at":"2026-05-18T01:11:57.708981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08892v3","created_at":"2026-05-18T01:11:57.708981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08892","created_at":"2026-05-18T01:11:57.708981+00:00"},{"alias_kind":"pith_short_12","alias_value":"32YW3FTUM6BP","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"32YW3FTUM6BPAHOK","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"32YW3FTU","created_at":"2026-05-18T12:29:02.477457+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/32YW3FTUM6BPAHOK4EKCBK462K","json":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K.json","graph_json":"https://pith.science/api/pith-number/32YW3FTUM6BPAHOK4EKCBK462K/graph.json","events_json":"https://pith.science/api/pith-number/32YW3FTUM6BPAHOK4EKCBK462K/events.json","paper":"https://pith.science/paper/32YW3FTU"},"agent_actions":{"view_html":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K","download_json":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K.json","view_paper":"https://pith.science/paper/32YW3FTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08892&json=true","fetch_graph":"https://pith.science/api/pith-number/32YW3FTUM6BPAHOK4EKCBK462K/graph.json","fetch_events":"https://pith.science/api/pith-number/32YW3FTUM6BPAHOK4EKCBK462K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K/action/storage_attestation","attest_author":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K/action/author_attestation","sign_citation":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K/action/citation_signature","submit_replication":"https://pith.science/pith/32YW3FTUM6BPAHOK4EKCBK462K/action/replication_record"}},"created_at":"2026-05-18T01:11:57.708981+00:00","updated_at":"2026-05-18T01:11:57.708981+00:00"}