{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OTRHQKQPUPLFPFSY27ALIRA4YM","short_pith_number":"pith:OTRHQKQP","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"},"canonical_sha256":"74e2782a0fa3d6579658d7c0b4441cc333a867295fee9d61568c518accb3536d","source":{"kind":"arxiv","id":"1602.08149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08149","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08149v1","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08149","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"OTRHQKQPUPLF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTRHQKQPUPLFPFSY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTRHQKQP","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OTRHQKQPUPLFPFSY27ALIRA4YM","target":"record","payload":{"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"},"canonical_sha256":"74e2782a0fa3d6579658d7c0b4441cc333a867295fee9d61568c518accb3536d","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"},"source_kind":"arxiv","source_id":"1602.08149","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:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvsmINRXjuwK3+4iieA1AoEP6M40cimNLwJzo9Fwvay6NNZgNnmY7//72RGOj+iw3GTkTiXUJ5YGqBjZsChqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:43:54.099346Z"},"content_sha256":"298bbefb405dd157b5237a3fca9579df5738a5e430382f85089f577e2620cf27","schema_version":"1.0","event_id":"sha256:298bbefb405dd157b5237a3fca9579df5738a5e430382f85089f577e2620cf27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OTRHQKQPUPLFPFSY27ALIRA4YM","target":"graph","payload":{"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"},"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:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZoEDGy9JCni6/t4sV98fPO2IiRhppc97UQu+Dgi9DiuBtP5ZOubyFAkyqEOFqVsLQ2JhSGgRaTgkqu+tCOLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:43:54.100002Z"},"content_sha256":"e702974e26b37bb79d65afdb6eb28d4306dcf6bdb0be2fd5cfe00f9aa38a4c44","schema_version":"1.0","event_id":"sha256:e702974e26b37bb79d65afdb6eb28d4306dcf6bdb0be2fd5cfe00f9aa38a4c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/bundle.json","state_url":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/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-27T13:43:54Z","links":{"resolver":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM","bundle":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/bundle.json","state":"https://pith.science/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTRHQKQPUPLFPFSY27ALIRA4YM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OTRHQKQPUPLFPFSY27ALIRA4YM","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":"b467c605da9f93ef836c583dad93a25dcf4bbde53ddd2a93599b400e29469e1e","cross_cats_sorted":["cs.OH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-25T23:42:49Z","title_canon_sha256":"a1cfcf890930be34ea30302a86bc13208259eb2af42f2da6ac0773eda703dacc"},"schema_version":"1.0","source":{"id":"1602.08149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08149","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08149v1","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08149","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"OTRHQKQPUPLF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTRHQKQPUPLFPFSY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTRHQKQP","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:e702974e26b37bb79d65afdb6eb28d4306dcf6bdb0be2fd5cfe00f9aa38a4c44","target":"graph","created_at":"2026-05-18T00:26:57Z","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 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}),~","authors_text":"Omar Shehab, Radhakrishnan Balu, Siddhartha Santra","cross_cats":["cs.OH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-25T23:42:49Z","title":"Exponential capacity of associative memories under quantum annealing recall"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08149","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:298bbefb405dd157b5237a3fca9579df5738a5e430382f85089f577e2620cf27","target":"record","created_at":"2026-05-18T00:26:57Z","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":"b467c605da9f93ef836c583dad93a25dcf4bbde53ddd2a93599b400e29469e1e","cross_cats_sorted":["cs.OH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-25T23:42:49Z","title_canon_sha256":"a1cfcf890930be34ea30302a86bc13208259eb2af42f2da6ac0773eda703dacc"},"schema_version":"1.0","source":{"id":"1602.08149","kind":"arxiv","version":1}},"canonical_sha256":"74e2782a0fa3d6579658d7c0b4441cc333a867295fee9d61568c518accb3536d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74e2782a0fa3d6579658d7c0b4441cc333a867295fee9d61568c518accb3536d","first_computed_at":"2026-05-18T00:26:57.929686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:57.929686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nJgK6Rj04z1vf0dJEdvDkFHfHzEF9+zSneIrHjVQ9L1U2hr1DfFN2HGM7IRA2huEhqUs/E3eRbOEpOS+c8C4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:57.930496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:298bbefb405dd157b5237a3fca9579df5738a5e430382f85089f577e2620cf27","sha256:e702974e26b37bb79d65afdb6eb28d4306dcf6bdb0be2fd5cfe00f9aa38a4c44"],"state_sha256":"db1789c2238f4a9bdc584aaeae7037c305efd9af18482e96315563abebea8ae3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcUjhOXbRxAMYSFM2AlZ6nhQw1xN8lcF9/WdIsM9j02E7/IXsBhoBIokeF8UsCr5KHJ9AC3aRx9WjG/Int/GAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:43:54.103518Z","bundle_sha256":"392f3a8551ce1598f922cb3332d67e2b4fa3d9a5dc5d9d3c5214476e5843d433"}}