{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2MZRC2ZDRGBENIQRBGKYAFNIZX","short_pith_number":"pith:2MZRC2ZD","schema_version":"1.0","canonical_sha256":"d333116b23898246a21109958015a8cdeef78b1d04fab16478ab52a5ced4ae8f","source":{"kind":"arxiv","id":"1807.09762","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous Ripple Carry Adder based on Area Optimized Early Output Dual-Bit Full Adder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"P Balasubramanian","submitted_at":"2018-07-25T03:30:54Z","abstract_excerpt":"This technical note presents the design of a new area optimized asynchronous early output dual-bit full adder (DBFA). An asynchronous ripple carry adder (RCA) is constructed based on the new asynchronous DBFAs and existing asynchronous early output single-bit full adders (SBFAs). The asynchronous DBFAs and SBFAs incorporate redundant logic and are encoded using the delay-insensitive dual-rail code (i.e. homogeneous data encoding) and follow a 4-phase return-to-zero handshaking. Compared to the previous asynchronous RCAs involving DBFAs and SBFAs, which are based on homogeneous or heterogeneous"},"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":"1807.09762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-07-25T03:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"88a9bfaa0de1381658de2fbb903cd22d74b534a24ab5df686ecf08004f5ad032","abstract_canon_sha256":"8cb43292aeb1be954efdeb98bd935ae75dc43a4a82f1bb1416867cf43187a0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:46.605444Z","signature_b64":"rdWCHguY6ZLgBqQsJJZMrKUzeeXpGDjRLYf1BncADhRdh2azjSsXMVvjBPZ7MqotE+uHMGFFNIsJ+p8hA2ILCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d333116b23898246a21109958015a8cdeef78b1d04fab16478ab52a5ced4ae8f","last_reissued_at":"2026-05-18T00:09:46.604653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:46.604653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Ripple Carry Adder based on Area Optimized Early Output Dual-Bit Full Adder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"P Balasubramanian","submitted_at":"2018-07-25T03:30:54Z","abstract_excerpt":"This technical note presents the design of a new area optimized asynchronous early output dual-bit full adder (DBFA). An asynchronous ripple carry adder (RCA) is constructed based on the new asynchronous DBFAs and existing asynchronous early output single-bit full adders (SBFAs). The asynchronous DBFAs and SBFAs incorporate redundant logic and are encoded using the delay-insensitive dual-rail code (i.e. homogeneous data encoding) and follow a 4-phase return-to-zero handshaking. Compared to the previous asynchronous RCAs involving DBFAs and SBFAs, which are based on homogeneous or heterogeneous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09762","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":"1807.09762","created_at":"2026-05-18T00:09:46.604773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09762v1","created_at":"2026-05-18T00:09:46.604773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09762","created_at":"2026-05-18T00:09:46.604773+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MZRC2ZDRGBE","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MZRC2ZDRGBENIQR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MZRC2ZD","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.10826","citing_title":"Performance Comparison of Quasi-Delay-Insensitive Asynchronous Adders","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX","json":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX.json","graph_json":"https://pith.science/api/pith-number/2MZRC2ZDRGBENIQRBGKYAFNIZX/graph.json","events_json":"https://pith.science/api/pith-number/2MZRC2ZDRGBENIQRBGKYAFNIZX/events.json","paper":"https://pith.science/paper/2MZRC2ZD"},"agent_actions":{"view_html":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX","download_json":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX.json","view_paper":"https://pith.science/paper/2MZRC2ZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09762&json=true","fetch_graph":"https://pith.science/api/pith-number/2MZRC2ZDRGBENIQRBGKYAFNIZX/graph.json","fetch_events":"https://pith.science/api/pith-number/2MZRC2ZDRGBENIQRBGKYAFNIZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX/action/storage_attestation","attest_author":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX/action/author_attestation","sign_citation":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX/action/citation_signature","submit_replication":"https://pith.science/pith/2MZRC2ZDRGBENIQRBGKYAFNIZX/action/replication_record"}},"created_at":"2026-05-18T00:09:46.604773+00:00","updated_at":"2026-05-18T00:09:46.604773+00:00"}