{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MTPJNY4NLAMLWO2G336TFKGOH3","short_pith_number":"pith:MTPJNY4N","schema_version":"1.0","canonical_sha256":"64de96e38d5818bb3b46defd32a8ce3ecb1e6bc51820895fd384a7f5dc4e2f18","source":{"kind":"arxiv","id":"1103.2686","version":2},"attestation_state":"computed","paper":{"title":"A Study of Optimal 4-bit Reversible Toffoli Circuits and Their Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Oleg Golubitsky","submitted_at":"2011-03-14T15:07:19Z","abstract_excerpt":"Optimal synthesis of reversible functions is a non-trivial problem. One of the major limiting factors in computing such circuits is the sheer number of reversible functions. Even restricting synthesis to 4-bit reversible functions results in a huge search space (16! {\\approx} 2^{44} functions). The output of such a search alone, counting only the space required to list Toffoli gates for every function, would require over 100 terabytes of storage. In this paper, we present two algorithms: one, that synthesizes an optimal circuit for any 4-bit reversible specification, and another that synthesiz"},"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":"1103.2686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-14T15:07:19Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"ba1330317ac7cc8c3256e93fb0d79aff8dca8d544b96007ebf787f087d2cb966","abstract_canon_sha256":"7ca77f84377ceb04f78730dc19def758d109f78197c221df492b0586c761c2a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:34.317438Z","signature_b64":"YRtRi1mvgpVWcjN3qF1d3G4XyIuUoJQAmUiLtJ/sngAHV5ucnUqI2BVDFwDRZb82PYEaWSkMi0C8Y12Sr8krDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64de96e38d5818bb3b46defd32a8ce3ecb1e6bc51820895fd384a7f5dc4e2f18","last_reissued_at":"2026-05-18T03:48:34.316783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:34.316783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study of Optimal 4-bit Reversible Toffoli Circuits and Their Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Oleg Golubitsky","submitted_at":"2011-03-14T15:07:19Z","abstract_excerpt":"Optimal synthesis of reversible functions is a non-trivial problem. One of the major limiting factors in computing such circuits is the sheer number of reversible functions. Even restricting synthesis to 4-bit reversible functions results in a huge search space (16! {\\approx} 2^{44} functions). The output of such a search alone, counting only the space required to list Toffoli gates for every function, would require over 100 terabytes of storage. In this paper, we present two algorithms: one, that synthesizes an optimal circuit for any 4-bit reversible specification, and another that synthesiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2686","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":"1103.2686","created_at":"2026-05-18T03:48:34.316894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2686v2","created_at":"2026-05-18T03:48:34.316894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2686","created_at":"2026-05-18T03:48:34.316894+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTPJNY4NLAML","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTPJNY4NLAMLWO2G","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTPJNY4N","created_at":"2026-05-18T12:26:34.985390+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/MTPJNY4NLAMLWO2G336TFKGOH3","json":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3.json","graph_json":"https://pith.science/api/pith-number/MTPJNY4NLAMLWO2G336TFKGOH3/graph.json","events_json":"https://pith.science/api/pith-number/MTPJNY4NLAMLWO2G336TFKGOH3/events.json","paper":"https://pith.science/paper/MTPJNY4N"},"agent_actions":{"view_html":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3","download_json":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3.json","view_paper":"https://pith.science/paper/MTPJNY4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2686&json=true","fetch_graph":"https://pith.science/api/pith-number/MTPJNY4NLAMLWO2G336TFKGOH3/graph.json","fetch_events":"https://pith.science/api/pith-number/MTPJNY4NLAMLWO2G336TFKGOH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3/action/storage_attestation","attest_author":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3/action/author_attestation","sign_citation":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3/action/citation_signature","submit_replication":"https://pith.science/pith/MTPJNY4NLAMLWO2G336TFKGOH3/action/replication_record"}},"created_at":"2026-05-18T03:48:34.316894+00:00","updated_at":"2026-05-18T03:48:34.316894+00:00"}