{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YB3LJV7RGT7NODWNYUWXZFVOGH","short_pith_number":"pith:YB3LJV7R","canonical_record":{"source":{"id":"1004.4320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-25T03:38:04Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"e5473cac9478c61a3f89c1ddd1725e2439af78ac8e6f2554863e43c0c9550637","abstract_canon_sha256":"e1b091e302d78d9797a5c3e01f8027bd321da546f3f0361e103303f7426bba8c"},"schema_version":"1.0"},"canonical_sha256":"c076b4d7f134fed70ecdc52d7c96ae31e5322bc1bf39a286493e40e1520f4ca7","source":{"kind":"arxiv","id":"1004.4320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4320","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4320v2","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4320","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"YB3LJV7RGT7N","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YB3LJV7RGT7NODWN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YB3LJV7R","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YB3LJV7RGT7NODWNYUWXZFVOGH","target":"record","payload":{"canonical_record":{"source":{"id":"1004.4320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-25T03:38:04Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"e5473cac9478c61a3f89c1ddd1725e2439af78ac8e6f2554863e43c0c9550637","abstract_canon_sha256":"e1b091e302d78d9797a5c3e01f8027bd321da546f3f0361e103303f7426bba8c"},"schema_version":"1.0"},"canonical_sha256":"c076b4d7f134fed70ecdc52d7c96ae31e5322bc1bf39a286493e40e1520f4ca7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:32.105637Z","signature_b64":"4rEZ0QFyAYYRq7WTTyr/LtnP6ONMS+ETxX2Q/N3EH9ER0sQ9s2PvaIhDVdVlVdOJ7c73NxDt0lsushEwNN41BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c076b4d7f134fed70ecdc52d7c96ae31e5322bc1bf39a286493e40e1520f4ca7","last_reissued_at":"2026-05-18T03:46:32.104790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:32.104790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.4320","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-18T03:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crMLBmf+dc9Vg8yzkUSgSs5Ea7rHiQGkexWm+rz3LfGrxNy8FbaR09zLn1UJ2B394NqT+23ZSELjMvg2GcoHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:28:12.571656Z"},"content_sha256":"c30b7e6930b279e4465be1627971a930187e9938657dc720e8a672f0839cbf96","schema_version":"1.0","event_id":"sha256:c30b7e6930b279e4465be1627971a930187e9938657dc720e8a672f0839cbf96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YB3LJV7RGT7NODWNYUWXZFVOGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reversible Circuit Synthesis Using a Cycle-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Mehdi Saeedi, Mehdi Sedighi, Morteza Saheb Zamani, Zahra Sasanian","submitted_at":"2010-04-25T03:38:04Z","abstract_excerpt":"Reversible logic has applications in various research areas including signal processing, cryptography and quantum computation. In this paper, direct NCT-based synthesis of a given $k$-cycle in a cycle-based synthesis scenario is examined. To this end, a set of seven building blocks is proposed that reveals the potential of direct synthesis of a given permutation to reduce both quantum cost and average runtime. To synthesize a given large cycle, we propose a decomposition algorithm to extract the suggested building blocks from the input specification. Then, a synthesis method is introduced whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4320","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-18T03:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KToui/dNfw8U/SnMqcV9IvtGlJBHu7PdXs8XztN2OJmFzemA6Xrz5/xSCy6IUPBs1GudxnaBThmPpmYKfQXmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:28:12.572452Z"},"content_sha256":"3e16a143555628779b3ed2103ebda0ec618d39f2260c18cf5f719aeb83b537ba","schema_version":"1.0","event_id":"sha256:3e16a143555628779b3ed2103ebda0ec618d39f2260c18cf5f719aeb83b537ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/bundle.json","state_url":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/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-27T04:28:12Z","links":{"resolver":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH","bundle":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/bundle.json","state":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YB3LJV7RGT7NODWNYUWXZFVOGH","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":"e1b091e302d78d9797a5c3e01f8027bd321da546f3f0361e103303f7426bba8c","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-25T03:38:04Z","title_canon_sha256":"e5473cac9478c61a3f89c1ddd1725e2439af78ac8e6f2554863e43c0c9550637"},"schema_version":"1.0","source":{"id":"1004.4320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4320","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4320v2","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4320","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"YB3LJV7RGT7N","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YB3LJV7RGT7NODWN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YB3LJV7R","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:3e16a143555628779b3ed2103ebda0ec618d39f2260c18cf5f719aeb83b537ba","target":"graph","created_at":"2026-05-18T03:46:32Z","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 various research areas including signal processing, cryptography and quantum computation. In this paper, direct NCT-based synthesis of a given $k$-cycle in a cycle-based synthesis scenario is examined. To this end, a set of seven building blocks is proposed that reveals the potential of direct synthesis of a given permutation to reduce both quantum cost and average runtime. To synthesize a given large cycle, we propose a decomposition algorithm to extract the suggested building blocks from the input specification. Then, a synthesis method is introduced whic","authors_text":"Mehdi Saeedi, Mehdi Sedighi, Morteza Saheb Zamani, Zahra Sasanian","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-25T03:38:04Z","title":"Reversible Circuit Synthesis Using a Cycle-Based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4320","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:c30b7e6930b279e4465be1627971a930187e9938657dc720e8a672f0839cbf96","target":"record","created_at":"2026-05-18T03:46:32Z","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":"e1b091e302d78d9797a5c3e01f8027bd321da546f3f0361e103303f7426bba8c","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-25T03:38:04Z","title_canon_sha256":"e5473cac9478c61a3f89c1ddd1725e2439af78ac8e6f2554863e43c0c9550637"},"schema_version":"1.0","source":{"id":"1004.4320","kind":"arxiv","version":2}},"canonical_sha256":"c076b4d7f134fed70ecdc52d7c96ae31e5322bc1bf39a286493e40e1520f4ca7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c076b4d7f134fed70ecdc52d7c96ae31e5322bc1bf39a286493e40e1520f4ca7","first_computed_at":"2026-05-18T03:46:32.104790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:32.104790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4rEZ0QFyAYYRq7WTTyr/LtnP6ONMS+ETxX2Q/N3EH9ER0sQ9s2PvaIhDVdVlVdOJ7c73NxDt0lsushEwNN41BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:32.105637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.4320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c30b7e6930b279e4465be1627971a930187e9938657dc720e8a672f0839cbf96","sha256:3e16a143555628779b3ed2103ebda0ec618d39f2260c18cf5f719aeb83b537ba"],"state_sha256":"a3fdcfa814c8e33a7c4b3a950dd36faca730f8a8661e71e7aba155d14c05a164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3BsdmMJZ+y1UuGRCJoNz+JA+cnldAkq9ndOUGnkzqQGoFJHrEV8t/6NMqaJUOpFM4yTPDuMTLQJT/v2oqzpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:28:12.575333Z","bundle_sha256":"5291363ae3c10cf94daf6cb3b322ed93015cdb6445a74929c74241084b49d5ad"}}