{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TEFF4JWRYX2DGHO4444YCMUQOF","short_pith_number":"pith:TEFF4JWR","schema_version":"1.0","canonical_sha256":"990a5e26d1c5f4331ddce73981329071459448e35086ebb88e7b1e6d7f3166e9","source":{"kind":"arxiv","id":"1408.3586","version":1},"attestation_state":"computed","paper":{"title":"Embedding of Large Boolean Functions for Reversible Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"D. Michael Miller, Mathias Soeken, Oliver Keszocze, Robert Wille, Rolf Drechsler","submitted_at":"2014-08-15T16:54:12Z","abstract_excerpt":"Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function before they can be synthesized. Thus far, an optimal embedding is guaranteed only for small functions, whereas a significant overhead results when large functions are considered. In this paper, we study this issue. We prove that determining an optimal embedding is coNP-hard already for restricted cases. Then, we propose heuristic and exact methods for determin"},"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":"1408.3586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-08-15T16:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"3b070c6951d30564ec2c223ff4594c4222451ae43922813dd287db997515bcfb","abstract_canon_sha256":"6134f17bd8211fb19d65db07b2f09ce4c022aceaf0238f5d6b3c69cdbd9b979f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:03.688001Z","signature_b64":"lDIdTEmQMyW265Sx7MwANb6cqyEtuP/QXvu0qkFWMHjAh5Z/2LrzmxhpK5Uzxr/dnmL8Ko3g6AbAA/3jVIsHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"990a5e26d1c5f4331ddce73981329071459448e35086ebb88e7b1e6d7f3166e9","last_reissued_at":"2026-05-18T02:45:03.687444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:03.687444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding of Large Boolean Functions for Reversible Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"D. Michael Miller, Mathias Soeken, Oliver Keszocze, Robert Wille, Rolf Drechsler","submitted_at":"2014-08-15T16:54:12Z","abstract_excerpt":"Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function before they can be synthesized. Thus far, an optimal embedding is guaranteed only for small functions, whereas a significant overhead results when large functions are considered. In this paper, we study this issue. We prove that determining an optimal embedding is coNP-hard already for restricted cases. Then, we propose heuristic and exact methods for determin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3586","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":"1408.3586","created_at":"2026-05-18T02:45:03.687521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3586v1","created_at":"2026-05-18T02:45:03.687521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3586","created_at":"2026-05-18T02:45:03.687521+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEFF4JWRYX2D","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEFF4JWRYX2DGHO4","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEFF4JWR","created_at":"2026-05-18T12:28:49.207871+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/TEFF4JWRYX2DGHO4444YCMUQOF","json":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF.json","graph_json":"https://pith.science/api/pith-number/TEFF4JWRYX2DGHO4444YCMUQOF/graph.json","events_json":"https://pith.science/api/pith-number/TEFF4JWRYX2DGHO4444YCMUQOF/events.json","paper":"https://pith.science/paper/TEFF4JWR"},"agent_actions":{"view_html":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF","download_json":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF.json","view_paper":"https://pith.science/paper/TEFF4JWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3586&json=true","fetch_graph":"https://pith.science/api/pith-number/TEFF4JWRYX2DGHO4444YCMUQOF/graph.json","fetch_events":"https://pith.science/api/pith-number/TEFF4JWRYX2DGHO4444YCMUQOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF/action/storage_attestation","attest_author":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF/action/author_attestation","sign_citation":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF/action/citation_signature","submit_replication":"https://pith.science/pith/TEFF4JWRYX2DGHO4444YCMUQOF/action/replication_record"}},"created_at":"2026-05-18T02:45:03.687521+00:00","updated_at":"2026-05-18T02:45:03.687521+00:00"}