{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IQJKMWOLKQ2L4ADBTAFHHJZTX5","short_pith_number":"pith:IQJKMWOL","schema_version":"1.0","canonical_sha256":"4412a659cb5434be0061980a73a733bf4b2588aa57cbeb09c0134d2b9ed41da3","source":{"kind":"arxiv","id":"1308.6021","version":1},"attestation_state":"computed","paper":{"title":"Selective Decoding in Associative Memories Based on Sparse-Clustered Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hooman Jarollahi, Naoya Onizawa, Warren J. Gross","submitted_at":"2013-08-28T00:37:56Z","abstract_excerpt":"Associative memories are structures that can retrieve previously stored information given a partial input pattern instead of an explicit address as in indexed memories. A few hardware approaches have recently been introduced for a new family of associative memories based on Sparse-Clustered Networks (SCN) that show attractive features. These architectures are suitable for implementations with low retrieval latency, but are limited to small networks that store a few hundred data entries. In this paper, a new hardware architecture of SCNs is proposed that features a new data-storage technique as"},"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":"1308.6021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-08-28T00:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"4a00fa2665852a8881d40167b9419c9823bae6827d5bec989657f11dd28bf6be","abstract_canon_sha256":"d106fa2b22c4e1a963debffb110f0b734f3b9c341ad26bd396adc529c65a893a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.827797Z","signature_b64":"ykyFUmA5HMfIwg5rQdZH/4fBWwPsTW4Ui4cJzjdjc8Cf/2BXsd4qzTQLuWFc34mSZwVxX0mNDUcLeUzlpk4uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4412a659cb5434be0061980a73a733bf4b2588aa57cbeb09c0134d2b9ed41da3","last_reissued_at":"2026-05-18T00:59:03.827352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.827352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selective Decoding in Associative Memories Based on Sparse-Clustered Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hooman Jarollahi, Naoya Onizawa, Warren J. Gross","submitted_at":"2013-08-28T00:37:56Z","abstract_excerpt":"Associative memories are structures that can retrieve previously stored information given a partial input pattern instead of an explicit address as in indexed memories. A few hardware approaches have recently been introduced for a new family of associative memories based on Sparse-Clustered Networks (SCN) that show attractive features. These architectures are suitable for implementations with low retrieval latency, but are limited to small networks that store a few hundred data entries. In this paper, a new hardware architecture of SCNs is proposed that features a new data-storage technique as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6021","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":"1308.6021","created_at":"2026-05-18T00:59:03.827417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6021v1","created_at":"2026-05-18T00:59:03.827417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6021","created_at":"2026-05-18T00:59:03.827417+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQJKMWOLKQ2L","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQJKMWOLKQ2L4ADB","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQJKMWOL","created_at":"2026-05-18T12:27:46.883200+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/IQJKMWOLKQ2L4ADBTAFHHJZTX5","json":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5.json","graph_json":"https://pith.science/api/pith-number/IQJKMWOLKQ2L4ADBTAFHHJZTX5/graph.json","events_json":"https://pith.science/api/pith-number/IQJKMWOLKQ2L4ADBTAFHHJZTX5/events.json","paper":"https://pith.science/paper/IQJKMWOL"},"agent_actions":{"view_html":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5","download_json":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5.json","view_paper":"https://pith.science/paper/IQJKMWOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6021&json=true","fetch_graph":"https://pith.science/api/pith-number/IQJKMWOLKQ2L4ADBTAFHHJZTX5/graph.json","fetch_events":"https://pith.science/api/pith-number/IQJKMWOLKQ2L4ADBTAFHHJZTX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/action/storage_attestation","attest_author":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/action/author_attestation","sign_citation":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/action/citation_signature","submit_replication":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/action/replication_record"}},"created_at":"2026-05-18T00:59:03.827417+00:00","updated_at":"2026-05-18T00:59:03.827417+00:00"}