{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IQJKMWOLKQ2L4ADBTAFHHJZTX5","short_pith_number":"pith:IQJKMWOL","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"},"canonical_sha256":"4412a659cb5434be0061980a73a733bf4b2588aa57cbeb09c0134d2b9ed41da3","source":{"kind":"arxiv","id":"1308.6021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6021","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6021v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6021","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"IQJKMWOLKQ2L","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IQJKMWOLKQ2L4ADB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IQJKMWOL","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IQJKMWOLKQ2L4ADBTAFHHJZTX5","target":"record","payload":{"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"},"canonical_sha256":"4412a659cb5434be0061980a73a733bf4b2588aa57cbeb09c0134d2b9ed41da3","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"},"source_kind":"arxiv","source_id":"1308.6021","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TblFCURH6Hged8+U76w9umD6YKRU5toB7TbcDWvsuZPMkDyAxHJc+s5kdDtkveBOoj/hrXCxG53pYHigttbcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:24:18.581176Z"},"content_sha256":"3f5de66a5c7554507c68afe0ade25a8cc7f615dc7c865af1b2ac984816566be8","schema_version":"1.0","event_id":"sha256:3f5de66a5c7554507c68afe0ade25a8cc7f615dc7c865af1b2ac984816566be8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IQJKMWOLKQ2L4ADBTAFHHJZTX5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZPn+uxbGu89LtpuBLM8TXyzqNKW656/bvxwYHIQjwc4CL/5jz1X2brGXqbv/gJnVraMRQ6IrT3kXNavhPkrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:24:18.581815Z"},"content_sha256":"8771b0b5c6ea9c5afdd5508e3273c07c6d843c812187293374633f502ad740ee","schema_version":"1.0","event_id":"sha256:8771b0b5c6ea9c5afdd5508e3273c07c6d843c812187293374633f502ad740ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/bundle.json","state_url":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T13:24:18Z","links":{"resolver":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5","bundle":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/bundle.json","state":"https://pith.science/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQJKMWOLKQ2L4ADBTAFHHJZTX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IQJKMWOLKQ2L4ADBTAFHHJZTX5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d106fa2b22c4e1a963debffb110f0b734f3b9c341ad26bd396adc529c65a893a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-08-28T00:37:56Z","title_canon_sha256":"4a00fa2665852a8881d40167b9419c9823bae6827d5bec989657f11dd28bf6be"},"schema_version":"1.0","source":{"id":"1308.6021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6021","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6021v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6021","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"IQJKMWOLKQ2L","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IQJKMWOLKQ2L4ADB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IQJKMWOL","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:8771b0b5c6ea9c5afdd5508e3273c07c6d843c812187293374633f502ad740ee","target":"graph","created_at":"2026-05-18T00:59:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hooman Jarollahi, Naoya Onizawa, Warren J. Gross","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-08-28T00:37:56Z","title":"Selective Decoding in Associative Memories Based on Sparse-Clustered Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6021","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3f5de66a5c7554507c68afe0ade25a8cc7f615dc7c865af1b2ac984816566be8","target":"record","created_at":"2026-05-18T00:59:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d106fa2b22c4e1a963debffb110f0b734f3b9c341ad26bd396adc529c65a893a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-08-28T00:37:56Z","title_canon_sha256":"4a00fa2665852a8881d40167b9419c9823bae6827d5bec989657f11dd28bf6be"},"schema_version":"1.0","source":{"id":"1308.6021","kind":"arxiv","version":1}},"canonical_sha256":"4412a659cb5434be0061980a73a733bf4b2588aa57cbeb09c0134d2b9ed41da3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4412a659cb5434be0061980a73a733bf4b2588aa57cbeb09c0134d2b9ed41da3","first_computed_at":"2026-05-18T00:59:03.827352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.827352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ykyFUmA5HMfIwg5rQdZH/4fBWwPsTW4Ui4cJzjdjc8Cf/2BXsd4qzTQLuWFc34mSZwVxX0mNDUcLeUzlpk4uAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.827797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f5de66a5c7554507c68afe0ade25a8cc7f615dc7c865af1b2ac984816566be8","sha256:8771b0b5c6ea9c5afdd5508e3273c07c6d843c812187293374633f502ad740ee"],"state_sha256":"4ef61c3af2bdcdf24515de5d272a9d90fc379bcb99ac9c75fba566aba49ba8a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLyyuhhIeCyEnHCRh21m0MaloPZUGMCXW12BjBxWHhtPauRMTh3bEpPZYJBFVgtaLOERSmWKbKWL+Csthjh4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:24:18.585488Z","bundle_sha256":"b1b4bcc882bf455672f9db7988acd569cc43e622bde782b6d21fe77e8a69ac4d"}}