{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HDYLB5DVRYOXSVBCK66B2K6XBL","short_pith_number":"pith:HDYLB5DV","canonical_record":{"source":{"id":"1506.03777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-06-10T19:12:42Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"eefd0b10ed935753c186ae1bab575b58ba230e2ced27f0f4a09e1428a2b65e43","abstract_canon_sha256":"02a0fa26f3c65102640a8a132f3d5e88b10985823b294bbe77954a4ff66d6a3a"},"schema_version":"1.0"},"canonical_sha256":"38f0b0f4758e1d79542257bc1d2bd70ad34d80afb3f95aab7b97936b703c0b9b","source":{"kind":"arxiv","id":"1506.03777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03777","created_at":"2026-05-18T01:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03777v1","created_at":"2026-05-18T01:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03777","created_at":"2026-05-18T01:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"HDYLB5DVRYOX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HDYLB5DVRYOXSVBC","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HDYLB5DV","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HDYLB5DVRYOXSVBCK66B2K6XBL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-06-10T19:12:42Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"eefd0b10ed935753c186ae1bab575b58ba230e2ced27f0f4a09e1428a2b65e43","abstract_canon_sha256":"02a0fa26f3c65102640a8a132f3d5e88b10985823b294bbe77954a4ff66d6a3a"},"schema_version":"1.0"},"canonical_sha256":"38f0b0f4758e1d79542257bc1d2bd70ad34d80afb3f95aab7b97936b703c0b9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:03.312140Z","signature_b64":"6G5hebE1Ikr+iRjhtIjfnRSpGCYrjUEtyTxvpy8LG+61DSx7FlT5UQqSkrUtomR1D99SctRZo1N8+I2OS5O/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38f0b0f4758e1d79542257bc1d2bd70ad34d80afb3f95aab7b97936b703c0b9b","last_reissued_at":"2026-05-18T01:53:03.311554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:03.311554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03777","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-18T01:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8e8ZAINr4Mqfnuut7cDnJOnUzlR+HdbOBVxAo9Wh5vJojs+7OtE1BeceCrlt12krWn4o6GlAPvZQc+/FCpxFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:10:45.725386Z"},"content_sha256":"4b9c9390a21161ede70277cf242799b290ea713929bb7bf0000f2d70b2d17977","schema_version":"1.0","event_id":"sha256:4b9c9390a21161ede70277cf242799b290ea713929bb7bf0000f2d70b2d17977"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HDYLB5DVRYOXSVBCK66B2K6XBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reversible Logic Synthesis with Minimal Usage of Ancilla Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Siyao Xu","submitted_at":"2015-06-10T19:12:42Z","abstract_excerpt":"Reversible logic has attracted much research interest over the last few decades, especially due to its application in quantum computing. In the construction of reversible gates from basic gates, ancilla bits are commonly used to remove restrictions on the type of gates that a certain set of basic gates generates. With unlimited ancilla bits, many gates (such as Toffoli and Fredkin) become universal reversible gates. However, ancilla bits can be expensive to implement, thus making the problem of minimizing necessary ancilla bits a practical topic.\n  This thesis explores the problem of reversibl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03777","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-18T01:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VC+MRBSHF7uZBMmGN+4NXYyAbsU/u85nFOAPJuUTrsTCB8NGW5a70ezkarjDNGylQ3uR5Mct6CNgD6Tf16hkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:10:45.725880Z"},"content_sha256":"425a6db06631422992bc23fcfc465b43a2e13fecc0023083f49cf9b928cf8499","schema_version":"1.0","event_id":"sha256:425a6db06631422992bc23fcfc465b43a2e13fecc0023083f49cf9b928cf8499"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDYLB5DVRYOXSVBCK66B2K6XBL/bundle.json","state_url":"https://pith.science/pith/HDYLB5DVRYOXSVBCK66B2K6XBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDYLB5DVRYOXSVBCK66B2K6XBL/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-05-19T08:10:45Z","links":{"resolver":"https://pith.science/pith/HDYLB5DVRYOXSVBCK66B2K6XBL","bundle":"https://pith.science/pith/HDYLB5DVRYOXSVBCK66B2K6XBL/bundle.json","state":"https://pith.science/pith/HDYLB5DVRYOXSVBCK66B2K6XBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDYLB5DVRYOXSVBCK66B2K6XBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HDYLB5DVRYOXSVBCK66B2K6XBL","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":"02a0fa26f3c65102640a8a132f3d5e88b10985823b294bbe77954a4ff66d6a3a","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-06-10T19:12:42Z","title_canon_sha256":"eefd0b10ed935753c186ae1bab575b58ba230e2ced27f0f4a09e1428a2b65e43"},"schema_version":"1.0","source":{"id":"1506.03777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03777","created_at":"2026-05-18T01:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03777v1","created_at":"2026-05-18T01:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03777","created_at":"2026-05-18T01:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"HDYLB5DVRYOX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HDYLB5DVRYOXSVBC","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HDYLB5DV","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:425a6db06631422992bc23fcfc465b43a2e13fecc0023083f49cf9b928cf8499","target":"graph","created_at":"2026-05-18T01:53:03Z","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 attracted much research interest over the last few decades, especially due to its application in quantum computing. In the construction of reversible gates from basic gates, ancilla bits are commonly used to remove restrictions on the type of gates that a certain set of basic gates generates. With unlimited ancilla bits, many gates (such as Toffoli and Fredkin) become universal reversible gates. However, ancilla bits can be expensive to implement, thus making the problem of minimizing necessary ancilla bits a practical topic.\n  This thesis explores the problem of reversibl","authors_text":"Siyao Xu","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-06-10T19:12:42Z","title":"Reversible Logic Synthesis with Minimal Usage of Ancilla Bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03777","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:4b9c9390a21161ede70277cf242799b290ea713929bb7bf0000f2d70b2d17977","target":"record","created_at":"2026-05-18T01:53:03Z","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":"02a0fa26f3c65102640a8a132f3d5e88b10985823b294bbe77954a4ff66d6a3a","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-06-10T19:12:42Z","title_canon_sha256":"eefd0b10ed935753c186ae1bab575b58ba230e2ced27f0f4a09e1428a2b65e43"},"schema_version":"1.0","source":{"id":"1506.03777","kind":"arxiv","version":1}},"canonical_sha256":"38f0b0f4758e1d79542257bc1d2bd70ad34d80afb3f95aab7b97936b703c0b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38f0b0f4758e1d79542257bc1d2bd70ad34d80afb3f95aab7b97936b703c0b9b","first_computed_at":"2026-05-18T01:53:03.311554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:03.311554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6G5hebE1Ikr+iRjhtIjfnRSpGCYrjUEtyTxvpy8LG+61DSx7FlT5UQqSkrUtomR1D99SctRZo1N8+I2OS5O/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:03.312140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b9c9390a21161ede70277cf242799b290ea713929bb7bf0000f2d70b2d17977","sha256:425a6db06631422992bc23fcfc465b43a2e13fecc0023083f49cf9b928cf8499"],"state_sha256":"051ce074aac85b6db1931460ff52cb851d539d7e59aea35fb99c9acdd59b16e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vme+ie5uJdfAKesS6I0CpwfOy32huUopacZ+eHUSEeFKhqk5GwE3OMZL7Xyhh8RjRrNUh/Zm+yX8oT4pJrkqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:10:45.728526Z","bundle_sha256":"3e8631bcf0e4342ac5cc234afa96a6632ce4c4685da6af2184e8d6fd9ba66901"}}