{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:5J3JEZB72GXOPMRFMSW4SKRVN3","short_pith_number":"pith:5J3JEZB7","schema_version":"1.0","canonical_sha256":"ea7692643fd1aee7b22564adc92a356ee3f56ffc8b519ca653c97f3f6ddc0064","source":{"kind":"arxiv","id":"0801.4040","version":2},"attestation_state":"computed","paper":{"title":"Carry Propagation in Multiplication by Constants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alice Izsak, Nicholas Pippenger","submitted_at":"2008-01-25T22:31:41Z","abstract_excerpt":"Suppose that a random n-bit number V is multiplied by an odd constant M, greater than or equal to 3, by adding shifted versions of the number V corresponding to the 1s in the binary representation of the constant M. Suppose further that the additions are performed by carry-save adders until the number of summands is reduced to two, at which time the final addition is performed by a carry-propagate adder. We show that in this situation the distribution of the length of the longest carry-propagation chain in the final addition is the same (up to terms tending to 0 as n tends to infinity) as when"},"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":"0801.4040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-01-25T22:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"358b5e4fa84f8461080f576f316f94b04f96f851887fae6b4bd0ae8242a5f8e2","abstract_canon_sha256":"be3285988781ec54850d92879c3c5def383bd814208c0e824730e15b2395d6ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.590771Z","signature_b64":"4MOb5oRf3LkexdqZmR4HjcEavY3znM9zSvIeEZso6ltAzQD21GCIN6OaWXacYgrEPbn19zZFR8DCKm1wLsr4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea7692643fd1aee7b22564adc92a356ee3f56ffc8b519ca653c97f3f6ddc0064","last_reissued_at":"2026-05-18T01:19:35.590288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.590288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Carry Propagation in Multiplication by Constants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alice Izsak, Nicholas Pippenger","submitted_at":"2008-01-25T22:31:41Z","abstract_excerpt":"Suppose that a random n-bit number V is multiplied by an odd constant M, greater than or equal to 3, by adding shifted versions of the number V corresponding to the 1s in the binary representation of the constant M. Suppose further that the additions are performed by carry-save adders until the number of summands is reduced to two, at which time the final addition is performed by a carry-propagate adder. We show that in this situation the distribution of the length of the longest carry-propagation chain in the final addition is the same (up to terms tending to 0 as n tends to infinity) as when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.4040","kind":"arxiv","version":2},"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":"0801.4040","created_at":"2026-05-18T01:19:35.590361+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.4040v2","created_at":"2026-05-18T01:19:35.590361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.4040","created_at":"2026-05-18T01:19:35.590361+00:00"},{"alias_kind":"pith_short_12","alias_value":"5J3JEZB72GXO","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"5J3JEZB72GXOPMRF","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"5J3JEZB7","created_at":"2026-05-18T12:25:56.245647+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/5J3JEZB72GXOPMRFMSW4SKRVN3","json":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3.json","graph_json":"https://pith.science/api/pith-number/5J3JEZB72GXOPMRFMSW4SKRVN3/graph.json","events_json":"https://pith.science/api/pith-number/5J3JEZB72GXOPMRFMSW4SKRVN3/events.json","paper":"https://pith.science/paper/5J3JEZB7"},"agent_actions":{"view_html":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3","download_json":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3.json","view_paper":"https://pith.science/paper/5J3JEZB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.4040&json=true","fetch_graph":"https://pith.science/api/pith-number/5J3JEZB72GXOPMRFMSW4SKRVN3/graph.json","fetch_events":"https://pith.science/api/pith-number/5J3JEZB72GXOPMRFMSW4SKRVN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3/action/storage_attestation","attest_author":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3/action/author_attestation","sign_citation":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3/action/citation_signature","submit_replication":"https://pith.science/pith/5J3JEZB72GXOPMRFMSW4SKRVN3/action/replication_record"}},"created_at":"2026-05-18T01:19:35.590361+00:00","updated_at":"2026-05-18T01:19:35.590361+00:00"}