{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SXS6D6FJ2JPBHBLHMGL26RX5GO","short_pith_number":"pith:SXS6D6FJ","schema_version":"1.0","canonical_sha256":"95e5e1f8a9d25e1385676197af46fd33952b848894eabc93a9789d9171b0f8ed","source":{"kind":"arxiv","id":"1602.04967","version":2},"attestation_state":"computed","paper":{"title":"Strongly Universal Reversible Gate Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.ET","authors_text":"Jarkko Kari, Tim Boykett, Ville Salo","submitted_at":"2016-02-16T09:57:00Z","abstract_excerpt":"It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of $\\{0,1\\}^n$ can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation, and it is known that one bit is indeed enough. Without auxiliary bits, all even permutations can be implemented. We generalize these results to non-binary logic: If $A$ is a finite set of odd cardinality then a finite gate set can genera"},"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":"1602.04967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2016-02-16T09:57:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f51763c49886d86b30eb33e6521e7a2cd9184823ecf4e0aad689d5228088cb6e","abstract_canon_sha256":"0f65b86c3d040eb54d420c784f16ff974a3b62affeb1e3f2a4dbb54782e6d1f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.750877Z","signature_b64":"gIyXoUL1D8QQ5U31TMHYCy1TsQSu0LC625NblZegsqTYUmbXDTof/JUdV0I7AsfwnErFbaZVh9F+YFlpfpcIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95e5e1f8a9d25e1385676197af46fd33952b848894eabc93a9789d9171b0f8ed","last_reissued_at":"2026-05-18T01:19:33.750384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.750384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strongly Universal Reversible Gate Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.ET","authors_text":"Jarkko Kari, Tim Boykett, Ville Salo","submitted_at":"2016-02-16T09:57:00Z","abstract_excerpt":"It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of $\\{0,1\\}^n$ can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation, and it is known that one bit is indeed enough. Without auxiliary bits, all even permutations can be implemented. We generalize these results to non-binary logic: If $A$ is a finite set of odd cardinality then a finite gate set can genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04967","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":"1602.04967","created_at":"2026-05-18T01:19:33.750468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04967v2","created_at":"2026-05-18T01:19:33.750468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04967","created_at":"2026-05-18T01:19:33.750468+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXS6D6FJ2JPB","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXS6D6FJ2JPBHBLH","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXS6D6FJ","created_at":"2026-05-18T12:30:44.179134+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/SXS6D6FJ2JPBHBLHMGL26RX5GO","json":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO.json","graph_json":"https://pith.science/api/pith-number/SXS6D6FJ2JPBHBLHMGL26RX5GO/graph.json","events_json":"https://pith.science/api/pith-number/SXS6D6FJ2JPBHBLHMGL26RX5GO/events.json","paper":"https://pith.science/paper/SXS6D6FJ"},"agent_actions":{"view_html":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO","download_json":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO.json","view_paper":"https://pith.science/paper/SXS6D6FJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04967&json=true","fetch_graph":"https://pith.science/api/pith-number/SXS6D6FJ2JPBHBLHMGL26RX5GO/graph.json","fetch_events":"https://pith.science/api/pith-number/SXS6D6FJ2JPBHBLHMGL26RX5GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO/action/storage_attestation","attest_author":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO/action/author_attestation","sign_citation":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO/action/citation_signature","submit_replication":"https://pith.science/pith/SXS6D6FJ2JPBHBLHMGL26RX5GO/action/replication_record"}},"created_at":"2026-05-18T01:19:33.750468+00:00","updated_at":"2026-05-18T01:19:33.750468+00:00"}