{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VW62I6L4J2OLFDAQX5ZBPEZGGE","short_pith_number":"pith:VW62I6L4","schema_version":"1.0","canonical_sha256":"adbda4797c4e9cb28c10bf72179326312e616c971a4d18fa2ff23ec046173026","source":{"kind":"arxiv","id":"1008.1701","version":1},"attestation_state":"computed","paper":{"title":"An elementary approach to Brownian local time based on simple, symmetric random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Balazs Szekely, Tamas Szabados","submitted_at":"2010-08-10T12:15:38Z","abstract_excerpt":"In this paper we define Brownian local time as the almost sure limit of the local times of a nested sequence of simple, symmetric random walks. The limit is jointly continuous in $(t,x)$. The rate of convergence is $n^{\\frac14} (\\log n)^{\\frac34}$ that is close to the best possible. The tools we apply are almost exclusively from elementary probability theory."},"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":"1008.1701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-08-10T12:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"5630e36c4e4807b91a729442392073e1be8fb3702d5d2d31ae9c8400b63891dd","abstract_canon_sha256":"098deda1f0039780a1e985b3d695c1c2c3b2dc27ade2302ee91045c30efb3503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.450747Z","signature_b64":"QD+ae9TKjf7lIkYn+nJUk/KUGsM7avVaJ2zvK/Cljp36RV80ETdA/Wzp4zUNW4QwO9q1eEYARRr106dn/GDDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adbda4797c4e9cb28c10bf72179326312e616c971a4d18fa2ff23ec046173026","last_reissued_at":"2026-05-18T04:42:23.450334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.450334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An elementary approach to Brownian local time based on simple, symmetric random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Balazs Szekely, Tamas Szabados","submitted_at":"2010-08-10T12:15:38Z","abstract_excerpt":"In this paper we define Brownian local time as the almost sure limit of the local times of a nested sequence of simple, symmetric random walks. The limit is jointly continuous in $(t,x)$. The rate of convergence is $n^{\\frac14} (\\log n)^{\\frac34}$ that is close to the best possible. The tools we apply are almost exclusively from elementary probability theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1701","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":"1008.1701","created_at":"2026-05-18T04:42:23.450399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1701v1","created_at":"2026-05-18T04:42:23.450399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1701","created_at":"2026-05-18T04:42:23.450399+00:00"},{"alias_kind":"pith_short_12","alias_value":"VW62I6L4J2OL","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VW62I6L4J2OLFDAQ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VW62I6L4","created_at":"2026-05-18T12:26:15.391820+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/VW62I6L4J2OLFDAQX5ZBPEZGGE","json":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE.json","graph_json":"https://pith.science/api/pith-number/VW62I6L4J2OLFDAQX5ZBPEZGGE/graph.json","events_json":"https://pith.science/api/pith-number/VW62I6L4J2OLFDAQX5ZBPEZGGE/events.json","paper":"https://pith.science/paper/VW62I6L4"},"agent_actions":{"view_html":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE","download_json":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE.json","view_paper":"https://pith.science/paper/VW62I6L4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1701&json=true","fetch_graph":"https://pith.science/api/pith-number/VW62I6L4J2OLFDAQX5ZBPEZGGE/graph.json","fetch_events":"https://pith.science/api/pith-number/VW62I6L4J2OLFDAQX5ZBPEZGGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE/action/storage_attestation","attest_author":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE/action/author_attestation","sign_citation":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE/action/citation_signature","submit_replication":"https://pith.science/pith/VW62I6L4J2OLFDAQX5ZBPEZGGE/action/replication_record"}},"created_at":"2026-05-18T04:42:23.450399+00:00","updated_at":"2026-05-18T04:42:23.450399+00:00"}