{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7XDQYSQIYVSAUUBSHRBGLTHNTJ","short_pith_number":"pith:7XDQYSQI","canonical_record":{"source":{"id":"1611.09621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T13:27:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"78d8552d8712399e6ab6b589c1c4d244adee2e9d65d996977e358330e7515a1a","abstract_canon_sha256":"e55d1af0c49c54c543d54f7f17592cb403af2cf07f4f33906287233960fd0370"},"schema_version":"1.0"},"canonical_sha256":"fdc70c4a08c5640a50323c4265cced9a728b26ddc61a996d5db33a823d6861f2","source":{"kind":"arxiv","id":"1611.09621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09621","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09621v1","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09621","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"pith_short_12","alias_value":"7XDQYSQIYVSA","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7XDQYSQIYVSAUUBS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7XDQYSQI","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7XDQYSQIYVSAUUBSHRBGLTHNTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T13:27:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"78d8552d8712399e6ab6b589c1c4d244adee2e9d65d996977e358330e7515a1a","abstract_canon_sha256":"e55d1af0c49c54c543d54f7f17592cb403af2cf07f4f33906287233960fd0370"},"schema_version":"1.0"},"canonical_sha256":"fdc70c4a08c5640a50323c4265cced9a728b26ddc61a996d5db33a823d6861f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:17.888222Z","signature_b64":"owdfbHjwMBJIT+4pBDGukyK6J+ZjzGNFMraw5I+VY4LlFfW3R7xF9bMOCd/qs7woUQNFmwmfOeIYkbKWXpKeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdc70c4a08c5640a50323c4265cced9a728b26ddc61a996d5db33a823d6861f2","last_reissued_at":"2026-05-18T00:56:17.887497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:17.887497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09621","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:56:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZlfjnZn05kRb0UcYgMiA3/lL0Pn3lYO9ITcccMaT3/H8NruDmwXVqbTg5dJmuN9rgQBvXb8vy539aRs43nCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:22.344272Z"},"content_sha256":"c9650e9e62b23fbf4bcf11761e667177701876c18dd52a26243ed97d5a12e47a","schema_version":"1.0","event_id":"sha256:c9650e9e62b23fbf4bcf11761e667177701876c18dd52a26243ed97d5a12e47a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7XDQYSQIYVSAUUBSHRBGLTHNTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Associative Memory using Dictionary Learning and Expander Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Ankit Singh Rawat, Arya Mazumdar","submitted_at":"2016-11-29T13:27:18Z","abstract_excerpt":"An associative memory is a framework of content-addressable memory that stores a collection of message vectors (or a dataset) over a neural network while enabling a neurally feasible mechanism to recover any message in the dataset from its noisy version. Designing an associative memory requires addressing two main tasks: 1) learning phase: given a dataset, learn a concise representation of the dataset in the form of a graphical model (or a neural network), 2) recall phase: given a noisy version of a message vector from the dataset, output the correct message vector via a neurally feasible algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09621","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:56:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk2fWZtOxpxki59ugZioDo2xpKbh/0vbzErByNt1jtywEdRu3tv2wnBQcfptuJRFkaOzQONaIGOZcxoCqCP4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:22.344641Z"},"content_sha256":"3b4f308baac3282e81d1d127582539e1d02026371ccd7cdce59326e48fb992f2","schema_version":"1.0","event_id":"sha256:3b4f308baac3282e81d1d127582539e1d02026371ccd7cdce59326e48fb992f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/bundle.json","state_url":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/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-30T14:15:22Z","links":{"resolver":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ","bundle":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/bundle.json","state":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7XDQYSQIYVSAUUBSHRBGLTHNTJ","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":"e55d1af0c49c54c543d54f7f17592cb403af2cf07f4f33906287233960fd0370","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T13:27:18Z","title_canon_sha256":"78d8552d8712399e6ab6b589c1c4d244adee2e9d65d996977e358330e7515a1a"},"schema_version":"1.0","source":{"id":"1611.09621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09621","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09621v1","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09621","created_at":"2026-05-18T00:56:17Z"},{"alias_kind":"pith_short_12","alias_value":"7XDQYSQIYVSA","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7XDQYSQIYVSAUUBS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7XDQYSQI","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:3b4f308baac3282e81d1d127582539e1d02026371ccd7cdce59326e48fb992f2","target":"graph","created_at":"2026-05-18T00:56:17Z","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":"An associative memory is a framework of content-addressable memory that stores a collection of message vectors (or a dataset) over a neural network while enabling a neurally feasible mechanism to recover any message in the dataset from its noisy version. Designing an associative memory requires addressing two main tasks: 1) learning phase: given a dataset, learn a concise representation of the dataset in the form of a graphical model (or a neural network), 2) recall phase: given a noisy version of a message vector from the dataset, output the correct message vector via a neurally feasible algo","authors_text":"Ankit Singh Rawat, Arya Mazumdar","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T13:27:18Z","title":"Associative Memory using Dictionary Learning and Expander Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09621","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:c9650e9e62b23fbf4bcf11761e667177701876c18dd52a26243ed97d5a12e47a","target":"record","created_at":"2026-05-18T00:56:17Z","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":"e55d1af0c49c54c543d54f7f17592cb403af2cf07f4f33906287233960fd0370","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T13:27:18Z","title_canon_sha256":"78d8552d8712399e6ab6b589c1c4d244adee2e9d65d996977e358330e7515a1a"},"schema_version":"1.0","source":{"id":"1611.09621","kind":"arxiv","version":1}},"canonical_sha256":"fdc70c4a08c5640a50323c4265cced9a728b26ddc61a996d5db33a823d6861f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdc70c4a08c5640a50323c4265cced9a728b26ddc61a996d5db33a823d6861f2","first_computed_at":"2026-05-18T00:56:17.887497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:17.887497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"owdfbHjwMBJIT+4pBDGukyK6J+ZjzGNFMraw5I+VY4LlFfW3R7xF9bMOCd/qs7woUQNFmwmfOeIYkbKWXpKeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:17.888222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9650e9e62b23fbf4bcf11761e667177701876c18dd52a26243ed97d5a12e47a","sha256:3b4f308baac3282e81d1d127582539e1d02026371ccd7cdce59326e48fb992f2"],"state_sha256":"6633872f4952b7a66d805e20cc7c89732a25392077187cfab141642b02011709"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAnAVMbJa31Rwp6RZXExJMj65LaODzOweXWeW0P8Mj1Yjpmkq9VYH/HMTCk3I4mFGwm3tB5qS+SjdOLaYX4IDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:15:22.346830Z","bundle_sha256":"eb72c6986261403cc5be28a5b407cd7990e3cca9debbe1bfea7115a602598321"}}