{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OFYVPRHQ5IYLDU3I2ZQAAH3C5N","short_pith_number":"pith:OFYVPRHQ","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"},"canonical_sha256":"717157c4f0ea30b1d368d660001f62eb6e740b343721ca218108eec2ebbe91fe","source":{"kind":"arxiv","id":"1502.07616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07616","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07616v1","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07616","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"OFYVPRHQ5IYL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OFYVPRHQ5IYLDU3I","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OFYVPRHQ","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OFYVPRHQ5IYLDU3I2ZQAAH3C5N","target":"record","payload":{"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"},"canonical_sha256":"717157c4f0ea30b1d368d660001f62eb6e740b343721ca218108eec2ebbe91fe","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"},"source_kind":"arxiv","source_id":"1502.07616","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lL4gaj5aYePs4X7JzN51gQPhLUoD7YtgQKSxyru+m0+SMKMDxbhbxYpIQcNxIf3Z0uiMqUqocR900D+HDyEMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:52:27.145718Z"},"content_sha256":"959e3b44d48311b08bd84c0cf8dab01810df1d7e765f790c532c1766b7b620fd","schema_version":"1.0","event_id":"sha256:959e3b44d48311b08bd84c0cf8dab01810df1d7e765f790c532c1766b7b620fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OFYVPRHQ5IYLDU3I2ZQAAH3C5N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCugDayrzW9wcnAm3RP236zGwi0gu/te7TeO0QO0+DWvzPz+wZHh/alWK7HoTs3wnwpDzd2AcfJSCmloKBvFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:52:27.146084Z"},"content_sha256":"7f26f050790157596e65b9b12fa6fa2725e83d670926c5bd5338b594296e4a54","schema_version":"1.0","event_id":"sha256:7f26f050790157596e65b9b12fa6fa2725e83d670926c5bd5338b594296e4a54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/bundle.json","state_url":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T06:52:27Z","links":{"resolver":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N","bundle":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/bundle.json","state":"https://pith.science/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFYVPRHQ5IYLDU3I2ZQAAH3C5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OFYVPRHQ5IYLDU3I2ZQAAH3C5N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d104db9e5c82de1df1064e4ed4db2de147c2ec1e078733f03052bbbb6138f7b7","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-02-26T16:11:43Z","title_canon_sha256":"678600e52950b2c6458c25a6651cd5cd7ca17bbe510688e05a0a76a016534eed"},"schema_version":"1.0","source":{"id":"1502.07616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07616","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07616v1","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07616","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"OFYVPRHQ5IYL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OFYVPRHQ5IYLDU3I","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OFYVPRHQ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:7f26f050790157596e65b9b12fa6fa2725e83d670926c5bd5338b594296e4a54","target":"graph","created_at":"2026-05-18T02:26:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ian D. Morris","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-02-26T16:11:43Z","title":"A short proof that the number of division steps in the Euclidean algorithm is normally distributed"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07616","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:959e3b44d48311b08bd84c0cf8dab01810df1d7e765f790c532c1766b7b620fd","target":"record","created_at":"2026-05-18T02:26:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d104db9e5c82de1df1064e4ed4db2de147c2ec1e078733f03052bbbb6138f7b7","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-02-26T16:11:43Z","title_canon_sha256":"678600e52950b2c6458c25a6651cd5cd7ca17bbe510688e05a0a76a016534eed"},"schema_version":"1.0","source":{"id":"1502.07616","kind":"arxiv","version":1}},"canonical_sha256":"717157c4f0ea30b1d368d660001f62eb6e740b343721ca218108eec2ebbe91fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"717157c4f0ea30b1d368d660001f62eb6e740b343721ca218108eec2ebbe91fe","first_computed_at":"2026-05-18T02:26:03.284028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:03.284028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tlka4rW8ZjgeU//wS16DJsCJ4uOS9i5IDkdtPaJbQCc1g+cZnDvc/XZgLxvII2BFYyNF0arNieWWTiYZF37jCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:03.284471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:959e3b44d48311b08bd84c0cf8dab01810df1d7e765f790c532c1766b7b620fd","sha256:7f26f050790157596e65b9b12fa6fa2725e83d670926c5bd5338b594296e4a54"],"state_sha256":"ff3e0913b2487023b5bcc2de2b5efdf571737b07638c107144e50fdc73bf9ba6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aphN/zoq2hCstXXV+wL2p1Glzz1sIy8ERYt5X4mrOMCT90K0Qpr4h1Ljkw830gzTkIhYxRZO0FFwrOcrein3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:52:27.148047Z","bundle_sha256":"b1d2ad2d3e7c716d3f21ba388ddb74c0efa403738fce13062be3dd3d7f32a0e4"}}