{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PKDN2753IVUR7B7OL6KXB6IJRG","short_pith_number":"pith:PKDN2753","canonical_record":{"source":{"id":"1407.6513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-24T10:06:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"099c09f0241f7bee7b699d2108c85dfffb21c9e105be390cae238581e54ce005","abstract_canon_sha256":"64a8b93def568cd391eff1b3141b0da88a124c09236927f9c1f586cc7ede9f0c"},"schema_version":"1.0"},"canonical_sha256":"7a86dd7fbb45691f87ee5f9570f90989bc4827212eab9452edf7f6b771dd328e","source":{"kind":"arxiv","id":"1407.6513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6513","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6513v1","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6513","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"PKDN2753IVUR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKDN2753IVUR7B7O","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKDN2753","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PKDN2753IVUR7B7OL6KXB6IJRG","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-24T10:06:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"099c09f0241f7bee7b699d2108c85dfffb21c9e105be390cae238581e54ce005","abstract_canon_sha256":"64a8b93def568cd391eff1b3141b0da88a124c09236927f9c1f586cc7ede9f0c"},"schema_version":"1.0"},"canonical_sha256":"7a86dd7fbb45691f87ee5f9570f90989bc4827212eab9452edf7f6b771dd328e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:38.575394Z","signature_b64":"JXtRcb2CStHqt/ip5o0cVg0b3/yK9p6RnDID0bRi7HEJheosxmgQ1XQ+/CL6NhZZo4hm5DApMOz6zA/SwyN7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a86dd7fbb45691f87ee5f9570f90989bc4827212eab9452edf7f6b771dd328e","last_reissued_at":"2026-05-18T02:46:38.574980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:38.574980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6513","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:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51+iAQD0BLp6Ubz8LYOgGTwKb++pkS1K1DsDX2F+e+v2Mc5iiX41UFzMfiy1giAIL7IOCpJg5A5Q2JVq1a/uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:09:55.362834Z"},"content_sha256":"bf43f0da40fe11db962a021d1b3fc793aff92443d735101aeca5b876ca646062","schema_version":"1.0","event_id":"sha256:bf43f0da40fe11db962a021d1b3fc793aff92443d735101aeca5b876ca646062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PKDN2753IVUR7B7OL6KXB6IJRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Amin Karbasi, Amin Shokrollahi, Amir Hesam Salavati","submitted_at":"2014-07-24T10:06:24Z","abstract_excerpt":"The task of a neural associative memory is to retrieve a set of previously memorized patterns from their noisy versions using a network of neurons. An ideal network should have the ability to 1) learn a set of patterns as they arrive, 2) retrieve the correct patterns from noisy queries, and 3) maximize the pattern retrieval capacity while maintaining the reliability in responding to queries. The majority of work on neural associative memories has focused on designing networks capable of memorizing any set of randomly chosen patterns at the expense of limiting the retrieval capacity. In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6513","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:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIvw2mb1ETwRF2/T/42kOuyHHaZOL8072jgDW8Ej3NAal1SYV8V76ndOvciucstUv316C1geDxpJuq5Ubrv4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:09:55.363327Z"},"content_sha256":"5079a54453efc466a2c9f31dadc04df595c65c7dde42ad3e6bf98206897329d2","schema_version":"1.0","event_id":"sha256:5079a54453efc466a2c9f31dadc04df595c65c7dde42ad3e6bf98206897329d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKDN2753IVUR7B7OL6KXB6IJRG/bundle.json","state_url":"https://pith.science/pith/PKDN2753IVUR7B7OL6KXB6IJRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKDN2753IVUR7B7OL6KXB6IJRG/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-06-03T15:09:55Z","links":{"resolver":"https://pith.science/pith/PKDN2753IVUR7B7OL6KXB6IJRG","bundle":"https://pith.science/pith/PKDN2753IVUR7B7OL6KXB6IJRG/bundle.json","state":"https://pith.science/pith/PKDN2753IVUR7B7OL6KXB6IJRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKDN2753IVUR7B7OL6KXB6IJRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PKDN2753IVUR7B7OL6KXB6IJRG","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":"64a8b93def568cd391eff1b3141b0da88a124c09236927f9c1f586cc7ede9f0c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-24T10:06:24Z","title_canon_sha256":"099c09f0241f7bee7b699d2108c85dfffb21c9e105be390cae238581e54ce005"},"schema_version":"1.0","source":{"id":"1407.6513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6513","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6513v1","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6513","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"PKDN2753IVUR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKDN2753IVUR7B7O","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKDN2753","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:5079a54453efc466a2c9f31dadc04df595c65c7dde42ad3e6bf98206897329d2","target":"graph","created_at":"2026-05-18T02:46:38Z","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":"The task of a neural associative memory is to retrieve a set of previously memorized patterns from their noisy versions using a network of neurons. An ideal network should have the ability to 1) learn a set of patterns as they arrive, 2) retrieve the correct patterns from noisy queries, and 3) maximize the pattern retrieval capacity while maintaining the reliability in responding to queries. The majority of work on neural associative memories has focused on designing networks capable of memorizing any set of randomly chosen patterns at the expense of limiting the retrieval capacity. In this pa","authors_text":"Amin Karbasi, Amin Shokrollahi, Amir Hesam Salavati","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-24T10:06:24Z","title":"Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6513","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:bf43f0da40fe11db962a021d1b3fc793aff92443d735101aeca5b876ca646062","target":"record","created_at":"2026-05-18T02:46:38Z","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":"64a8b93def568cd391eff1b3141b0da88a124c09236927f9c1f586cc7ede9f0c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-24T10:06:24Z","title_canon_sha256":"099c09f0241f7bee7b699d2108c85dfffb21c9e105be390cae238581e54ce005"},"schema_version":"1.0","source":{"id":"1407.6513","kind":"arxiv","version":1}},"canonical_sha256":"7a86dd7fbb45691f87ee5f9570f90989bc4827212eab9452edf7f6b771dd328e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a86dd7fbb45691f87ee5f9570f90989bc4827212eab9452edf7f6b771dd328e","first_computed_at":"2026-05-18T02:46:38.574980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:38.574980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JXtRcb2CStHqt/ip5o0cVg0b3/yK9p6RnDID0bRi7HEJheosxmgQ1XQ+/CL6NhZZo4hm5DApMOz6zA/SwyN7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:38.575394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf43f0da40fe11db962a021d1b3fc793aff92443d735101aeca5b876ca646062","sha256:5079a54453efc466a2c9f31dadc04df595c65c7dde42ad3e6bf98206897329d2"],"state_sha256":"53462fa266245d462a073c7a85aad155c6453478e112470f86f9059eb7e7afdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnz1p+bagzOPoAnFVQ/G0uDkjGRWJsKoHOQSkLR8tV6cY66ZHSBxKGc2QBar7RWNIXCN8+qnuP6vkiEoMXJRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:09:55.365685Z","bundle_sha256":"234ce216286ee624496477f3c476d8b45f7b4b285162a3ac3196126f197b67bf"}}