{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OFYVPRHQ5IYLDU3I2ZQAAH3C5N","short_pith_number":"pith:OFYVPRHQ","schema_version":"1.0","canonical_sha256":"717157c4f0ea30b1d368d660001f62eb6e740b343721ca218108eec2ebbe91fe","source":{"kind":"arxiv","id":"1502.07616","version":1},"attestation_state":"computed","paper":{"title":"A short proof that the number of division steps in the Euclidean algorithm is normally distributed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.DS","authors_text":"Ian D. Morris","submitted_at":"2015-02-26T16:11:43Z","abstract_excerpt":"D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a normal distribution in the limit as n tends to infinity. V. Baladi and B. Vall\\'ee subsequently gave an alternative proof for both the classical Euclidean algorithm and several of its close variants, based on a detailed investigation of spectral properties of the transfer operator associated to the Gauss map, building on deep results of D. Dolgopyat. In this article we give a much shorter, albeit less quantitative, proo"},"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":"1502.07616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-02-26T16:11:43Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"678600e52950b2c6458c25a6651cd5cd7ca17bbe510688e05a0a76a016534eed","abstract_canon_sha256":"d104db9e5c82de1df1064e4ed4db2de147c2ec1e078733f03052bbbb6138f7b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:03.284471Z","signature_b64":"Tlka4rW8ZjgeU//wS16DJsCJ4uOS9i5IDkdtPaJbQCc1g+cZnDvc/XZgLxvII2BFYyNF0arNieWWTiYZF37jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"717157c4f0ea30b1d368d660001f62eb6e740b343721ca218108eec2ebbe91fe","last_reissued_at":"2026-05-18T02:26:03.284028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:03.284028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof that the number of division steps in the Euclidean algorithm is normally distributed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.DS","authors_text":"Ian D. Morris","submitted_at":"2015-02-26T16:11:43Z","abstract_excerpt":"D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a normal distribution in the limit as n tends to infinity. V. Baladi and B. Vall\\'ee subsequently gave an alternative proof for both the classical Euclidean algorithm and several of its close variants, based on a detailed investigation of spectral properties of the transfer operator associated to the Gauss map, building on deep results of D. Dolgopyat. In this article we give a much shorter, albeit less quantitative, proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07616","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":"1502.07616","created_at":"2026-05-18T02:26:03.284097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07616v1","created_at":"2026-05-18T02:26:03.284097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07616","created_at":"2026-05-18T02:26:03.284097+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFYVPRHQ5IYL","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFYVPRHQ5IYLDU3I","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFYVPRHQ","created_at":"2026-05-18T12:29:34.919912+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/OFYVPRHQ5IYLDU3I2ZQAAH3C5N","json":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N.json","graph_json":"https://pith.science/api/pith-number/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/graph.json","events_json":"https://pith.science/api/pith-number/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/events.json","paper":"https://pith.science/paper/OFYVPRHQ"},"agent_actions":{"view_html":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N","download_json":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N.json","view_paper":"https://pith.science/paper/OFYVPRHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07616&json=true","fetch_graph":"https://pith.science/api/pith-number/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/graph.json","fetch_events":"https://pith.science/api/pith-number/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/action/storage_attestation","attest_author":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/action/author_attestation","sign_citation":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/action/citation_signature","submit_replication":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/action/replication_record"}},"created_at":"2026-05-18T02:26:03.284097+00:00","updated_at":"2026-05-18T02:26:03.284097+00:00"}