{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LEZOLRYNBM5QKHNZLW3QG5YOF2","short_pith_number":"pith:LEZOLRYN","schema_version":"1.0","canonical_sha256":"5932e5c70d0b3b051db95db703770e2eb69734e99828e5f2a2cff4308d23e016","source":{"kind":"arxiv","id":"1908.09297","version":1},"attestation_state":"computed","paper":{"title":"4-Bit High-Speed Binary Ling Adder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Projjal Gupta","submitted_at":"2019-08-25T10:37:29Z","abstract_excerpt":"Binary addition is one of the most primitive and most commonly used applications in computer arithmetic. A large variety of algorithms and implementations have been proposed for binary addition. Huey Ling proposed a simpler form of CLA equations which rely on adjacent pair bits. Along with bit generate and bit propagate, we introduce another prefix bit, the half sum bit. Ling adder increases the speed of n-bit binary addition, which is an upgrade from the existing Carry-Look-Ahead adder. Several variants of the carry look-ahead equations, like Ling carries, have been presented that simplify ca"},"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":"1908.09297","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2019-08-25T10:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"aa1ac9d5adaaf52ec3c70dd52018848b2046b8268261b6f1e9535dc7e68380ef","abstract_canon_sha256":"6449bfa24d9a6c00d3dab0d74eb5670b86202d7033ea50c6e67bdfdb57b16cb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:10.215001Z","signature_b64":"yu+UGHhkn75k3FKkLRbOaBn3yNqh2yJDLWRW9Ag1nNlr7/GNHVkCHut/HjpZnEr7ArAKxjsBIcsNSQCVcWAhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5932e5c70d0b3b051db95db703770e2eb69734e99828e5f2a2cff4308d23e016","last_reissued_at":"2026-07-05T00:00:10.214652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:10.214652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"4-Bit High-Speed Binary Ling Adder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Projjal Gupta","submitted_at":"2019-08-25T10:37:29Z","abstract_excerpt":"Binary addition is one of the most primitive and most commonly used applications in computer arithmetic. A large variety of algorithms and implementations have been proposed for binary addition. Huey Ling proposed a simpler form of CLA equations which rely on adjacent pair bits. Along with bit generate and bit propagate, we introduce another prefix bit, the half sum bit. Ling adder increases the speed of n-bit binary addition, which is an upgrade from the existing Carry-Look-Ahead adder. Several variants of the carry look-ahead equations, like Ling carries, have been presented that simplify ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09297","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.09297/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.09297","created_at":"2026-07-05T00:00:10.214708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09297v1","created_at":"2026-07-05T00:00:10.214708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09297","created_at":"2026-07-05T00:00:10.214708+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEZOLRYNBM5Q","created_at":"2026-07-05T00:00:10.214708+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEZOLRYNBM5QKHNZ","created_at":"2026-07-05T00:00:10.214708+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEZOLRYN","created_at":"2026-07-05T00:00:10.214708+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/LEZOLRYNBM5QKHNZLW3QG5YOF2","json":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2.json","graph_json":"https://pith.science/api/pith-number/LEZOLRYNBM5QKHNZLW3QG5YOF2/graph.json","events_json":"https://pith.science/api/pith-number/LEZOLRYNBM5QKHNZLW3QG5YOF2/events.json","paper":"https://pith.science/paper/LEZOLRYN"},"agent_actions":{"view_html":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2","download_json":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2.json","view_paper":"https://pith.science/paper/LEZOLRYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09297&json=true","fetch_graph":"https://pith.science/api/pith-number/LEZOLRYNBM5QKHNZLW3QG5YOF2/graph.json","fetch_events":"https://pith.science/api/pith-number/LEZOLRYNBM5QKHNZLW3QG5YOF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2/action/storage_attestation","attest_author":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2/action/author_attestation","sign_citation":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2/action/citation_signature","submit_replication":"https://pith.science/pith/LEZOLRYNBM5QKHNZLW3QG5YOF2/action/replication_record"}},"created_at":"2026-07-05T00:00:10.214708+00:00","updated_at":"2026-07-05T00:00:10.214708+00:00"}