{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CFEZZASIYD2WLTOWM2VBLOHMRR","short_pith_number":"pith:CFEZZASI","schema_version":"1.0","canonical_sha256":"11499c8248c0f565cdd666aa15b8ec8c4c3fea8e952cc70bf284fec3fe708954","source":{"kind":"arxiv","id":"1704.02019","version":2},"attestation_state":"computed","paper":{"title":"Associative content-addressable networks with exponentially many robust stable states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"q-bio.NC","authors_text":"Ila Fiete, Rishidev Chaudhuri","submitted_at":"2017-04-06T20:46:16Z","abstract_excerpt":"The brain must robustly store a large number of memories, corresponding to the many events encountered over a lifetime. However, the number of memory states in existing neural network models either grows weakly with network size or recall fails catastrophically with vanishingly little noise. We construct an associative content-addressable memory with exponentially many stable states and robust error-correction. The network possesses expander graph connectivity on a restricted Boltzmann machine architecture. The expansion property allows simple neural network dynamics to perform at par with mod"},"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":"1704.02019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-04-06T20:46:16Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"77ceeaf3cfede1a61552d845d63fab68af35b7fd37cf8b918f6b5895801993df","abstract_canon_sha256":"2fd9edf89acd4ba17582f47e9648d02fc46987eef5a4fecb549857f63c61777c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:28.882206Z","signature_b64":"izD96reotbLQ10E9Jx8DdyK6glJt0GGzP3BcKec8rDGvUhk1cc/A6oIocRjjf3ueLXojKxABCRVBBN5PeNFiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11499c8248c0f565cdd666aa15b8ec8c4c3fea8e952cc70bf284fec3fe708954","last_reissued_at":"2026-05-18T00:31:28.881620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:28.881620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Associative content-addressable networks with exponentially many robust stable states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"q-bio.NC","authors_text":"Ila Fiete, Rishidev Chaudhuri","submitted_at":"2017-04-06T20:46:16Z","abstract_excerpt":"The brain must robustly store a large number of memories, corresponding to the many events encountered over a lifetime. However, the number of memory states in existing neural network models either grows weakly with network size or recall fails catastrophically with vanishingly little noise. We construct an associative content-addressable memory with exponentially many stable states and robust error-correction. The network possesses expander graph connectivity on a restricted Boltzmann machine architecture. The expansion property allows simple neural network dynamics to perform at par with mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02019","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":"1704.02019","created_at":"2026-05-18T00:31:28.881727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02019v2","created_at":"2026-05-18T00:31:28.881727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02019","created_at":"2026-05-18T00:31:28.881727+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFEZZASIYD2W","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFEZZASIYD2WLTOW","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFEZZASI","created_at":"2026-05-18T12:31:10.602751+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/CFEZZASIYD2WLTOWM2VBLOHMRR","json":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR.json","graph_json":"https://pith.science/api/pith-number/CFEZZASIYD2WLTOWM2VBLOHMRR/graph.json","events_json":"https://pith.science/api/pith-number/CFEZZASIYD2WLTOWM2VBLOHMRR/events.json","paper":"https://pith.science/paper/CFEZZASI"},"agent_actions":{"view_html":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR","download_json":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR.json","view_paper":"https://pith.science/paper/CFEZZASI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02019&json=true","fetch_graph":"https://pith.science/api/pith-number/CFEZZASIYD2WLTOWM2VBLOHMRR/graph.json","fetch_events":"https://pith.science/api/pith-number/CFEZZASIYD2WLTOWM2VBLOHMRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR/action/storage_attestation","attest_author":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR/action/author_attestation","sign_citation":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR/action/citation_signature","submit_replication":"https://pith.science/pith/CFEZZASIYD2WLTOWM2VBLOHMRR/action/replication_record"}},"created_at":"2026-05-18T00:31:28.881727+00:00","updated_at":"2026-05-18T00:31:28.881727+00:00"}