{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M3YMLKQY4KTFZNXBXGAHHGAH7R","short_pith_number":"pith:M3YMLKQY","schema_version":"1.0","canonical_sha256":"66f0c5aa18e2a65cb6e1b980739807fc64e9b1b09a2de06fc3205a01557bf555","source":{"kind":"arxiv","id":"1402.0808","version":1},"attestation_state":"computed","paper":{"title":"Associative Memories Based on Multiple-Valued Sparse Clustered Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hooman Jarollahi, Naoya Onizawa, Takahiro Hanyu, Warren J. Gross","submitted_at":"2014-02-03T16:23:33Z","abstract_excerpt":"Associative memories are structures that store data patterns and retrieve them given partial inputs. Sparse Clustered Networks (SCNs) are recently-introduced binary-weighted associative memories that significantly improve the storage and retrieval capabilities over the prior state-of-the art. However, deleting or updating the data patterns result in a significant increase in the data retrieval error probability. In this paper, we propose an algorithm to address this problem by incorporating multiple-valued weights for the interconnections used in the network. The proposed algorithm lowers the "},"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":"1402.0808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-02-03T16:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"cd778fb10e7b19ae34a5870e939d49d83bfb99b2210571829622764c374907ca","abstract_canon_sha256":"cfc243354a2e461f1b7878fb7bf44f1049526db4728ee465ca58a344f8362e31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.259847Z","signature_b64":"XJTnuNE7PmMilAjGtTR0oh2iuT6OcKQW7P/lzbI5OTGGYBp7LzMHzSVGjBSZsFTqq4KGALnVLjsU7Xd278RYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f0c5aa18e2a65cb6e1b980739807fc64e9b1b09a2de06fc3205a01557bf555","last_reissued_at":"2026-05-18T00:57:52.259204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.259204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Associative Memories Based on Multiple-Valued Sparse Clustered Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hooman Jarollahi, Naoya Onizawa, Takahiro Hanyu, Warren J. Gross","submitted_at":"2014-02-03T16:23:33Z","abstract_excerpt":"Associative memories are structures that store data patterns and retrieve them given partial inputs. Sparse Clustered Networks (SCNs) are recently-introduced binary-weighted associative memories that significantly improve the storage and retrieval capabilities over the prior state-of-the art. However, deleting or updating the data patterns result in a significant increase in the data retrieval error probability. In this paper, we propose an algorithm to address this problem by incorporating multiple-valued weights for the interconnections used in the network. The proposed algorithm lowers the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0808","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":"1402.0808","created_at":"2026-05-18T00:57:52.259298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0808v1","created_at":"2026-05-18T00:57:52.259298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0808","created_at":"2026-05-18T00:57:52.259298+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3YMLKQY4KTF","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3YMLKQY4KTFZNXB","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3YMLKQY","created_at":"2026-05-18T12:28:38.356838+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/M3YMLKQY4KTFZNXBXGAHHGAH7R","json":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R.json","graph_json":"https://pith.science/api/pith-number/M3YMLKQY4KTFZNXBXGAHHGAH7R/graph.json","events_json":"https://pith.science/api/pith-number/M3YMLKQY4KTFZNXBXGAHHGAH7R/events.json","paper":"https://pith.science/paper/M3YMLKQY"},"agent_actions":{"view_html":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R","download_json":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R.json","view_paper":"https://pith.science/paper/M3YMLKQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0808&json=true","fetch_graph":"https://pith.science/api/pith-number/M3YMLKQY4KTFZNXBXGAHHGAH7R/graph.json","fetch_events":"https://pith.science/api/pith-number/M3YMLKQY4KTFZNXBXGAHHGAH7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/action/storage_attestation","attest_author":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/action/author_attestation","sign_citation":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/action/citation_signature","submit_replication":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/action/replication_record"}},"created_at":"2026-05-18T00:57:52.259298+00:00","updated_at":"2026-05-18T00:57:52.259298+00:00"}