{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M3YMLKQY4KTFZNXBXGAHHGAH7R","short_pith_number":"pith:M3YMLKQY","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"},"canonical_sha256":"66f0c5aa18e2a65cb6e1b980739807fc64e9b1b09a2de06fc3205a01557bf555","source":{"kind":"arxiv","id":"1402.0808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0808","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0808v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0808","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"M3YMLKQY4KTF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M3YMLKQY4KTFZNXB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M3YMLKQY","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M3YMLKQY4KTFZNXBXGAHHGAH7R","target":"record","payload":{"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"},"canonical_sha256":"66f0c5aa18e2a65cb6e1b980739807fc64e9b1b09a2de06fc3205a01557bf555","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"},"source_kind":"arxiv","source_id":"1402.0808","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSlBMnU7J6HuNFnxi1J3c5S7uqOaVXhb7awtMVIXSWxpJoS263rEmnOiclp7KnrNPafspqQA8cV9K1LmfIcIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:02:07.346227Z"},"content_sha256":"8269ea4ad4b8f2edf2fc4412ee6c79b6144ae1c6cba8275a952d00fca6119eb2","schema_version":"1.0","event_id":"sha256:8269ea4ad4b8f2edf2fc4412ee6c79b6144ae1c6cba8275a952d00fca6119eb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M3YMLKQY4KTFZNXBXGAHHGAH7R","target":"graph","payload":{"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"},"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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6aI875ZdtqXDF0IENDYy8W4v2YOtIOzqY075NIGHZ5nXhF48Iae8noo4sEIdl+j/otlePDFhHbldBlWy97xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:02:07.346859Z"},"content_sha256":"df5b4ad6eb15ea465b34d44e04b9e46e003951fb9114e637a071d7db36d7fb20","schema_version":"1.0","event_id":"sha256:df5b4ad6eb15ea465b34d44e04b9e46e003951fb9114e637a071d7db36d7fb20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/bundle.json","state_url":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/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-27T15:02:07Z","links":{"resolver":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R","bundle":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/bundle.json","state":"https://pith.science/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3YMLKQY4KTFZNXBXGAHHGAH7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M3YMLKQY4KTFZNXBXGAHHGAH7R","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":"cfc243354a2e461f1b7878fb7bf44f1049526db4728ee465ca58a344f8362e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-02-03T16:23:33Z","title_canon_sha256":"cd778fb10e7b19ae34a5870e939d49d83bfb99b2210571829622764c374907ca"},"schema_version":"1.0","source":{"id":"1402.0808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0808","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0808v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0808","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"M3YMLKQY4KTF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M3YMLKQY4KTFZNXB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M3YMLKQY","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:df5b4ad6eb15ea465b34d44e04b9e46e003951fb9114e637a071d7db36d7fb20","target":"graph","created_at":"2026-05-18T00:57:52Z","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 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 ","authors_text":"Hooman Jarollahi, Naoya Onizawa, Takahiro Hanyu, Warren J. Gross","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-02-03T16:23:33Z","title":"Associative Memories Based on Multiple-Valued Sparse Clustered Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0808","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:8269ea4ad4b8f2edf2fc4412ee6c79b6144ae1c6cba8275a952d00fca6119eb2","target":"record","created_at":"2026-05-18T00:57:52Z","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":"cfc243354a2e461f1b7878fb7bf44f1049526db4728ee465ca58a344f8362e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-02-03T16:23:33Z","title_canon_sha256":"cd778fb10e7b19ae34a5870e939d49d83bfb99b2210571829622764c374907ca"},"schema_version":"1.0","source":{"id":"1402.0808","kind":"arxiv","version":1}},"canonical_sha256":"66f0c5aa18e2a65cb6e1b980739807fc64e9b1b09a2de06fc3205a01557bf555","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66f0c5aa18e2a65cb6e1b980739807fc64e9b1b09a2de06fc3205a01557bf555","first_computed_at":"2026-05-18T00:57:52.259204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.259204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJTnuNE7PmMilAjGtTR0oh2iuT6OcKQW7P/lzbI5OTGGYBp7LzMHzSVGjBSZsFTqq4KGALnVLjsU7Xd278RYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.259847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8269ea4ad4b8f2edf2fc4412ee6c79b6144ae1c6cba8275a952d00fca6119eb2","sha256:df5b4ad6eb15ea465b34d44e04b9e46e003951fb9114e637a071d7db36d7fb20"],"state_sha256":"69a4827887df82f77804c8006f488b7f6ed4eb9cd530301a9429a4c95f1c63d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+xMgIiJydNHRg+VBz0owRU3VJNIkxE+7cB+VNgjMPSZjeKKApH4RV4tccCnvGpLgSZncV23ALX99TZF6QNHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:02:07.350621Z","bundle_sha256":"cd3309fbeb8df4604cb0c64383432a6d6b91c836ccd85581010b2c9b522280b8"}}