{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7XDQYSQIYVSAUUBSHRBGLTHNTJ","short_pith_number":"pith:7XDQYSQI","schema_version":"1.0","canonical_sha256":"fdc70c4a08c5640a50323c4265cced9a728b26ddc61a996d5db33a823d6861f2","source":{"kind":"arxiv","id":"1611.09621","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.09621","created_at":"2026-05-18T00:56:17.887595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09621v1","created_at":"2026-05-18T00:56:17.887595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09621","created_at":"2026-05-18T00:56:17.887595+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XDQYSQIYVSA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XDQYSQIYVSAUUBS","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XDQYSQI","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ","json":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ.json","graph_json":"https://pith.science/api/pith-number/7XDQYSQIYVSAUUBSHRBGLTHNTJ/graph.json","events_json":"https://pith.science/api/pith-number/7XDQYSQIYVSAUUBSHRBGLTHNTJ/events.json","paper":"https://pith.science/paper/7XDQYSQI"},"agent_actions":{"view_html":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ","download_json":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ.json","view_paper":"https://pith.science/paper/7XDQYSQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09621&json=true","fetch_graph":"https://pith.science/api/pith-number/7XDQYSQIYVSAUUBSHRBGLTHNTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7XDQYSQIYVSAUUBSHRBGLTHNTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/action/storage_attestation","attest_author":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/action/author_attestation","sign_citation":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/action/citation_signature","submit_replication":"https://pith.science/pith/7XDQYSQIYVSAUUBSHRBGLTHNTJ/action/replication_record"}},"created_at":"2026-05-18T00:56:17.887595+00:00","updated_at":"2026-05-18T00:56:17.887595+00:00"}