{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A6XNNAE42JTJM6533GADJEYZ2U","short_pith_number":"pith:A6XNNAE4","schema_version":"1.0","canonical_sha256":"07aed6809cd266967bbbd980349319d523d1043612bdc24b15f16983c1810eec","source":{"kind":"arxiv","id":"2005.11135","version":2},"attestation_state":"computed","paper":{"title":"Almost sure behavior of linearly edge-reinforced random walks on the half-line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Masato Takei","submitted_at":"2020-05-22T12:23:24Z","abstract_excerpt":"We study linearly edge-reinforced random walks on $\\mathbb{Z}_+$, where each edge $\\{x,x+1\\}$ has the initial weight $x^{\\alpha} \\vee 1$, and each time an edge is traversed, its weight is increased by $\\Delta$. It is known that the walk is recurrent if and only if $\\alpha \\leq 1$. The aim of this paper is to study the almost sure behavior of the walk in the recurrent regime. For $\\alpha<1$ and $\\Delta>0$, we obtain a limit theorem which is a counterpart of the law of the iterated logarithm for simple random walks. This reveals that the speed of the walk with $\\Delta>0$ is much slower than $\\De"},"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":"2005.11135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-05-22T12:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"746be206f77f127c94f9bcfd59d3eec330b08608d23e71203a4aeee3e1a24b2b","abstract_canon_sha256":"97983c852999dcb2d69da71765d6b193a8dc337d1b528f486b32cc49be8d0078"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:01.949654Z","signature_b64":"ZuBU5w1Fd8qniS0g9IgK18IaGRUbHN2AcZiIPC708cfGh+0o+lSIj4OgC0dXyN8Ap95yaWSl9ley/WB9bQ4AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07aed6809cd266967bbbd980349319d523d1043612bdc24b15f16983c1810eec","last_reissued_at":"2026-07-05T01:22:01.949213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:01.949213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost sure behavior of linearly edge-reinforced random walks on the half-line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Masato Takei","submitted_at":"2020-05-22T12:23:24Z","abstract_excerpt":"We study linearly edge-reinforced random walks on $\\mathbb{Z}_+$, where each edge $\\{x,x+1\\}$ has the initial weight $x^{\\alpha} \\vee 1$, and each time an edge is traversed, its weight is increased by $\\Delta$. It is known that the walk is recurrent if and only if $\\alpha \\leq 1$. The aim of this paper is to study the almost sure behavior of the walk in the recurrent regime. For $\\alpha<1$ and $\\Delta>0$, we obtain a limit theorem which is a counterpart of the law of the iterated logarithm for simple random walks. This reveals that the speed of the walk with $\\Delta>0$ is much slower than $\\De"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11135","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.11135/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.11135","created_at":"2026-07-05T01:22:01.949274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.11135v2","created_at":"2026-07-05T01:22:01.949274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11135","created_at":"2026-07-05T01:22:01.949274+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6XNNAE42JTJ","created_at":"2026-07-05T01:22:01.949274+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6XNNAE42JTJM653","created_at":"2026-07-05T01:22:01.949274+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6XNNAE4","created_at":"2026-07-05T01:22:01.949274+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/A6XNNAE42JTJM6533GADJEYZ2U","json":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U.json","graph_json":"https://pith.science/api/pith-number/A6XNNAE42JTJM6533GADJEYZ2U/graph.json","events_json":"https://pith.science/api/pith-number/A6XNNAE42JTJM6533GADJEYZ2U/events.json","paper":"https://pith.science/paper/A6XNNAE4"},"agent_actions":{"view_html":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U","download_json":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U.json","view_paper":"https://pith.science/paper/A6XNNAE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.11135&json=true","fetch_graph":"https://pith.science/api/pith-number/A6XNNAE42JTJM6533GADJEYZ2U/graph.json","fetch_events":"https://pith.science/api/pith-number/A6XNNAE42JTJM6533GADJEYZ2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U/action/storage_attestation","attest_author":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U/action/author_attestation","sign_citation":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U/action/citation_signature","submit_replication":"https://pith.science/pith/A6XNNAE42JTJM6533GADJEYZ2U/action/replication_record"}},"created_at":"2026-07-05T01:22:01.949274+00:00","updated_at":"2026-07-05T01:22:01.949274+00:00"}