{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6ARJDVZJNZ5PLJWBWAASQY6NN2","short_pith_number":"pith:6ARJDVZJ","schema_version":"1.0","canonical_sha256":"f02291d7296e7af5a6c1b0012863cd6e8b52ed004f1bce884f4f72bb2e772f9e","source":{"kind":"arxiv","id":"2412.17994","version":1},"attestation_state":"computed","paper":{"title":"Exact closed-form recurrence probabilities for biased random walks at any step number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cond-mat.stat-mech","authors_text":"Debendro Mookerjee, Sarah Kostinski","submitted_at":"2024-12-23T21:31:23Z","abstract_excerpt":"We report on a closed-form expression for the survival probability of a discrete 1D biased random walk to not return to its origin after N steps. Our expression is exact for any N, including the elusive intermediate range, thereby allowing one to study its convergence to the large N limit. In that limit we recover Polya's recurrence probability, i.e. the survival probability equals the magnitude of the bias. We then obtain a closed-form expression for the probability of last return. In contrast to the bimodal behavior for the unbiased case, we show that the probability of last return decays mo"},"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":"2412.17994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-12-23T21:31:23Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"f4354b111dbeb890efe24ad146ee2954e0a9cf0fb57804e966889c21f7b260c2","abstract_canon_sha256":"a36a59d7fecac8b99b2253d0542c0c09cc1050b1b1da541483515add942734d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:32.083439Z","signature_b64":"WDA5KFeKCy0EUrQM6J7Cea4ZDWd9mUlo8gsVVvNEGFrbLh9TTr4MMuxdbDzCnG7yF3XAE9dDG8Yj7qK7RizCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f02291d7296e7af5a6c1b0012863cd6e8b52ed004f1bce884f4f72bb2e772f9e","last_reissued_at":"2026-07-05T09:53:32.083006Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:32.083006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact closed-form recurrence probabilities for biased random walks at any step number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cond-mat.stat-mech","authors_text":"Debendro Mookerjee, Sarah Kostinski","submitted_at":"2024-12-23T21:31:23Z","abstract_excerpt":"We report on a closed-form expression for the survival probability of a discrete 1D biased random walk to not return to its origin after N steps. Our expression is exact for any N, including the elusive intermediate range, thereby allowing one to study its convergence to the large N limit. In that limit we recover Polya's recurrence probability, i.e. the survival probability equals the magnitude of the bias. We then obtain a closed-form expression for the probability of last return. In contrast to the bimodal behavior for the unbiased case, we show that the probability of last return decays mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17994","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.17994/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":"2412.17994","created_at":"2026-07-05T09:53:32.083065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17994v1","created_at":"2026-07-05T09:53:32.083065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17994","created_at":"2026-07-05T09:53:32.083065+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ARJDVZJNZ5P","created_at":"2026-07-05T09:53:32.083065+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ARJDVZJNZ5PLJWB","created_at":"2026-07-05T09:53:32.083065+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ARJDVZJ","created_at":"2026-07-05T09:53:32.083065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17994","citing_title":"Exact closed-form recurrence probabilities for biased random walks at any step number","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2","json":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2.json","graph_json":"https://pith.science/api/pith-number/6ARJDVZJNZ5PLJWBWAASQY6NN2/graph.json","events_json":"https://pith.science/api/pith-number/6ARJDVZJNZ5PLJWBWAASQY6NN2/events.json","paper":"https://pith.science/paper/6ARJDVZJ"},"agent_actions":{"view_html":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2","download_json":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2.json","view_paper":"https://pith.science/paper/6ARJDVZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17994&json=true","fetch_graph":"https://pith.science/api/pith-number/6ARJDVZJNZ5PLJWBWAASQY6NN2/graph.json","fetch_events":"https://pith.science/api/pith-number/6ARJDVZJNZ5PLJWBWAASQY6NN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2/action/storage_attestation","attest_author":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2/action/author_attestation","sign_citation":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2/action/citation_signature","submit_replication":"https://pith.science/pith/6ARJDVZJNZ5PLJWBWAASQY6NN2/action/replication_record"}},"created_at":"2026-07-05T09:53:32.083065+00:00","updated_at":"2026-07-05T09:53:32.083065+00:00"}