{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SZDKSPYZ6S7EMH4IGPMMXYV7IB","short_pith_number":"pith:SZDKSPYZ","schema_version":"1.0","canonical_sha256":"9646a93f19f4be461f8833d8cbe2bf4059b02fb1ac68a5420396f1ab0bdb5174","source":{"kind":"arxiv","id":"2505.05921","version":2},"attestation_state":"computed","paper":{"title":"Limit Theorems for step reinforced random walks with regularly varying memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Aritra Majumdar, Krishanu Maulik","submitted_at":"2025-05-09T09:49:32Z","abstract_excerpt":"For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a regularly varying sequence $\\{\\mu_n\\}$ of index $\\gamma>-1$; recalls and repeats the step taken with probability $p$, or with probability $1-p$ takes a fresh step from the innovation sequence. The innovation sequence is assumed to be i.i.d.\\ with mean zero. We study the corresponding step reinforced random walk process with linearly scaled time as an r.c.l."},"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":"2505.05921","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-05-09T09:49:32Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"c7befad38a88eff4d8aba799ec7da50246f97809f504c14d20ab5577dcb0c9ca","abstract_canon_sha256":"29ce2e5bc9f84c63811c04b722d27d59c293b9e0da811430b72960937eec8617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:04.419450Z","signature_b64":"Fc0lSgQHtMPfmY7Zk/rv+3pZfgxbs3NHO/VP0kDz7Cj9MWmkv7qZxsO3+bhtwrHrfzcAJoQFkg9eYr8Ynx0vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9646a93f19f4be461f8833d8cbe2bf4059b02fb1ac68a5420396f1ab0bdb5174","last_reissued_at":"2026-06-03T01:05:04.418902Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:04.418902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit Theorems for step reinforced random walks with regularly varying memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Aritra Majumdar, Krishanu Maulik","submitted_at":"2025-05-09T09:49:32Z","abstract_excerpt":"For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a regularly varying sequence $\\{\\mu_n\\}$ of index $\\gamma>-1$; recalls and repeats the step taken with probability $p$, or with probability $1-p$ takes a fresh step from the innovation sequence. The innovation sequence is assumed to be i.i.d.\\ with mean zero. We study the corresponding step reinforced random walk process with linearly scaled time as an r.c.l."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05921","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/2505.05921/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":"2505.05921","created_at":"2026-06-03T01:05:04.418963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05921v2","created_at":"2026-06-03T01:05:04.418963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05921","created_at":"2026-06-03T01:05:04.418963+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZDKSPYZ6S7E","created_at":"2026-06-03T01:05:04.418963+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZDKSPYZ6S7EMH4I","created_at":"2026-06-03T01:05:04.418963+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZDKSPYZ","created_at":"2026-06-03T01:05:04.418963+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06478","citing_title":"Elephant Random Walk with multiple extractions","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB","json":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB.json","graph_json":"https://pith.science/api/pith-number/SZDKSPYZ6S7EMH4IGPMMXYV7IB/graph.json","events_json":"https://pith.science/api/pith-number/SZDKSPYZ6S7EMH4IGPMMXYV7IB/events.json","paper":"https://pith.science/paper/SZDKSPYZ"},"agent_actions":{"view_html":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB","download_json":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB.json","view_paper":"https://pith.science/paper/SZDKSPYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05921&json=true","fetch_graph":"https://pith.science/api/pith-number/SZDKSPYZ6S7EMH4IGPMMXYV7IB/graph.json","fetch_events":"https://pith.science/api/pith-number/SZDKSPYZ6S7EMH4IGPMMXYV7IB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB/action/storage_attestation","attest_author":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB/action/author_attestation","sign_citation":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB/action/citation_signature","submit_replication":"https://pith.science/pith/SZDKSPYZ6S7EMH4IGPMMXYV7IB/action/replication_record"}},"created_at":"2026-06-03T01:05:04.418963+00:00","updated_at":"2026-06-03T01:05:04.418963+00:00"}