{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UFT6SKZ4S5QDNY37MOYSEQYXCF","short_pith_number":"pith:UFT6SKZ4","canonical_record":{"source":{"id":"1712.02630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T20:34:02Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"f928ebaef3cbcb3c693679436722e76f37f59098a353526f32f73f061bd7b6d1","abstract_canon_sha256":"2f698a09de175f9c0f5598419691d27da48fc1c1d6983e378568d680cd10ebdd"},"schema_version":"1.0"},"canonical_sha256":"a167e92b3c976036e37f63b122431711622a3e66a053cb76217d88e4a26eb43d","source":{"kind":"arxiv","id":"1712.02630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02630","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02630v1","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02630","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"pith_short_12","alias_value":"UFT6SKZ4S5QD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFT6SKZ4S5QDNY37","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFT6SKZ4","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UFT6SKZ4S5QDNY37MOYSEQYXCF","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T20:34:02Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"f928ebaef3cbcb3c693679436722e76f37f59098a353526f32f73f061bd7b6d1","abstract_canon_sha256":"2f698a09de175f9c0f5598419691d27da48fc1c1d6983e378568d680cd10ebdd"},"schema_version":"1.0"},"canonical_sha256":"a167e92b3c976036e37f63b122431711622a3e66a053cb76217d88e4a26eb43d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:33.381398Z","signature_b64":"OQSVrI9zF00wbCcN4zWjeEm/+48Yvxg1aSDOQv9/1q8hqFD4KkOu470WsiIL26UT3RqDQ3eR4oI8ESKeDWpoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a167e92b3c976036e37f63b122431711622a3e66a053cb76217d88e4a26eb43d","last_reissued_at":"2026-05-18T00:28:33.380630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:33.380630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02630","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:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1Ty09SOIIRS7fa7krY9ZBs36nDdLnzGwBRbOjkQb1BfJ13nfTWLqOb8JFjUMP4fwQB8+MokbqSwsryAkFH5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T17:40:45.030756Z"},"content_sha256":"09ace74e6e83070d868c18d056ea7b05428a05b3ab07328aeb329d247384c2d4","schema_version":"1.0","event_id":"sha256:09ace74e6e83070d868c18d056ea7b05428a05b3ab07328aeb329d247384c2d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UFT6SKZ4S5QDNY37MOYSEQYXCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of Efficient Reversible Logic Based Binary and BCD Adder Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Himanshu Thapliyal, Nagarajan Ranganathan","submitted_at":"2017-12-05T20:34:02Z","abstract_excerpt":"In this work, we present a class of new designs for reversible binary and BCD adder circuits. The proposed designs are primarily optimized for the number of ancilla inputs and the number of garbage outputs and are designed for possible best values for the quantum cost and delay. First, we propose two new designs for the reversible ripple carry adder: (i) one with no input carry $c_0$ and no ancilla input bits, and (ii) one with input carry $c_0$ and no ancilla input bits. The proposed reversible ripple carry adder designs with no ancilla input bits have less quantum cost and logic depth (delay"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02630","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:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XjH41tCHWkP6gXy3QK7NxxmlwvUngMjv6yqOjx2WMDAgGp0cGN0U91UlARfKj5fQy8nTbtbvFTRIFJzAk5jAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T17:40:45.031097Z"},"content_sha256":"9203044891d25db73c78123c359f3f02b5131736490995fae1b4aa42807397a5","schema_version":"1.0","event_id":"sha256:9203044891d25db73c78123c359f3f02b5131736490995fae1b4aa42807397a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF/bundle.json","state_url":"https://pith.science/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF/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-07-04T17:40:45Z","links":{"resolver":"https://pith.science/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF","bundle":"https://pith.science/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF/bundle.json","state":"https://pith.science/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFT6SKZ4S5QDNY37MOYSEQYXCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UFT6SKZ4S5QDNY37MOYSEQYXCF","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":"2f698a09de175f9c0f5598419691d27da48fc1c1d6983e378568d680cd10ebdd","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T20:34:02Z","title_canon_sha256":"f928ebaef3cbcb3c693679436722e76f37f59098a353526f32f73f061bd7b6d1"},"schema_version":"1.0","source":{"id":"1712.02630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02630","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02630v1","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02630","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"pith_short_12","alias_value":"UFT6SKZ4S5QD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFT6SKZ4S5QDNY37","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFT6SKZ4","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:9203044891d25db73c78123c359f3f02b5131736490995fae1b4aa42807397a5","target":"graph","created_at":"2026-05-18T00:28:33Z","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":"In this work, we present a class of new designs for reversible binary and BCD adder circuits. The proposed designs are primarily optimized for the number of ancilla inputs and the number of garbage outputs and are designed for possible best values for the quantum cost and delay. First, we propose two new designs for the reversible ripple carry adder: (i) one with no input carry $c_0$ and no ancilla input bits, and (ii) one with input carry $c_0$ and no ancilla input bits. The proposed reversible ripple carry adder designs with no ancilla input bits have less quantum cost and logic depth (delay","authors_text":"Himanshu Thapliyal, Nagarajan Ranganathan","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T20:34:02Z","title":"Design of Efficient Reversible Logic Based Binary and BCD Adder Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02630","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:09ace74e6e83070d868c18d056ea7b05428a05b3ab07328aeb329d247384c2d4","target":"record","created_at":"2026-05-18T00:28:33Z","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":"2f698a09de175f9c0f5598419691d27da48fc1c1d6983e378568d680cd10ebdd","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T20:34:02Z","title_canon_sha256":"f928ebaef3cbcb3c693679436722e76f37f59098a353526f32f73f061bd7b6d1"},"schema_version":"1.0","source":{"id":"1712.02630","kind":"arxiv","version":1}},"canonical_sha256":"a167e92b3c976036e37f63b122431711622a3e66a053cb76217d88e4a26eb43d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a167e92b3c976036e37f63b122431711622a3e66a053cb76217d88e4a26eb43d","first_computed_at":"2026-05-18T00:28:33.380630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:33.380630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OQSVrI9zF00wbCcN4zWjeEm/+48Yvxg1aSDOQv9/1q8hqFD4KkOu470WsiIL26UT3RqDQ3eR4oI8ESKeDWpoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:33.381398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09ace74e6e83070d868c18d056ea7b05428a05b3ab07328aeb329d247384c2d4","sha256:9203044891d25db73c78123c359f3f02b5131736490995fae1b4aa42807397a5"],"state_sha256":"833b1a14956434580d73be33252c40a86d24ea515d76787332f97149bfe05a7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDyUqN0iuiOWctv+1DXACATS4ROShoXbgIXljI2aKoqys/bvm2vp+fORwW07AcqQ6m7fhQwIlOi/cVAGv/ipDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T17:40:45.032937Z","bundle_sha256":"6bbdc2544176da2d5f31cfa7144bfcea5bac61f8b48fdcab84eef1376c4bf134"}}