{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DPTH3XPA566ZBDMSCAGUQRYPZN","short_pith_number":"pith:DPTH3XPA","schema_version":"1.0","canonical_sha256":"1be67ddde0efbd908d92100d48470fcb4dcfa793c2ff27005a771271baf6179c","source":{"kind":"arxiv","id":"1509.04516","version":1},"attestation_state":"computed","paper":{"title":"Random walk with random resetting to the maximum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Gregory Schehr, Sanjib Sabhapandit, Satya N. Majumdar","submitted_at":"2015-09-15T12:22:40Z","abstract_excerpt":"We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with probability $(1-r)$, it undergoes symmetric random walk, i.e., it hops to one of its neighboring sites, with equal probability $(1-r)/2$. For $r=0$, it reduces to a standard random walk whose typical distance grows as $\\sqrt{n}$ for large $n$. In presence of a nonzero resetting rate $0<r\\le 1$, we find that both the average maximum and the average position grow ba"},"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":"1509.04516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-09-15T12:22:40Z","cross_cats_sorted":[],"title_canon_sha256":"bdf593fccaf720725d08a01a56bf5396e07f93da2d53ea80e5c93fdd65616717","abstract_canon_sha256":"390759340adc8f00c09f2c8f124dc9ee8f0318fab16e5701784cf7fabe58cffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:54.898513Z","signature_b64":"JSyy7EyWYqvvYCf+Ctk4ncmpy5FtjjOXWnmS92op2OnafseWIz06aTPxBHCl88+ZxB198jJLEwTL1CCvr+yWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1be67ddde0efbd908d92100d48470fcb4dcfa793c2ff27005a771271baf6179c","last_reissued_at":"2026-05-18T01:25:54.898062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:54.898062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random walk with random resetting to the maximum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Gregory Schehr, Sanjib Sabhapandit, Satya N. Majumdar","submitted_at":"2015-09-15T12:22:40Z","abstract_excerpt":"We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with probability $(1-r)$, it undergoes symmetric random walk, i.e., it hops to one of its neighboring sites, with equal probability $(1-r)/2$. For $r=0$, it reduces to a standard random walk whose typical distance grows as $\\sqrt{n}$ for large $n$. In presence of a nonzero resetting rate $0<r\\le 1$, we find that both the average maximum and the average position grow ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04516","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":"1509.04516","created_at":"2026-05-18T01:25:54.898127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04516v1","created_at":"2026-05-18T01:25:54.898127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04516","created_at":"2026-05-18T01:25:54.898127+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPTH3XPA566Z","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPTH3XPA566ZBDMS","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPTH3XPA","created_at":"2026-05-18T12:29:17.054201+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/DPTH3XPA566ZBDMSCAGUQRYPZN","json":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN.json","graph_json":"https://pith.science/api/pith-number/DPTH3XPA566ZBDMSCAGUQRYPZN/graph.json","events_json":"https://pith.science/api/pith-number/DPTH3XPA566ZBDMSCAGUQRYPZN/events.json","paper":"https://pith.science/paper/DPTH3XPA"},"agent_actions":{"view_html":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN","download_json":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN.json","view_paper":"https://pith.science/paper/DPTH3XPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04516&json=true","fetch_graph":"https://pith.science/api/pith-number/DPTH3XPA566ZBDMSCAGUQRYPZN/graph.json","fetch_events":"https://pith.science/api/pith-number/DPTH3XPA566ZBDMSCAGUQRYPZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN/action/storage_attestation","attest_author":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN/action/author_attestation","sign_citation":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN/action/citation_signature","submit_replication":"https://pith.science/pith/DPTH3XPA566ZBDMSCAGUQRYPZN/action/replication_record"}},"created_at":"2026-05-18T01:25:54.898127+00:00","updated_at":"2026-05-18T01:25:54.898127+00:00"}