{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QESOHAT63UXROJ5U5CN47R7GMX","short_pith_number":"pith:QESOHAT6","canonical_record":{"source":{"id":"1008.3340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-08-19T16:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"a1be3630fdb0fa74c32d764ea7db3f6d2cbc4e446fc22dbd60ff9d7f1bdc7343","abstract_canon_sha256":"21475e7add015dc67aabbdd93308a49cb97028ec1e345437dc8b1c57321a9e4e"},"schema_version":"1.0"},"canonical_sha256":"8124e3827edd2f1727b4e89bcfc7e665ebe05c6fab363ed7024494b95941a41c","source":{"kind":"arxiv","id":"1008.3340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3340","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3340v1","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3340","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"QESOHAT63UXR","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QESOHAT63UXROJ5U","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QESOHAT6","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QESOHAT63UXROJ5U5CN47R7GMX","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-08-19T16:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"a1be3630fdb0fa74c32d764ea7db3f6d2cbc4e446fc22dbd60ff9d7f1bdc7343","abstract_canon_sha256":"21475e7add015dc67aabbdd93308a49cb97028ec1e345437dc8b1c57321a9e4e"},"schema_version":"1.0"},"canonical_sha256":"8124e3827edd2f1727b4e89bcfc7e665ebe05c6fab363ed7024494b95941a41c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:02.910544Z","signature_b64":"5XuStlf7qw86lyxaJipNIuH+5Uf6ZbePoCF66rnDPa58XhdPm67lo8EI4e0YnpgTkVNfJx9k/7F8yTxXZtbaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8124e3827edd2f1727b4e89bcfc7e665ebe05c6fab363ed7024494b95941a41c","last_reissued_at":"2026-05-18T04:42:02.910149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:02.910149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3340","source_version":1,"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-18T04:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVil5tJPr89vVnaO/+TWEUpw5sMYJTvgZ6KuWMgeDxg0YjJKrc9rQTxXEuEO/4lOsdspLrrmar+2Iw0fN625CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:08:46.823422Z"},"content_sha256":"37e2e97b952ec03ecd3cc649a7ad30feca4938f3feb378d29c7f74da40c8140c","schema_version":"1.0","event_id":"sha256:37e2e97b952ec03ecd3cc649a7ad30feca4938f3feb378d29c7f74da40c8140c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QESOHAT63UXROJ5U5CN47R7GMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesis of Fault Tolerant Reversible Logic Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Abdullah Al Mahmud, Md. Saiful Islam, Mohd. Zulfiquar Hafiz, Muhammad Mahbubur Rahman, Zerina Begum","submitted_at":"2010-08-19T16:12:11Z","abstract_excerpt":"Reversible logic is emerging as an important research area having its application in diverse fields such as low power CMOS design, digital signal processing, cryptography, quantum computing and optical information processing. This paper presents a new 4*4 universal reversible logic gate, IG. It is a parity preserving reversible logic gate, that is, the parity of the inputs matches the parity of the outputs. The proposed parity preserving reversible gate can be used to synthesize any arbitrary Boolean function. It allows any fault that affects no more than a single signal readily detectable at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3340","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"},"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-18T04:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FN1c+jIio+M+/cv76X5JhcWsTG0bPJYEbt+S66HcjftCh6jvuQkfVJzNKHOJ7m8FnhHbDMHRl3UwXK8aogEQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:08:46.823771Z"},"content_sha256":"c0caaf0e5b1f27f65997aeef8ba0adc3b39aa44615f114516ce13f229b469f3b","schema_version":"1.0","event_id":"sha256:c0caaf0e5b1f27f65997aeef8ba0adc3b39aa44615f114516ce13f229b469f3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QESOHAT63UXROJ5U5CN47R7GMX/bundle.json","state_url":"https://pith.science/pith/QESOHAT63UXROJ5U5CN47R7GMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QESOHAT63UXROJ5U5CN47R7GMX/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-22T13:08:46Z","links":{"resolver":"https://pith.science/pith/QESOHAT63UXROJ5U5CN47R7GMX","bundle":"https://pith.science/pith/QESOHAT63UXROJ5U5CN47R7GMX/bundle.json","state":"https://pith.science/pith/QESOHAT63UXROJ5U5CN47R7GMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QESOHAT63UXROJ5U5CN47R7GMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QESOHAT63UXROJ5U5CN47R7GMX","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":"21475e7add015dc67aabbdd93308a49cb97028ec1e345437dc8b1c57321a9e4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-08-19T16:12:11Z","title_canon_sha256":"a1be3630fdb0fa74c32d764ea7db3f6d2cbc4e446fc22dbd60ff9d7f1bdc7343"},"schema_version":"1.0","source":{"id":"1008.3340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3340","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3340v1","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3340","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"QESOHAT63UXR","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QESOHAT63UXROJ5U","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QESOHAT6","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:c0caaf0e5b1f27f65997aeef8ba0adc3b39aa44615f114516ce13f229b469f3b","target":"graph","created_at":"2026-05-18T04:42:02Z","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 is emerging as an important research area having its application in diverse fields such as low power CMOS design, digital signal processing, cryptography, quantum computing and optical information processing. This paper presents a new 4*4 universal reversible logic gate, IG. It is a parity preserving reversible logic gate, that is, the parity of the inputs matches the parity of the outputs. The proposed parity preserving reversible gate can be used to synthesize any arbitrary Boolean function. It allows any fault that affects no more than a single signal readily detectable at ","authors_text":"Abdullah Al Mahmud, Md. Saiful Islam, Mohd. Zulfiquar Hafiz, Muhammad Mahbubur Rahman, Zerina Begum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-08-19T16:12:11Z","title":"Synthesis of Fault Tolerant Reversible Logic Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3340","kind":"arxiv","version":1},"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:37e2e97b952ec03ecd3cc649a7ad30feca4938f3feb378d29c7f74da40c8140c","target":"record","created_at":"2026-05-18T04:42:02Z","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":"21475e7add015dc67aabbdd93308a49cb97028ec1e345437dc8b1c57321a9e4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-08-19T16:12:11Z","title_canon_sha256":"a1be3630fdb0fa74c32d764ea7db3f6d2cbc4e446fc22dbd60ff9d7f1bdc7343"},"schema_version":"1.0","source":{"id":"1008.3340","kind":"arxiv","version":1}},"canonical_sha256":"8124e3827edd2f1727b4e89bcfc7e665ebe05c6fab363ed7024494b95941a41c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8124e3827edd2f1727b4e89bcfc7e665ebe05c6fab363ed7024494b95941a41c","first_computed_at":"2026-05-18T04:42:02.910149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:02.910149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5XuStlf7qw86lyxaJipNIuH+5Uf6ZbePoCF66rnDPa58XhdPm67lo8EI4e0YnpgTkVNfJx9k/7F8yTxXZtbaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:02.910544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37e2e97b952ec03ecd3cc649a7ad30feca4938f3feb378d29c7f74da40c8140c","sha256:c0caaf0e5b1f27f65997aeef8ba0adc3b39aa44615f114516ce13f229b469f3b"],"state_sha256":"031810f7a7cc592773b9b4899cca007d30d23ba326d052895c9c6b078a06f45c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OApeMcbVWOpHVigdHaA1hEVo6yyAyf1j4mBdxym1qM8kwQ0MTr2SfiShIxpkMTBFbR4OCpFD6SWnACS2N1FEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:08:46.825629Z","bundle_sha256":"33785e5bd8894d20b7c63ff1dc26216401d30e91b15c1726be143aabc32fb631"}}