{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZLCF4YEE5JNSVCVU7GUKWLUIA5","short_pith_number":"pith:ZLCF4YEE","schema_version":"1.0","canonical_sha256":"cac45e6084ea5b2a8ab4f9a8ab2e88074c9319544ff16d17b0d20674a913b961","source":{"kind":"arxiv","id":"1604.02549","version":3},"attestation_state":"computed","paper":{"title":"A finite alternation result for reversible boolean circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Peter Selinger","submitted_at":"2016-04-09T10:35:22Z","abstract_excerpt":"We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 bits or on the bottom n-1 bits. Moreover, if the functions on n-1 bits are even, we speak of even alternation depth. We show that every even reversible boolean function of n >= 4 bits has alternation depth at most 9 and even alternation depth at most 13."},"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":"1604.02549","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2016-04-09T10:35:22Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"52c2d35f236574b921d152fe122dd98db2913a0534a48e814729dc6b37319288","abstract_canon_sha256":"f46e4ced43c59f7056ae6bc32acd255ca65431711a503c0171555392e98d097c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:25.282717Z","signature_b64":"Af8r6eHNODtL1fs0OieAuJFY8qCHOxDEgBbU30sYRuMYvKwWCZBE2sHLZu4tW9gfR4ZfBspq+o6Gm/dZZtFqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac45e6084ea5b2a8ab4f9a8ab2e88074c9319544ff16d17b0d20674a913b961","last_reissued_at":"2026-05-18T00:12:25.282070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:25.282070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A finite alternation result for reversible boolean circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Peter Selinger","submitted_at":"2016-04-09T10:35:22Z","abstract_excerpt":"We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 bits or on the bottom n-1 bits. Moreover, if the functions on n-1 bits are even, we speak of even alternation depth. We show that every even reversible boolean function of n >= 4 bits has alternation depth at most 9 and even alternation depth at most 13."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02549","kind":"arxiv","version":3},"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":"1604.02549","created_at":"2026-05-18T00:12:25.282169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02549v3","created_at":"2026-05-18T00:12:25.282169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02549","created_at":"2026-05-18T00:12:25.282169+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLCF4YEE5JNS","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLCF4YEE5JNSVCVU","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLCF4YEE","created_at":"2026-05-18T12:30:53.716459+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/ZLCF4YEE5JNSVCVU7GUKWLUIA5","json":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5.json","graph_json":"https://pith.science/api/pith-number/ZLCF4YEE5JNSVCVU7GUKWLUIA5/graph.json","events_json":"https://pith.science/api/pith-number/ZLCF4YEE5JNSVCVU7GUKWLUIA5/events.json","paper":"https://pith.science/paper/ZLCF4YEE"},"agent_actions":{"view_html":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5","download_json":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5.json","view_paper":"https://pith.science/paper/ZLCF4YEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02549&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLCF4YEE5JNSVCVU7GUKWLUIA5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLCF4YEE5JNSVCVU7GUKWLUIA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5/action/storage_attestation","attest_author":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5/action/author_attestation","sign_citation":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5/action/citation_signature","submit_replication":"https://pith.science/pith/ZLCF4YEE5JNSVCVU7GUKWLUIA5/action/replication_record"}},"created_at":"2026-05-18T00:12:25.282169+00:00","updated_at":"2026-05-18T00:12:25.282169+00:00"}