{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PPP6SIXXJEBDCUOY42YZZJDSXU","short_pith_number":"pith:PPP6SIXX","schema_version":"1.0","canonical_sha256":"7bdfe922f749023151d8e6b19ca472bd299b1730adc12f4b5fe987451bdfc96b","source":{"kind":"arxiv","id":"1504.05155","version":1},"attestation_state":"computed","paper":{"title":"The Classification of Reversible Bit Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Grier, Luke Schaeffer, Scott Aaronson","submitted_at":"2015-04-20T18:50:53Z","abstract_excerpt":"We present a complete classification of all possible sets of classical reversible gates acting on bits, in terms of which reversible transformations they generate, assuming swaps and ancilla bits are available for free. Our classification can be seen as the reversible-computing analogue of Post's lattice, a central result in mathematical logic from the 1940s. It is a step toward the ambitious goal of classifying all possible quantum gate sets acting on qubits. Our theorem implies a linear-time algorithm (which we have implemented), that takes as input the truth tables of reversible gates G and"},"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":"1504.05155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-20T18:50:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"86d7333d4889102b3d4872e32ad743e2e785f114e5c6d5d2057223b3ea92c438","abstract_canon_sha256":"f3dcf84fcf13ff183efa38aa49d3f7fa9cc35d78c4e49d0be92d3a5fa2ce816a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:22.496121Z","signature_b64":"5pkbpIjEyxogJHl3trxo6H9SIxXYKFWuKd90i/Av8c6mcyUktMYWnxAdK88N5uBHDzkTspmEnf0/V/v+L+mQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bdfe922f749023151d8e6b19ca472bd299b1730adc12f4b5fe987451bdfc96b","last_reissued_at":"2026-05-18T02:18:22.495468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:22.495468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Classification of Reversible Bit Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Grier, Luke Schaeffer, Scott Aaronson","submitted_at":"2015-04-20T18:50:53Z","abstract_excerpt":"We present a complete classification of all possible sets of classical reversible gates acting on bits, in terms of which reversible transformations they generate, assuming swaps and ancilla bits are available for free. Our classification can be seen as the reversible-computing analogue of Post's lattice, a central result in mathematical logic from the 1940s. It is a step toward the ambitious goal of classifying all possible quantum gate sets acting on qubits. Our theorem implies a linear-time algorithm (which we have implemented), that takes as input the truth tables of reversible gates G and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05155","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05155","created_at":"2026-05-18T02:18:22.495566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05155v1","created_at":"2026-05-18T02:18:22.495566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05155","created_at":"2026-05-18T02:18:22.495566+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPP6SIXXJEBD","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPP6SIXXJEBDCUOY","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPP6SIXX","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":75,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU","json":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU.json","graph_json":"https://pith.science/api/pith-number/PPP6SIXXJEBDCUOY42YZZJDSXU/graph.json","events_json":"https://pith.science/api/pith-number/PPP6SIXXJEBDCUOY42YZZJDSXU/events.json","paper":"https://pith.science/paper/PPP6SIXX"},"agent_actions":{"view_html":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU","download_json":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU.json","view_paper":"https://pith.science/paper/PPP6SIXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05155&json=true","fetch_graph":"https://pith.science/api/pith-number/PPP6SIXXJEBDCUOY42YZZJDSXU/graph.json","fetch_events":"https://pith.science/api/pith-number/PPP6SIXXJEBDCUOY42YZZJDSXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU/action/storage_attestation","attest_author":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU/action/author_attestation","sign_citation":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU/action/citation_signature","submit_replication":"https://pith.science/pith/PPP6SIXXJEBDCUOY42YZZJDSXU/action/replication_record"}},"created_at":"2026-05-18T02:18:22.495566+00:00","updated_at":"2026-05-18T02:18:22.495566+00:00"}