{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VYUP7R2NJP4TTFV4XAEX4JDQHJ","short_pith_number":"pith:VYUP7R2N","schema_version":"1.0","canonical_sha256":"ae28ffc74d4bf93996bcb8097e24703a452f8e69a208fab35ca286500c8934bb","source":{"kind":"arxiv","id":"1510.00377","version":1},"attestation_state":"computed","paper":{"title":"Reversible circuit compilation with space constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Parent, Krysta M. Svore, Martin Roetteler","submitted_at":"2015-10-01T19:48:52Z","abstract_excerpt":"We develop a framework for resource efficient compilation of higher-level programs into lower-level reversible circuits. Our main focus is on optimizing the memory footprint of the resulting reversible networks. This is motivated by the limited availability of qubits for the foreseeable future. We apply three main techniques to keep the number of required qubits small when computing classical, irreversible computations by means of reversible networks: first, wherever possible we allow the compiler to make use of in-place functions to modify some of the variables. Second, an intermediate repres"},"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":"1510.00377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-01T19:48:52Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"7eaeca6a44ab071a5a98d71efc8276f566cfd6adba166d7af08be9e01fc73be4","abstract_canon_sha256":"c05413b0d4972502715dd8677fb4cdddd1050b978abec7f13b2b21c2c0a19c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:19.467639Z","signature_b64":"CJw42OGkHtj1RU3gfh3C9mDWSGiGr301+Ehz1+fz09ltt0k37yl9HHLrSmwY/Xyw9QqV8Ms+l96OGrRCF+GiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae28ffc74d4bf93996bcb8097e24703a452f8e69a208fab35ca286500c8934bb","last_reissued_at":"2026-05-18T01:31:19.467118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:19.467118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reversible circuit compilation with space constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Parent, Krysta M. Svore, Martin Roetteler","submitted_at":"2015-10-01T19:48:52Z","abstract_excerpt":"We develop a framework for resource efficient compilation of higher-level programs into lower-level reversible circuits. Our main focus is on optimizing the memory footprint of the resulting reversible networks. This is motivated by the limited availability of qubits for the foreseeable future. We apply three main techniques to keep the number of required qubits small when computing classical, irreversible computations by means of reversible networks: first, wherever possible we allow the compiler to make use of in-place functions to modify some of the variables. Second, an intermediate repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00377","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":"1510.00377","created_at":"2026-05-18T01:31:19.467204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00377v1","created_at":"2026-05-18T01:31:19.467204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00377","created_at":"2026-05-18T01:31:19.467204+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYUP7R2NJP4T","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYUP7R2NJP4TTFV4","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYUP7R2N","created_at":"2026-05-18T12:29:47.479230+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/VYUP7R2NJP4TTFV4XAEX4JDQHJ","json":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ.json","graph_json":"https://pith.science/api/pith-number/VYUP7R2NJP4TTFV4XAEX4JDQHJ/graph.json","events_json":"https://pith.science/api/pith-number/VYUP7R2NJP4TTFV4XAEX4JDQHJ/events.json","paper":"https://pith.science/paper/VYUP7R2N"},"agent_actions":{"view_html":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ","download_json":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ.json","view_paper":"https://pith.science/paper/VYUP7R2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00377&json=true","fetch_graph":"https://pith.science/api/pith-number/VYUP7R2NJP4TTFV4XAEX4JDQHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VYUP7R2NJP4TTFV4XAEX4JDQHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ/action/storage_attestation","attest_author":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ/action/author_attestation","sign_citation":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ/action/citation_signature","submit_replication":"https://pith.science/pith/VYUP7R2NJP4TTFV4XAEX4JDQHJ/action/replication_record"}},"created_at":"2026-05-18T01:31:19.467204+00:00","updated_at":"2026-05-18T01:31:19.467204+00:00"}