{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3GPD5EZARRNF7AUXNCRKEBPI34","short_pith_number":"pith:3GPD5EZA","schema_version":"1.0","canonical_sha256":"d99e3e93208c5a5f829768a2a205e8df15d6e1284f62c1d4fe316b88f2257132","source":{"kind":"arxiv","id":"1007.4870","version":3},"attestation_state":"computed","paper":{"title":"(Very) short proof of Rayleigh's Theorem (and extensions)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Olivier Bernardi (MIT)","submitted_at":"2010-07-28T04:29:33Z","abstract_excerpt":"Consider a walk in the plane made of $n$ unit steps, with directions chosen independently and uniformly at random at each step. Rayleigh's theorem asserts that the probability for such a walk to end at a distance less than 1 from its starting point is $1/(n+1)$. We give an elementary proof of this result. We also prove the following generalization valid for any probability distribution $\\mu$ on the positive real numbers: if two walkers start at the same point and make respectively $m$ and $n$ independent steps with uniformly random directions and with lengths chosen according to $\\mu$, then th"},"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":"1007.4870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-28T04:29:33Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ded27db782ff81d3b495f0f6f47d03a34f9ad9d9aad46257c7f31d08b163a4f9","abstract_canon_sha256":"04a2eae64fc2db6ade2d39b99af9238f322bfc627982f29536f8253bd38ec5c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:52.553510Z","signature_b64":"Y77T3vX91BRjor8hw0KRLR2gCkRyCtLjKBiv2E3bS2/p5utz3JPGimRWDQW7jsgjPglLr2BPoWuEuKKDuslvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d99e3e93208c5a5f829768a2a205e8df15d6e1284f62c1d4fe316b88f2257132","last_reissued_at":"2026-05-18T03:53:52.552876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:52.552876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Very) short proof of Rayleigh's Theorem (and extensions)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Olivier Bernardi (MIT)","submitted_at":"2010-07-28T04:29:33Z","abstract_excerpt":"Consider a walk in the plane made of $n$ unit steps, with directions chosen independently and uniformly at random at each step. Rayleigh's theorem asserts that the probability for such a walk to end at a distance less than 1 from its starting point is $1/(n+1)$. We give an elementary proof of this result. We also prove the following generalization valid for any probability distribution $\\mu$ on the positive real numbers: if two walkers start at the same point and make respectively $m$ and $n$ independent steps with uniformly random directions and with lengths chosen according to $\\mu$, then th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4870","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":"1007.4870","created_at":"2026-05-18T03:53:52.552964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4870v3","created_at":"2026-05-18T03:53:52.552964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4870","created_at":"2026-05-18T03:53:52.552964+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GPD5EZARRNF","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GPD5EZARRNF7AUX","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GPD5EZA","created_at":"2026-05-18T12:26:03.138858+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/3GPD5EZARRNF7AUXNCRKEBPI34","json":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34.json","graph_json":"https://pith.science/api/pith-number/3GPD5EZARRNF7AUXNCRKEBPI34/graph.json","events_json":"https://pith.science/api/pith-number/3GPD5EZARRNF7AUXNCRKEBPI34/events.json","paper":"https://pith.science/paper/3GPD5EZA"},"agent_actions":{"view_html":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34","download_json":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34.json","view_paper":"https://pith.science/paper/3GPD5EZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4870&json=true","fetch_graph":"https://pith.science/api/pith-number/3GPD5EZARRNF7AUXNCRKEBPI34/graph.json","fetch_events":"https://pith.science/api/pith-number/3GPD5EZARRNF7AUXNCRKEBPI34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34/action/storage_attestation","attest_author":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34/action/author_attestation","sign_citation":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34/action/citation_signature","submit_replication":"https://pith.science/pith/3GPD5EZARRNF7AUXNCRKEBPI34/action/replication_record"}},"created_at":"2026-05-18T03:53:52.552964+00:00","updated_at":"2026-05-18T03:53:52.552964+00:00"}