{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OTRHQKQPUPLFPFSY27ALIRA4YM","short_pith_number":"pith:OTRHQKQP","schema_version":"1.0","canonical_sha256":"74e2782a0fa3d6579658d7c0b4441cc333a867295fee9d61568c518accb3536d","source":{"kind":"arxiv","id":"1602.08149","version":1},"attestation_state":"computed","paper":{"title":"Exponential capacity of associative memories under quantum annealing recall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OH"],"primary_cat":"quant-ph","authors_text":"Omar Shehab, Radhakrishnan Balu, Siddhartha Santra","submitted_at":"2016-02-25T23:42:49Z","abstract_excerpt":"Associative memory models, in theoretical neuro- and computer sciences, can generally store a sublinear number of memories. We show that using quantum annealing for recall tasks endows associative memory models with exponential storage capacities. Theoretically, we obtain the radius of attractor basins, $R(N)$, and the capacity, $C(N)$, of such a scheme and their tradeoffs. Our calculations establish that for randomly chosen memories the capacity of a model using the Hebbian learning rule with recall via quantum annealing is exponential in the size of the problem, $C(N)=\\mathcal{O}(e^{C_1N}),~"},"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":"1602.08149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-25T23:42:49Z","cross_cats_sorted":["cs.OH"],"title_canon_sha256":"a1cfcf890930be34ea30302a86bc13208259eb2af42f2da6ac0773eda703dacc","abstract_canon_sha256":"b467c605da9f93ef836c583dad93a25dcf4bbde53ddd2a93599b400e29469e1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:57.930496Z","signature_b64":"nJgK6Rj04z1vf0dJEdvDkFHfHzEF9+zSneIrHjVQ9L1U2hr1DfFN2HGM7IRA2huEhqUs/E3eRbOEpOS+c8C4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e2782a0fa3d6579658d7c0b4441cc333a867295fee9d61568c518accb3536d","last_reissued_at":"2026-05-18T00:26:57.929686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:57.929686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential capacity of associative memories under quantum annealing recall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OH"],"primary_cat":"quant-ph","authors_text":"Omar Shehab, Radhakrishnan Balu, Siddhartha Santra","submitted_at":"2016-02-25T23:42:49Z","abstract_excerpt":"Associative memory models, in theoretical neuro- and computer sciences, can generally store a sublinear number of memories. We show that using quantum annealing for recall tasks endows associative memory models with exponential storage capacities. Theoretically, we obtain the radius of attractor basins, $R(N)$, and the capacity, $C(N)$, of such a scheme and their tradeoffs. Our calculations establish that for randomly chosen memories the capacity of a model using the Hebbian learning rule with recall via quantum annealing is exponential in the size of the problem, $C(N)=\\mathcal{O}(e^{C_1N}),~"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08149","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":"1602.08149","created_at":"2026-05-18T00:26:57.929825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08149v1","created_at":"2026-05-18T00:26:57.929825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08149","created_at":"2026-05-18T00:26:57.929825+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTRHQKQPUPLF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTRHQKQPUPLFPFSY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTRHQKQP","created_at":"2026-05-18T12:30:36.002864+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/OTRHQKQPUPLFPFSY27ALIRA4YM","json":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM.json","graph_json":"https://pith.science/api/pith-number/OTRHQKQPUPLFPFSY27ALIRA4YM/graph.json","events_json":"https://pith.science/api/pith-number/OTRHQKQPUPLFPFSY27ALIRA4YM/events.json","paper":"https://pith.science/paper/OTRHQKQP"},"agent_actions":{"view_html":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM","download_json":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM.json","view_paper":"https://pith.science/paper/OTRHQKQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08149&json=true","fetch_graph":"https://pith.science/api/pith-number/OTRHQKQPUPLFPFSY27ALIRA4YM/graph.json","fetch_events":"https://pith.science/api/pith-number/OTRHQKQPUPLFPFSY27ALIRA4YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/action/storage_attestation","attest_author":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/action/author_attestation","sign_citation":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/action/citation_signature","submit_replication":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/action/replication_record"}},"created_at":"2026-05-18T00:26:57.929825+00:00","updated_at":"2026-05-18T00:26:57.929825+00:00"}