{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3MCLJHPY23BDR2HADLOBAN2BWC","short_pith_number":"pith:3MCLJHPY","canonical_record":{"source":{"id":"1402.0491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-02-03T20:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"7b06eb1aa277bbfbba3bf8c0db61f4c61a695b35d6a9300d6a0e5ef165a76d6c","abstract_canon_sha256":"e8e8ab7b49b02fa283786a67728c46e494f0edef0c07e68c2c332712ef5763cb"},"schema_version":"1.0"},"canonical_sha256":"db04b49df8d6c238e8e01adc103741b0834b9bd60099b14707f026a8ef3ec128","source":{"kind":"arxiv","id":"1402.0491","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0491","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0491v3","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0491","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"pith_short_12","alias_value":"3MCLJHPY23BD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3MCLJHPY23BDR2HA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3MCLJHPY","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3MCLJHPY23BDR2HADLOBAN2BWC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-02-03T20:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"7b06eb1aa277bbfbba3bf8c0db61f4c61a695b35d6a9300d6a0e5ef165a76d6c","abstract_canon_sha256":"e8e8ab7b49b02fa283786a67728c46e494f0edef0c07e68c2c332712ef5763cb"},"schema_version":"1.0"},"canonical_sha256":"db04b49df8d6c238e8e01adc103741b0834b9bd60099b14707f026a8ef3ec128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:09.759254Z","signature_b64":"JgVFpVZzU03fZwaoVG8YOnMtH2y8QYKdD8nOx8v2IqHriuPnNsDV9xzx0mok8jyTFwvRz+Im8Ln57r+aFcoUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db04b49df8d6c238e8e01adc103741b0834b9bd60099b14707f026a8ef3ec128","last_reissued_at":"2026-05-18T02:49:09.758751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:09.758751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0491","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2PmbqLOBoUg6wyAdrn4rHKcs9lafE7hGS0iulvKIeX5HBTwKmArz3nDheEcJ51ANt3HWyN34F9wdEZq+1BVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:24:10.000806Z"},"content_sha256":"482f835efe6867e2872af00d43c2e7cb3c8357f9fe9c4fb5b2aab001d4de9d8f","schema_version":"1.0","event_id":"sha256:482f835efe6867e2872af00d43c2e7cb3c8357f9fe9c4fb5b2aab001d4de9d8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3MCLJHPY23BDR2HADLOBAN2BWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Analysis of Reversible Logic Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Anupam Chattopadhyay, Chander Chandak, Kaushik Chakraborty","submitted_at":"2014-02-03T20:49:22Z","abstract_excerpt":"Reversible logic circuit is a necessary construction for achieving ultra low power dissipation as well as for prominent post-CMOS computing technologies such as Quantum computing. Consequently automatic synthesis of a Boolean function using elementary reversible logic gates has received significant research attention in recent times, creating the domain of reversible logic synthesis. In this paper, we study the complexity of reversible logic synthesis. The problem is separately studied for bounded-ancilla and ancilla-free optimal synthesis approaches. The computational complexity for both case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0491","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVmdwtTP/HFlvPNEvbvdulZWSHUGmFKjzREPRK9P4iGlAOAFM/nMAOfKRmF131CnYuqQOU9rF5YuC/EzTKBoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:24:10.001150Z"},"content_sha256":"24cace4006fb7c735ac606774da60900e214c398314d6f06fc2f77c61be963ae","schema_version":"1.0","event_id":"sha256:24cace4006fb7c735ac606774da60900e214c398314d6f06fc2f77c61be963ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MCLJHPY23BDR2HADLOBAN2BWC/bundle.json","state_url":"https://pith.science/pith/3MCLJHPY23BDR2HADLOBAN2BWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MCLJHPY23BDR2HADLOBAN2BWC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T01:24:10Z","links":{"resolver":"https://pith.science/pith/3MCLJHPY23BDR2HADLOBAN2BWC","bundle":"https://pith.science/pith/3MCLJHPY23BDR2HADLOBAN2BWC/bundle.json","state":"https://pith.science/pith/3MCLJHPY23BDR2HADLOBAN2BWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MCLJHPY23BDR2HADLOBAN2BWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3MCLJHPY23BDR2HADLOBAN2BWC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e8e8ab7b49b02fa283786a67728c46e494f0edef0c07e68c2c332712ef5763cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-02-03T20:49:22Z","title_canon_sha256":"7b06eb1aa277bbfbba3bf8c0db61f4c61a695b35d6a9300d6a0e5ef165a76d6c"},"schema_version":"1.0","source":{"id":"1402.0491","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0491","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0491v3","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0491","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"pith_short_12","alias_value":"3MCLJHPY23BD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3MCLJHPY23BDR2HA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3MCLJHPY","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:24cace4006fb7c735ac606774da60900e214c398314d6f06fc2f77c61be963ae","target":"graph","created_at":"2026-05-18T02:49:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Reversible logic circuit is a necessary construction for achieving ultra low power dissipation as well as for prominent post-CMOS computing technologies such as Quantum computing. Consequently automatic synthesis of a Boolean function using elementary reversible logic gates has received significant research attention in recent times, creating the domain of reversible logic synthesis. In this paper, we study the complexity of reversible logic synthesis. The problem is separately studied for bounded-ancilla and ancilla-free optimal synthesis approaches. The computational complexity for both case","authors_text":"Anupam Chattopadhyay, Chander Chandak, Kaushik Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-02-03T20:49:22Z","title":"Complexity Analysis of Reversible Logic Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0491","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:482f835efe6867e2872af00d43c2e7cb3c8357f9fe9c4fb5b2aab001d4de9d8f","target":"record","created_at":"2026-05-18T02:49:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e8e8ab7b49b02fa283786a67728c46e494f0edef0c07e68c2c332712ef5763cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-02-03T20:49:22Z","title_canon_sha256":"7b06eb1aa277bbfbba3bf8c0db61f4c61a695b35d6a9300d6a0e5ef165a76d6c"},"schema_version":"1.0","source":{"id":"1402.0491","kind":"arxiv","version":3}},"canonical_sha256":"db04b49df8d6c238e8e01adc103741b0834b9bd60099b14707f026a8ef3ec128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db04b49df8d6c238e8e01adc103741b0834b9bd60099b14707f026a8ef3ec128","first_computed_at":"2026-05-18T02:49:09.758751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:09.758751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JgVFpVZzU03fZwaoVG8YOnMtH2y8QYKdD8nOx8v2IqHriuPnNsDV9xzx0mok8jyTFwvRz+Im8Ln57r+aFcoUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:09.759254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0491","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:482f835efe6867e2872af00d43c2e7cb3c8357f9fe9c4fb5b2aab001d4de9d8f","sha256:24cace4006fb7c735ac606774da60900e214c398314d6f06fc2f77c61be963ae"],"state_sha256":"4e7c75db397728c01813887a7e93962a68200708b0b3918284882dc1b54d23bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8dElg814BaE/pyNIdnQXuX0NFOq2N39TaaQarXLTBL34BXWguS/V1V/rmGdWWoDLOXrIeVvXPoMRO5xe5+vDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:24:10.003094Z","bundle_sha256":"13799c9adf6fcfdec2c9288bafa93f982cf6fbb4d72fd0d038bff9b32b0c52f9"}}