{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZQFLTZMDZEYFAETS4LTCMWVLTS","short_pith_number":"pith:ZQFLTZMD","canonical_record":{"source":{"id":"1803.09671","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2018-03-26T15:38:09Z","cross_cats_sorted":[],"title_canon_sha256":"0b5a49bc287ea61e5c4c74596c4e04bbba6a73c192d1144a98af498928825db5","abstract_canon_sha256":"7c0eeafb60809eb57a4d2a2f68b961f95414454894f9e0f0cc40ddccc46da417"},"schema_version":"1.0"},"canonical_sha256":"cc0ab9e583c930501272e2e6265aab9cbd151af1caa648343a52ffdb95e29fa8","source":{"kind":"arxiv","id":"1803.09671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09671","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09671v2","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09671","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZQFLTZMDZEYF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZQFLTZMDZEYFAETS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZQFLTZMD","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZQFLTZMDZEYFAETS4LTCMWVLTS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09671","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2018-03-26T15:38:09Z","cross_cats_sorted":[],"title_canon_sha256":"0b5a49bc287ea61e5c4c74596c4e04bbba6a73c192d1144a98af498928825db5","abstract_canon_sha256":"7c0eeafb60809eb57a4d2a2f68b961f95414454894f9e0f0cc40ddccc46da417"},"schema_version":"1.0"},"canonical_sha256":"cc0ab9e583c930501272e2e6265aab9cbd151af1caa648343a52ffdb95e29fa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:31.710455Z","signature_b64":"rLflf5/EoupBoTt4wnLA7ulhIlxzxxDrkyiLiODIGBre5fjsoDXoOrezCpGApXRjMoMv0wO0Ads857R0mP0uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0ab9e583c930501272e2e6265aab9cbd151af1caa648343a52ffdb95e29fa8","last_reissued_at":"2026-05-18T00:05:31.710018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:31.710018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09671","source_version":2,"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:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iv5gsEtpRWEGW+kaomvakOXFGvZBtWRVIj3pmXwFG0HHrO9gHXJHz/5WPcsrdIOXqNwOwi+VI4lfpYjYkrkbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:32:44.955271Z"},"content_sha256":"c82e088bb184350595fcf888de4a7e70ffdba24dce56b0e9d3ec8a52e652bc2a","schema_version":"1.0","event_id":"sha256:c82e088bb184350595fcf888de4a7e70ffdba24dce56b0e9d3ec8a52e652bc2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZQFLTZMDZEYFAETS4LTCMWVLTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noise-based logic gates by operations on the reference system","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Laszlo B. Kish, Walter Daugherity","submitted_at":"2018-03-26T15:38:09Z","abstract_excerpt":"We propose a new, low-complexity solution to realize multi-input-bit gates acting on exponentially large superpositions in noise-based logic processors. Two examples are shown, the NOT gate and the CNOT gate. The operations can be executed and repeated with polynomial time and hardware complexity. The lack of a solution of this problem had been one of the major issues prohibiting the efficient realization of Shor's algorithm by Instantaneous Noise-Based Logic, which runs on a classical Turing computer with a true random number generator. With the method described in this paper, we are one step"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09671","kind":"arxiv","version":2},"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:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7W6F/Ncx+Lm1yxyF2IH2wkORxU1wzF5B5DbkF9Clrj4X0Q7c8XuIZI4wRtlkNZw+F7hukJg1VOCyHS+CuH6oCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:32:44.955636Z"},"content_sha256":"0f4e726d42cb1245ab70f328d08bc1a164372e5d4023c5a2b157cfed6098208b","schema_version":"1.0","event_id":"sha256:0f4e726d42cb1245ab70f328d08bc1a164372e5d4023c5a2b157cfed6098208b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS/bundle.json","state_url":"https://pith.science/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS/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-09T12:32:44Z","links":{"resolver":"https://pith.science/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS","bundle":"https://pith.science/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS/bundle.json","state":"https://pith.science/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQFLTZMDZEYFAETS4LTCMWVLTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZQFLTZMDZEYFAETS4LTCMWVLTS","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":"7c0eeafb60809eb57a4d2a2f68b961f95414454894f9e0f0cc40ddccc46da417","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2018-03-26T15:38:09Z","title_canon_sha256":"0b5a49bc287ea61e5c4c74596c4e04bbba6a73c192d1144a98af498928825db5"},"schema_version":"1.0","source":{"id":"1803.09671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09671","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09671v2","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09671","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZQFLTZMDZEYF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZQFLTZMDZEYFAETS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZQFLTZMD","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0f4e726d42cb1245ab70f328d08bc1a164372e5d4023c5a2b157cfed6098208b","target":"graph","created_at":"2026-05-18T00:05:31Z","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":"We propose a new, low-complexity solution to realize multi-input-bit gates acting on exponentially large superpositions in noise-based logic processors. Two examples are shown, the NOT gate and the CNOT gate. The operations can be executed and repeated with polynomial time and hardware complexity. The lack of a solution of this problem had been one of the major issues prohibiting the efficient realization of Shor's algorithm by Instantaneous Noise-Based Logic, which runs on a classical Turing computer with a true random number generator. With the method described in this paper, we are one step","authors_text":"Laszlo B. Kish, Walter Daugherity","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2018-03-26T15:38:09Z","title":"Noise-based logic gates by operations on the reference system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09671","kind":"arxiv","version":2},"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:c82e088bb184350595fcf888de4a7e70ffdba24dce56b0e9d3ec8a52e652bc2a","target":"record","created_at":"2026-05-18T00:05:31Z","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":"7c0eeafb60809eb57a4d2a2f68b961f95414454894f9e0f0cc40ddccc46da417","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2018-03-26T15:38:09Z","title_canon_sha256":"0b5a49bc287ea61e5c4c74596c4e04bbba6a73c192d1144a98af498928825db5"},"schema_version":"1.0","source":{"id":"1803.09671","kind":"arxiv","version":2}},"canonical_sha256":"cc0ab9e583c930501272e2e6265aab9cbd151af1caa648343a52ffdb95e29fa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc0ab9e583c930501272e2e6265aab9cbd151af1caa648343a52ffdb95e29fa8","first_computed_at":"2026-05-18T00:05:31.710018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:31.710018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLflf5/EoupBoTt4wnLA7ulhIlxzxxDrkyiLiODIGBre5fjsoDXoOrezCpGApXRjMoMv0wO0Ads857R0mP0uBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:31.710455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c82e088bb184350595fcf888de4a7e70ffdba24dce56b0e9d3ec8a52e652bc2a","sha256:0f4e726d42cb1245ab70f328d08bc1a164372e5d4023c5a2b157cfed6098208b"],"state_sha256":"cb9fc2d63115126f82abb1ad8c0f1af6a28ee4c33545fe8834afdd79bc759e92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LF+iGFM+ol63ougN9Pv6YapeKWJ6rYF+etssfshghQAGkbo+4nfH9PAKs8faLZblQdU3ma/72t5aXRHvHfFgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:32:44.957562Z","bundle_sha256":"549a8b5808522497034ca34c505e750396b07dd0ef16aee52ee1cecf505b6945"}}