{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CBXRNGRZXCBA3QXOP7HNQMUODY","short_pith_number":"pith:CBXRNGRZ","schema_version":"1.0","canonical_sha256":"106f169a39b8820dc2ee7fced8328e1e2cd03d47b995c51b8ab725d4312b288a","source":{"kind":"arxiv","id":"1503.08659","version":3},"attestation_state":"computed","paper":{"title":"Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.AR","authors_text":"Sophie Theresa Spirkl, Stephan Held","submitted_at":"2015-03-30T13:02:53Z","abstract_excerpt":"We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two $n$-bit numbers (where $n$ is a power of two) with a depth of $2\\log_2 n$ logic gates, size $4 n\\log_2 n$, and all fan-outs bounded by two. Fan-outs of more than two are avoided, because they lead to the insertion of repeaters for repowering the signal and additional depth in the physical implementation. However, the depth bound of the Kogge-Stone adder is off by a factor of two from the lower b"},"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":"1503.08659","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-03-30T13:02:53Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"cda70e1fac012e2e6054084b7a89c1ff97269be71a90dedcfbb48cc8773c5be6","abstract_canon_sha256":"259dc2b7dcd255983d6645a854197e4c4cd33f3746b0c11667b5a62eb38e628e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:34.592087Z","signature_b64":"M9DZR1KzcvXLdMB2pM/0Z0xFNa5rqwAT6ZOwgCtUURjRUn2Z2HMXcCuodDe3PVESDvjSPYCMrpWG8UB2LpklAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"106f169a39b8820dc2ee7fced8328e1e2cd03d47b995c51b8ab725d4312b288a","last_reissued_at":"2026-05-18T00:52:34.591660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:34.591660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.AR","authors_text":"Sophie Theresa Spirkl, Stephan Held","submitted_at":"2015-03-30T13:02:53Z","abstract_excerpt":"We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two $n$-bit numbers (where $n$ is a power of two) with a depth of $2\\log_2 n$ logic gates, size $4 n\\log_2 n$, and all fan-outs bounded by two. Fan-outs of more than two are avoided, because they lead to the insertion of repeaters for repowering the signal and additional depth in the physical implementation. However, the depth bound of the Kogge-Stone adder is off by a factor of two from the lower b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08659","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.08659","created_at":"2026-05-18T00:52:34.591721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08659v3","created_at":"2026-05-18T00:52:34.591721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08659","created_at":"2026-05-18T00:52:34.591721+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBXRNGRZXCBA","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBXRNGRZXCBA3QXO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBXRNGRZ","created_at":"2026-05-18T12:29:14.074870+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/CBXRNGRZXCBA3QXOP7HNQMUODY","json":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY.json","graph_json":"https://pith.science/api/pith-number/CBXRNGRZXCBA3QXOP7HNQMUODY/graph.json","events_json":"https://pith.science/api/pith-number/CBXRNGRZXCBA3QXOP7HNQMUODY/events.json","paper":"https://pith.science/paper/CBXRNGRZ"},"agent_actions":{"view_html":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY","download_json":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY.json","view_paper":"https://pith.science/paper/CBXRNGRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08659&json=true","fetch_graph":"https://pith.science/api/pith-number/CBXRNGRZXCBA3QXOP7HNQMUODY/graph.json","fetch_events":"https://pith.science/api/pith-number/CBXRNGRZXCBA3QXOP7HNQMUODY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY/action/storage_attestation","attest_author":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY/action/author_attestation","sign_citation":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY/action/citation_signature","submit_replication":"https://pith.science/pith/CBXRNGRZXCBA3QXOP7HNQMUODY/action/replication_record"}},"created_at":"2026-05-18T00:52:34.591721+00:00","updated_at":"2026-05-18T00:52:34.591721+00:00"}