{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MMHAU334374NFXWBW7WMWWA3QE","short_pith_number":"pith:MMHAU334","canonical_record":{"source":{"id":"1306.3760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-17T07:54:48Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"6822beff169bc1eb9ce6a592aa9ae7a7620f049e884daf9a4d38a0994e66e4ff","abstract_canon_sha256":"b917095f8c68918b9e8adddcdca85b200aac4be6b6557be4ba87f4e2abfc7d58"},"schema_version":"1.0"},"canonical_sha256":"630e0a6f7cdff8d2dec1b7eccb581b810d6a794496e3afb3f72a0b7d17dbfe30","source":{"kind":"arxiv","id":"1306.3760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3760","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3760v1","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3760","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"MMHAU334374N","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MMHAU334374NFXWB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MMHAU334","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MMHAU334374NFXWBW7WMWWA3QE","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-17T07:54:48Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"6822beff169bc1eb9ce6a592aa9ae7a7620f049e884daf9a4d38a0994e66e4ff","abstract_canon_sha256":"b917095f8c68918b9e8adddcdca85b200aac4be6b6557be4ba87f4e2abfc7d58"},"schema_version":"1.0"},"canonical_sha256":"630e0a6f7cdff8d2dec1b7eccb581b810d6a794496e3afb3f72a0b7d17dbfe30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:46.570134Z","signature_b64":"aYmqAmnrE/v1jwaRv39i2H3KsG7LoOEchlkTdsN9zH4YUUcp40itW2nMmR6hWnJ8Bdm2gOd0G2Bz2T3je/ItCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630e0a6f7cdff8d2dec1b7eccb581b810d6a794496e3afb3f72a0b7d17dbfe30","last_reissued_at":"2026-05-18T03:20:46.569508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:46.569508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3760","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-18T03:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phES2rpd+27YtdhtAgJmEaitjz7hjdkj1z6w25x6STRsQ1ndC0/vDqgFZ713CDGLVtyEE11aR1h9N+kHA3zwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:30:57.589393Z"},"content_sha256":"b43b9cd878d04e5e6aa29f30ae070139708256da653dfbba23fc3267ea487b3a","schema_version":"1.0","event_id":"sha256:b43b9cd878d04e5e6aa29f30ae070139708256da653dfbba23fc3267ea487b3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MMHAU334374NFXWBW7WMWWA3QE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Space-Efficient Design for Reversible Floating Point Adder in Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Rodney Van Meter, Trung Duc Nguyen","submitted_at":"2013-06-17T07:54:48Z","abstract_excerpt":"Reversible logic has applications in low-power computing and quantum computing. However, there are few existing designs for reversible floating-point adders and none suitable for quantum computation. In this paper we propose a space-efficient reversible floating-point adder, suitable for binary quantum computation, improving the design of Nachtigal et al. Our work focuses on improving the reversible designs of the alignment unit and the normalization unit, which are the most expensive parts. By changing a few elements of the existing algorithm, including the circuit designs of the RLZC (revers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3760","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-18T03:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mn4txbNks8+d2hKz2F0zhBfQ/glKrA2vllibLBBN+SBxk4yvNEqUiZkgpotXt7/HY+yxYgjqZqrXsuXcNNAaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:30:57.590083Z"},"content_sha256":"2336afdf7ea611589c8c96aad4874d772b5bd0c5e5888e1bf88a4b2d7c0547d3","schema_version":"1.0","event_id":"sha256:2336afdf7ea611589c8c96aad4874d772b5bd0c5e5888e1bf88a4b2d7c0547d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMHAU334374NFXWBW7WMWWA3QE/bundle.json","state_url":"https://pith.science/pith/MMHAU334374NFXWBW7WMWWA3QE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMHAU334374NFXWBW7WMWWA3QE/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-09T10:30:57Z","links":{"resolver":"https://pith.science/pith/MMHAU334374NFXWBW7WMWWA3QE","bundle":"https://pith.science/pith/MMHAU334374NFXWBW7WMWWA3QE/bundle.json","state":"https://pith.science/pith/MMHAU334374NFXWBW7WMWWA3QE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMHAU334374NFXWBW7WMWWA3QE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MMHAU334374NFXWBW7WMWWA3QE","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":"b917095f8c68918b9e8adddcdca85b200aac4be6b6557be4ba87f4e2abfc7d58","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-17T07:54:48Z","title_canon_sha256":"6822beff169bc1eb9ce6a592aa9ae7a7620f049e884daf9a4d38a0994e66e4ff"},"schema_version":"1.0","source":{"id":"1306.3760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3760","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3760v1","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3760","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"MMHAU334374N","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MMHAU334374NFXWB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MMHAU334","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2336afdf7ea611589c8c96aad4874d772b5bd0c5e5888e1bf88a4b2d7c0547d3","target":"graph","created_at":"2026-05-18T03:20:46Z","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":"Reversible logic has applications in low-power computing and quantum computing. However, there are few existing designs for reversible floating-point adders and none suitable for quantum computation. In this paper we propose a space-efficient reversible floating-point adder, suitable for binary quantum computation, improving the design of Nachtigal et al. Our work focuses on improving the reversible designs of the alignment unit and the normalization unit, which are the most expensive parts. By changing a few elements of the existing algorithm, including the circuit designs of the RLZC (revers","authors_text":"Rodney Van Meter, Trung Duc Nguyen","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-17T07:54:48Z","title":"A Space-Efficient Design for Reversible Floating Point Adder in Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3760","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:b43b9cd878d04e5e6aa29f30ae070139708256da653dfbba23fc3267ea487b3a","target":"record","created_at":"2026-05-18T03:20:46Z","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":"b917095f8c68918b9e8adddcdca85b200aac4be6b6557be4ba87f4e2abfc7d58","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-17T07:54:48Z","title_canon_sha256":"6822beff169bc1eb9ce6a592aa9ae7a7620f049e884daf9a4d38a0994e66e4ff"},"schema_version":"1.0","source":{"id":"1306.3760","kind":"arxiv","version":1}},"canonical_sha256":"630e0a6f7cdff8d2dec1b7eccb581b810d6a794496e3afb3f72a0b7d17dbfe30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630e0a6f7cdff8d2dec1b7eccb581b810d6a794496e3afb3f72a0b7d17dbfe30","first_computed_at":"2026-05-18T03:20:46.569508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:46.569508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aYmqAmnrE/v1jwaRv39i2H3KsG7LoOEchlkTdsN9zH4YUUcp40itW2nMmR6hWnJ8Bdm2gOd0G2Bz2T3je/ItCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:46.570134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b43b9cd878d04e5e6aa29f30ae070139708256da653dfbba23fc3267ea487b3a","sha256:2336afdf7ea611589c8c96aad4874d772b5bd0c5e5888e1bf88a4b2d7c0547d3"],"state_sha256":"8d3c512f38a73a91d92a557050df57d3c5c4fd37938fce480a038b3e7f74a234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaNRokqFaGEyVqOGbclXHW5CKCJ+SKQc18/bssc+FreM2SF+RGFjUYgNZWpDmnF4IZ3iXUU99l3x+Wx7jagFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:30:57.593680Z","bundle_sha256":"2ab81607663b344712c3d889eacb93440305920faf867218f6f8c7aba588dde4"}}