{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OFF5W2L7XTCS4CIH7LVCGLZWFS","short_pith_number":"pith:OFF5W2L7","canonical_record":{"source":{"id":"1901.00881","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2019-01-03T19:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"ef3d3b37eebce2b5503fde664937cc4e4d4841c4989f8f736909680c0e4f4b8c","abstract_canon_sha256":"bf1bc05a7ef40514a0b10a577833fecf12f627bf7355be626caebc349615983b"},"schema_version":"1.0"},"canonical_sha256":"714bdb697fbcc52e0907faea232f362ca1470b31d7cb3cb06ec2a1731e03c07b","source":{"kind":"arxiv","id":"1901.00881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00881","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00881v1","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00881","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"OFF5W2L7XTCS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFF5W2L7XTCS4CIH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFF5W2L7","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OFF5W2L7XTCS4CIH7LVCGLZWFS","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00881","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2019-01-03T19:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"ef3d3b37eebce2b5503fde664937cc4e4d4841c4989f8f736909680c0e4f4b8c","abstract_canon_sha256":"bf1bc05a7ef40514a0b10a577833fecf12f627bf7355be626caebc349615983b"},"schema_version":"1.0"},"canonical_sha256":"714bdb697fbcc52e0907faea232f362ca1470b31d7cb3cb06ec2a1731e03c07b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:57.822580Z","signature_b64":"pjLAOI9VPtqXkQ8evB1aolhzN0IyMIjaPw6+15K6vd2wCoePSUy/gobQ1Odf6EtiYVU6oANZpxPf9Onv6bWOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"714bdb697fbcc52e0907faea232f362ca1470b31d7cb3cb06ec2a1731e03c07b","last_reissued_at":"2026-05-17T23:56:57.821844Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:57.821844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00881","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-17T23:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gGPNp3X/wvn5aPMW8dIanZjOcyRkeKFK3Fro2URy3OnUD0J52c1tZ3y1/t5Nmm7ie+2aCro9POizzNA250FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:49:07.240434Z"},"content_sha256":"5ba549bee1a45fc4e29eed924a9cb9d5145f1006e9023c02aa1e265bed2c12b5","schema_version":"1.0","event_id":"sha256:5ba549bee1a45fc4e29eed924a9cb9d5145f1006e9023c02aa1e265bed2c12b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OFF5W2L7XTCS4CIH7LVCGLZWFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trainable Associative Memory Neural Networks in a Quantum-Dot Cellular Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"James Stovold","submitted_at":"2019-01-03T19:10:24Z","abstract_excerpt":"Quantum-dot cellular automata (QCAs) offer a diffusive computing paradigm with picosecond transmission speed, making them an ideal candidate for moving diffusive computing to real-world applications. By implementing a trainable associative memory neural network into this substrate, we demonstrate that high-speed, high-density associative memory is feasible through QCAs. The presented design occupies $415\\text{nm}^2$ per neuron, which translates to circa $240 \\text{ billion neurons/cm}^2$, or $28\\text{GB/cm}^2$ of memory storage, offering a real possibility for large-scale associative memory ci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00881","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-17T23:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ7GZO285MW7a9zw22FOwTpKBpchG5qqHIAZXNfHgy6QL6VvYuD7CObZ2Cge9+dcpTMgAYqkaWMg7MEVWCjKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:49:07.241196Z"},"content_sha256":"653f8930175cdace79646af7ca6ce6b4894404542623b2e313c3b87a90e0f770","schema_version":"1.0","event_id":"sha256:653f8930175cdace79646af7ca6ce6b4894404542623b2e313c3b87a90e0f770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS/bundle.json","state_url":"https://pith.science/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS/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-11T16:49:07Z","links":{"resolver":"https://pith.science/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS","bundle":"https://pith.science/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS/bundle.json","state":"https://pith.science/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFF5W2L7XTCS4CIH7LVCGLZWFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OFF5W2L7XTCS4CIH7LVCGLZWFS","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":"bf1bc05a7ef40514a0b10a577833fecf12f627bf7355be626caebc349615983b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2019-01-03T19:10:24Z","title_canon_sha256":"ef3d3b37eebce2b5503fde664937cc4e4d4841c4989f8f736909680c0e4f4b8c"},"schema_version":"1.0","source":{"id":"1901.00881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00881","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00881v1","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00881","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"OFF5W2L7XTCS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFF5W2L7XTCS4CIH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFF5W2L7","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:653f8930175cdace79646af7ca6ce6b4894404542623b2e313c3b87a90e0f770","target":"graph","created_at":"2026-05-17T23:56: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":"Quantum-dot cellular automata (QCAs) offer a diffusive computing paradigm with picosecond transmission speed, making them an ideal candidate for moving diffusive computing to real-world applications. By implementing a trainable associative memory neural network into this substrate, we demonstrate that high-speed, high-density associative memory is feasible through QCAs. The presented design occupies $415\\text{nm}^2$ per neuron, which translates to circa $240 \\text{ billion neurons/cm}^2$, or $28\\text{GB/cm}^2$ of memory storage, offering a real possibility for large-scale associative memory ci","authors_text":"James Stovold","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2019-01-03T19:10:24Z","title":"Trainable Associative Memory Neural Networks in a Quantum-Dot Cellular Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00881","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:5ba549bee1a45fc4e29eed924a9cb9d5145f1006e9023c02aa1e265bed2c12b5","target":"record","created_at":"2026-05-17T23:56: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":"bf1bc05a7ef40514a0b10a577833fecf12f627bf7355be626caebc349615983b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2019-01-03T19:10:24Z","title_canon_sha256":"ef3d3b37eebce2b5503fde664937cc4e4d4841c4989f8f736909680c0e4f4b8c"},"schema_version":"1.0","source":{"id":"1901.00881","kind":"arxiv","version":1}},"canonical_sha256":"714bdb697fbcc52e0907faea232f362ca1470b31d7cb3cb06ec2a1731e03c07b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"714bdb697fbcc52e0907faea232f362ca1470b31d7cb3cb06ec2a1731e03c07b","first_computed_at":"2026-05-17T23:56:57.821844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:57.821844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pjLAOI9VPtqXkQ8evB1aolhzN0IyMIjaPw6+15K6vd2wCoePSUy/gobQ1Odf6EtiYVU6oANZpxPf9Onv6bWOBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:57.822580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ba549bee1a45fc4e29eed924a9cb9d5145f1006e9023c02aa1e265bed2c12b5","sha256:653f8930175cdace79646af7ca6ce6b4894404542623b2e313c3b87a90e0f770"],"state_sha256":"bcf19fa62ceb09fe0fd080136357ef6a1dc5d8afdb657db86423c824fecc4b08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcNPvLmHNeyv2LgQ+1UO1dwI4IIN4Q92mJ0RMd+ZCPast2P4DqMi5f5Du6ij6ul4fMq/gcgd5ok60SmjUnheCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:49:07.245385Z","bundle_sha256":"9e1d2fc80c84d8328a97c5683bda5cecef0665a598bd6c84b680b3a08a3ca478"}}