{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6JONEMAPJ42LPV5VBE3AFMVL5L","short_pith_number":"pith:6JONEMAP","canonical_record":{"source":{"id":"1308.4506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-08-21T08:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"785fd4185fb6b41dcdbbd0f5ecebe673090ce350ff54707f4e7691f5ee3ce288","abstract_canon_sha256":"70e24be96edb25a67cbb74e527dbf8903f37c8c3b526e1eb5f1437635d536ad6"},"schema_version":"1.0"},"canonical_sha256":"f25cd2300f4f34b7d7b5093602b2abeafd38aafc8fee3dfc059a788d49bd1a47","source":{"kind":"arxiv","id":"1308.4506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4506","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4506v1","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4506","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"6JONEMAPJ42L","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6JONEMAPJ42LPV5V","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6JONEMAP","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6JONEMAPJ42LPV5VBE3AFMVL5L","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-08-21T08:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"785fd4185fb6b41dcdbbd0f5ecebe673090ce350ff54707f4e7691f5ee3ce288","abstract_canon_sha256":"70e24be96edb25a67cbb74e527dbf8903f37c8c3b526e1eb5f1437635d536ad6"},"schema_version":"1.0"},"canonical_sha256":"f25cd2300f4f34b7d7b5093602b2abeafd38aafc8fee3dfc059a788d49bd1a47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:21.900622Z","signature_b64":"mvB7L9M8xvkduzt1Onrh7qN9S79YgBnU9eaffVzGHgCyh3npSHnz0VF0Y99BSESK1LaQ1URn8GHeDlnlEqyTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f25cd2300f4f34b7d7b5093602b2abeafd38aafc8fee3dfc059a788d49bd1a47","last_reissued_at":"2026-05-18T03:15:21.899753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:21.899753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4506","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-18T03:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CBjobhXEhfXZXQzsI0kRXYfiT1vI5Wta95YVDEjbGLjMdOGElG7q9Zwjb/HvYBdPtGUS+baXhGdLV/NeXAGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:35:51.960954Z"},"content_sha256":"e4cad250e44038b00c527a32e12dea5ac4e8aaba13eb0983f36c5f5a8e6e5068","schema_version":"1.0","event_id":"sha256:e4cad250e44038b00c527a32e12dea5ac4e8aaba13eb0983f36c5f5a8e6e5068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6JONEMAPJ42LPV5VBE3AFMVL5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A study of retrieval algorithms of sparse messages in networks of neural cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ala Aboudib, Vincent Gripon, Xiaoran Jiang","submitted_at":"2013-08-21T08:19:14Z","abstract_excerpt":"Associative memories are data structures addressed using part of the content rather than an index. They offer good fault reliability and biological plausibility. Among different families of associative memories, sparse ones are known to offer the best efficiency (ratio of the amount of bits stored to that of bits used by the network itself). Their retrieval process performance has been shown to benefit from the use of iterations. However classical algorithms require having prior knowledge about the data to retrieve such as the number of nonzero symbols. We introduce several families of algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4506","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-18T03:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3z7saTJRI3NbXoF+ADNXt/5PP+bKjPhTE15KfPXF1v2YJmTU/ciZSfx5OhdIdf6WAkW5NUbFIWvEE3x7DwpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:35:51.961584Z"},"content_sha256":"078ea1cc428d78b01b623d45858793b6d4f09b82afc1d42f0c52822ae5f1afc1","schema_version":"1.0","event_id":"sha256:078ea1cc428d78b01b623d45858793b6d4f09b82afc1d42f0c52822ae5f1afc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JONEMAPJ42LPV5VBE3AFMVL5L/bundle.json","state_url":"https://pith.science/pith/6JONEMAPJ42LPV5VBE3AFMVL5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JONEMAPJ42LPV5VBE3AFMVL5L/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-25T17:35:51Z","links":{"resolver":"https://pith.science/pith/6JONEMAPJ42LPV5VBE3AFMVL5L","bundle":"https://pith.science/pith/6JONEMAPJ42LPV5VBE3AFMVL5L/bundle.json","state":"https://pith.science/pith/6JONEMAPJ42LPV5VBE3AFMVL5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JONEMAPJ42LPV5VBE3AFMVL5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6JONEMAPJ42LPV5VBE3AFMVL5L","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":"70e24be96edb25a67cbb74e527dbf8903f37c8c3b526e1eb5f1437635d536ad6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-08-21T08:19:14Z","title_canon_sha256":"785fd4185fb6b41dcdbbd0f5ecebe673090ce350ff54707f4e7691f5ee3ce288"},"schema_version":"1.0","source":{"id":"1308.4506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4506","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4506v1","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4506","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"6JONEMAPJ42L","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6JONEMAPJ42LPV5V","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6JONEMAP","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:078ea1cc428d78b01b623d45858793b6d4f09b82afc1d42f0c52822ae5f1afc1","target":"graph","created_at":"2026-05-18T03:15:21Z","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 data structures addressed using part of the content rather than an index. They offer good fault reliability and biological plausibility. Among different families of associative memories, sparse ones are known to offer the best efficiency (ratio of the amount of bits stored to that of bits used by the network itself). Their retrieval process performance has been shown to benefit from the use of iterations. However classical algorithms require having prior knowledge about the data to retrieve such as the number of nonzero symbols. We introduce several families of algorit","authors_text":"Ala Aboudib, Vincent Gripon, Xiaoran Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-08-21T08:19:14Z","title":"A study of retrieval algorithms of sparse messages in networks of neural cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4506","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:e4cad250e44038b00c527a32e12dea5ac4e8aaba13eb0983f36c5f5a8e6e5068","target":"record","created_at":"2026-05-18T03:15:21Z","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":"70e24be96edb25a67cbb74e527dbf8903f37c8c3b526e1eb5f1437635d536ad6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-08-21T08:19:14Z","title_canon_sha256":"785fd4185fb6b41dcdbbd0f5ecebe673090ce350ff54707f4e7691f5ee3ce288"},"schema_version":"1.0","source":{"id":"1308.4506","kind":"arxiv","version":1}},"canonical_sha256":"f25cd2300f4f34b7d7b5093602b2abeafd38aafc8fee3dfc059a788d49bd1a47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f25cd2300f4f34b7d7b5093602b2abeafd38aafc8fee3dfc059a788d49bd1a47","first_computed_at":"2026-05-18T03:15:21.899753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:21.899753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvB7L9M8xvkduzt1Onrh7qN9S79YgBnU9eaffVzGHgCyh3npSHnz0VF0Y99BSESK1LaQ1URn8GHeDlnlEqyTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:21.900622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4cad250e44038b00c527a32e12dea5ac4e8aaba13eb0983f36c5f5a8e6e5068","sha256:078ea1cc428d78b01b623d45858793b6d4f09b82afc1d42f0c52822ae5f1afc1"],"state_sha256":"1e33cfce1e2ddfa69d67fdaf8c16cc8f40eb68baa6aa06d1684b1a8965ed9371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcCysM+DvmegJ5rVEKSixJdeI1AKdw6rFc2NKXlKdX2iabN02Uwfe47auWHl2PVit/8VoWqDb7bFv5l5yZbmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:35:51.964988Z","bundle_sha256":"71e7287f768d4cbdaad4f8ceb46595cfeb98901f99b1263f2b9050a6a3c0b62a"}}