{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WC4DY2XPCZ44776PY4VDOLLZNV","short_pith_number":"pith:WC4DY2XP","schema_version":"1.0","canonical_sha256":"b0b83c6aef1679cfffcfc72a372d796d6ce2955baa3d0646b55d340057cfd554","source":{"kind":"arxiv","id":"1807.02010","version":1},"attestation_state":"computed","paper":{"title":"DNA Computing for Combinational Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","q-bio.MN"],"primary_cat":"cs.ET","authors_text":"2, (2) National Mobile Communications Research Laboratory, 3), (3) Quantum Information Center, China), Chuan Zhang (1, Lulu Ge (1, Signal-processing (LEADS), Southeast University, Xiaohu You (2) ((1) Lab of Efficient Architectures for Digital-communication, Yuchen Zhuang (1, Zaichen Zhang (2, Zhiwei Zhong (1, Ziyuan Shen (1","submitted_at":"2018-07-05T13:59:48Z","abstract_excerpt":"With the progressive scale-down of semiconductor's feature size, people are looking forward to More Moore and More than Moore. In order to offer a possible alternative implementation process, people are trying to figure out a feasible transfer from silicon to molecular computing. Such transfer lies on bio-based modules programming with computer-like logic, aiming at realizing the Turing machine. To accomplish this, the DNA-based combinational logic is inevitably the first step we have taken care of. This timely overview paper introduces combinational logic synthesized in DNA computing from bot"},"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":"1807.02010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-07-05T13:59:48Z","cross_cats_sorted":["eess.SP","q-bio.MN"],"title_canon_sha256":"3e6307bb32d806e572ec790601f00fa9d0dc9a9b507ed6bfd0b7dee9be67577b","abstract_canon_sha256":"aaa77d2b113e26949b1f090415c59abb58183a4c8a83ba593c8717c05517af97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:24.489717Z","signature_b64":"bWxaMEibl4x8s3TDJxqgaVMagGqB6KHzpQ5/dKjk0GcsQ9LoC+2/QmUNNicu/UXdEAfrUsjiP+lRtIB++ZYXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0b83c6aef1679cfffcfc72a372d796d6ce2955baa3d0646b55d340057cfd554","last_reissued_at":"2026-05-18T00:11:24.489017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:24.489017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DNA Computing for Combinational Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","q-bio.MN"],"primary_cat":"cs.ET","authors_text":"2, (2) National Mobile Communications Research Laboratory, 3), (3) Quantum Information Center, China), Chuan Zhang (1, Lulu Ge (1, Signal-processing (LEADS), Southeast University, Xiaohu You (2) ((1) Lab of Efficient Architectures for Digital-communication, Yuchen Zhuang (1, Zaichen Zhang (2, Zhiwei Zhong (1, Ziyuan Shen (1","submitted_at":"2018-07-05T13:59:48Z","abstract_excerpt":"With the progressive scale-down of semiconductor's feature size, people are looking forward to More Moore and More than Moore. In order to offer a possible alternative implementation process, people are trying to figure out a feasible transfer from silicon to molecular computing. Such transfer lies on bio-based modules programming with computer-like logic, aiming at realizing the Turing machine. To accomplish this, the DNA-based combinational logic is inevitably the first step we have taken care of. This timely overview paper introduces combinational logic synthesized in DNA computing from bot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02010","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":"1807.02010","created_at":"2026-05-18T00:11:24.489124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02010v1","created_at":"2026-05-18T00:11:24.489124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02010","created_at":"2026-05-18T00:11:24.489124+00:00"},{"alias_kind":"pith_short_12","alias_value":"WC4DY2XPCZ44","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WC4DY2XPCZ44776P","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WC4DY2XP","created_at":"2026-05-18T12:32:59.047623+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/WC4DY2XPCZ44776PY4VDOLLZNV","json":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV.json","graph_json":"https://pith.science/api/pith-number/WC4DY2XPCZ44776PY4VDOLLZNV/graph.json","events_json":"https://pith.science/api/pith-number/WC4DY2XPCZ44776PY4VDOLLZNV/events.json","paper":"https://pith.science/paper/WC4DY2XP"},"agent_actions":{"view_html":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV","download_json":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV.json","view_paper":"https://pith.science/paper/WC4DY2XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02010&json=true","fetch_graph":"https://pith.science/api/pith-number/WC4DY2XPCZ44776PY4VDOLLZNV/graph.json","fetch_events":"https://pith.science/api/pith-number/WC4DY2XPCZ44776PY4VDOLLZNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV/action/storage_attestation","attest_author":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV/action/author_attestation","sign_citation":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV/action/citation_signature","submit_replication":"https://pith.science/pith/WC4DY2XPCZ44776PY4VDOLLZNV/action/replication_record"}},"created_at":"2026-05-18T00:11:24.489124+00:00","updated_at":"2026-05-18T00:11:24.489124+00:00"}