{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VMWW36ZH237BYCUSFRGDYI5QRE","short_pith_number":"pith:VMWW36ZH","canonical_record":{"source":{"id":"1409.7758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-27T03:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"0d3444a11ffc5f90b8c894173b625e3f4071a3ac73fd86627278819d7d71f5e2","abstract_canon_sha256":"7ed8693e06533d2d5c635f0fcf8b0f2f9da52b194f50e4b0ea51a3565774c447"},"schema_version":"1.0"},"canonical_sha256":"ab2d6dfb27d6fe1c0a922c4c3c23b08915fa4efbf3ec3f66114a39be1edb940c","source":{"kind":"arxiv","id":"1409.7758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7758","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7758v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7758","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"VMWW36ZH237B","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VMWW36ZH237BYCUS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VMWW36ZH","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VMWW36ZH237BYCUSFRGDYI5QRE","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-27T03:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"0d3444a11ffc5f90b8c894173b625e3f4071a3ac73fd86627278819d7d71f5e2","abstract_canon_sha256":"7ed8693e06533d2d5c635f0fcf8b0f2f9da52b194f50e4b0ea51a3565774c447"},"schema_version":"1.0"},"canonical_sha256":"ab2d6dfb27d6fe1c0a922c4c3c23b08915fa4efbf3ec3f66114a39be1edb940c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:40.705142Z","signature_b64":"Fs7TxjmpMtWBjb1clBwZuJ8KHnPv/jIIB5W7yzdH/RbtBeLFn3DBgx4BtEvcx3c9EuBRBt1OzeB9FMndDxhmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2d6dfb27d6fe1c0a922c4c3c23b08915fa4efbf3ec3f66114a39be1edb940c","last_reissued_at":"2026-05-18T02:41:40.704520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:40.704520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7758","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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W04hc6PtLbQyMzjy9lLcNa++F91uguzBz1SYTCnr0oQSKORD+KQuvyM1zBjzMfLP1hnFASZC/D8qw7c4sLpRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:45:02.873616Z"},"content_sha256":"f20e48268af502a495db6d09c9d2465935d1aa15f01fab97a123dd986883a7b7","schema_version":"1.0","event_id":"sha256:f20e48268af502a495db6d09c9d2465935d1aa15f01fab97a123dd986883a7b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VMWW36ZH237BYCUSFRGDYI5QRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combating Corrupt Messages in Sparse Clustered Associative Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Michael Rabbat, Vincent Gripon, Zhe Yao","submitted_at":"2014-09-27T03:34:02Z","abstract_excerpt":"In this paper we analyze and extend the neural network based associative memory proposed by Gripon and Berrou. This associative memory resembles the celebrated Willshaw model with an added partite cluster structure. In the literature, two retrieving schemes have been proposed for the network dynamics, namely sum-of-sum and sum-of-max. They both offer considerably better performance than Willshaw and Hopfield networks, when comparable retrieval scenarios are considered. Former discussions and experiments concentrate on the erasure scenario, where a partial message is used as a probe to the netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7758","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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8FSNdLpvsT9BptYJiZUOCQw3F9AYtc5QBK70c3fPQjuIFHl2Nq0fTMQjjqfx5F16u59wR+JwnzDBY8C11NrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:45:02.874260Z"},"content_sha256":"08df40cab628037be77b2f4d5d7dc9784ec5c7bd912f03bfc70b843b6341582f","schema_version":"1.0","event_id":"sha256:08df40cab628037be77b2f4d5d7dc9784ec5c7bd912f03bfc70b843b6341582f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMWW36ZH237BYCUSFRGDYI5QRE/bundle.json","state_url":"https://pith.science/pith/VMWW36ZH237BYCUSFRGDYI5QRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMWW36ZH237BYCUSFRGDYI5QRE/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-25T09:45:02Z","links":{"resolver":"https://pith.science/pith/VMWW36ZH237BYCUSFRGDYI5QRE","bundle":"https://pith.science/pith/VMWW36ZH237BYCUSFRGDYI5QRE/bundle.json","state":"https://pith.science/pith/VMWW36ZH237BYCUSFRGDYI5QRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMWW36ZH237BYCUSFRGDYI5QRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VMWW36ZH237BYCUSFRGDYI5QRE","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":"7ed8693e06533d2d5c635f0fcf8b0f2f9da52b194f50e4b0ea51a3565774c447","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-27T03:34:02Z","title_canon_sha256":"0d3444a11ffc5f90b8c894173b625e3f4071a3ac73fd86627278819d7d71f5e2"},"schema_version":"1.0","source":{"id":"1409.7758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7758","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7758v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7758","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"VMWW36ZH237B","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VMWW36ZH237BYCUS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VMWW36ZH","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:08df40cab628037be77b2f4d5d7dc9784ec5c7bd912f03bfc70b843b6341582f","target":"graph","created_at":"2026-05-18T02:41:40Z","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":"In this paper we analyze and extend the neural network based associative memory proposed by Gripon and Berrou. This associative memory resembles the celebrated Willshaw model with an added partite cluster structure. In the literature, two retrieving schemes have been proposed for the network dynamics, namely sum-of-sum and sum-of-max. They both offer considerably better performance than Willshaw and Hopfield networks, when comparable retrieval scenarios are considered. Former discussions and experiments concentrate on the erasure scenario, where a partial message is used as a probe to the netw","authors_text":"Michael Rabbat, Vincent Gripon, Zhe Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-27T03:34:02Z","title":"Combating Corrupt Messages in Sparse Clustered Associative Memories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7758","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:f20e48268af502a495db6d09c9d2465935d1aa15f01fab97a123dd986883a7b7","target":"record","created_at":"2026-05-18T02:41:40Z","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":"7ed8693e06533d2d5c635f0fcf8b0f2f9da52b194f50e4b0ea51a3565774c447","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-27T03:34:02Z","title_canon_sha256":"0d3444a11ffc5f90b8c894173b625e3f4071a3ac73fd86627278819d7d71f5e2"},"schema_version":"1.0","source":{"id":"1409.7758","kind":"arxiv","version":1}},"canonical_sha256":"ab2d6dfb27d6fe1c0a922c4c3c23b08915fa4efbf3ec3f66114a39be1edb940c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab2d6dfb27d6fe1c0a922c4c3c23b08915fa4efbf3ec3f66114a39be1edb940c","first_computed_at":"2026-05-18T02:41:40.704520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:40.704520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fs7TxjmpMtWBjb1clBwZuJ8KHnPv/jIIB5W7yzdH/RbtBeLFn3DBgx4BtEvcx3c9EuBRBt1OzeB9FMndDxhmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:40.705142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f20e48268af502a495db6d09c9d2465935d1aa15f01fab97a123dd986883a7b7","sha256:08df40cab628037be77b2f4d5d7dc9784ec5c7bd912f03bfc70b843b6341582f"],"state_sha256":"c867e09898d6d0a7888f11e996a603cb71b1ae83e3de2d53908b5e0bb1c5ad8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePB4KplOUijwxo2UYdAc+XjojEq9i1HkAUXzciuPEVp5wxfMz5PRwWhkcwItzG48SxTQmN++AlrP8dmQty1YBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:45:02.877651Z","bundle_sha256":"de59074fd49533522d2edf5104aac77e072f30144e4d7047a9cfa89a7c5b2c05"}}