{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YB3LJV7RGT7NODWNYUWXZFVOGH","short_pith_number":"pith:YB3LJV7R","schema_version":"1.0","canonical_sha256":"c076b4d7f134fed70ecdc52d7c96ae31e5322bc1bf39a286493e40e1520f4ca7","source":{"kind":"arxiv","id":"1004.4320","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1004.4320","created_at":"2026-05-18T03:46:32.105017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4320v2","created_at":"2026-05-18T03:46:32.105017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4320","created_at":"2026-05-18T03:46:32.105017+00:00"},{"alias_kind":"pith_short_12","alias_value":"YB3LJV7RGT7N","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YB3LJV7RGT7NODWN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YB3LJV7R","created_at":"2026-05-18T12:26:17.028572+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/YB3LJV7RGT7NODWNYUWXZFVOGH","json":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH.json","graph_json":"https://pith.science/api/pith-number/YB3LJV7RGT7NODWNYUWXZFVOGH/graph.json","events_json":"https://pith.science/api/pith-number/YB3LJV7RGT7NODWNYUWXZFVOGH/events.json","paper":"https://pith.science/paper/YB3LJV7R"},"agent_actions":{"view_html":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH","download_json":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH.json","view_paper":"https://pith.science/paper/YB3LJV7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4320&json=true","fetch_graph":"https://pith.science/api/pith-number/YB3LJV7RGT7NODWNYUWXZFVOGH/graph.json","fetch_events":"https://pith.science/api/pith-number/YB3LJV7RGT7NODWNYUWXZFVOGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/action/storage_attestation","attest_author":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/action/author_attestation","sign_citation":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/action/citation_signature","submit_replication":"https://pith.science/pith/YB3LJV7RGT7NODWNYUWXZFVOGH/action/replication_record"}},"created_at":"2026-05-18T03:46:32.105017+00:00","updated_at":"2026-05-18T03:46:32.105017+00:00"}