{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EJL63QA7NI6ZCNODM2U3BV5QI4","short_pith_number":"pith:EJL63QA7","schema_version":"1.0","canonical_sha256":"2257edc01f6a3d9135c366a9b0d7b0470f5fbb9fef00f639dbfb9859d43b91d8","source":{"kind":"arxiv","id":"1702.04915","version":2},"attestation_state":"computed","paper":{"title":"Scaling limit of the uniform prudent walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Niccol\\`o Torri, Nicolas P\\'etr\\'elis, Rongfeng Sun","submitted_at":"2017-02-16T10:25:11Z","abstract_excerpt":"We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the direction of a previously visited site. The uniform prudent walk has been investigated with combinatorial techniques in [Bousquet-M\\'elou, 2010], while another variant, the kinetic prudent walk has been analyzed in detail in [Beffara, Friedli and Velenik, 2010]. In this paper, we prove that the $2$-dimensional uniform prudent walk is ballistic and follows one "},"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":"1702.04915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-16T10:25:11Z","cross_cats_sorted":[],"title_canon_sha256":"871fa6de3340a619b3b8c1995700ae67d4aac2b8addaeeb616f63750d90d7b28","abstract_canon_sha256":"7a61b1589289aef510c7f516fca3437eb9a86e6308dc200847db6672b5778b36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.513531Z","signature_b64":"Xs0BuBBQ6MRBVVRpqqRkxkmma4UDvyZprpXr2yiAbftekedMBPEa4e2YOnW6UH8UnQre7gYWRjBMtTEybvCRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2257edc01f6a3d9135c366a9b0d7b0470f5fbb9fef00f639dbfb9859d43b91d8","last_reissued_at":"2026-05-18T00:35:51.513076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.513076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling limit of the uniform prudent walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Niccol\\`o Torri, Nicolas P\\'etr\\'elis, Rongfeng Sun","submitted_at":"2017-02-16T10:25:11Z","abstract_excerpt":"We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the direction of a previously visited site. The uniform prudent walk has been investigated with combinatorial techniques in [Bousquet-M\\'elou, 2010], while another variant, the kinetic prudent walk has been analyzed in detail in [Beffara, Friedli and Velenik, 2010]. In this paper, we prove that the $2$-dimensional uniform prudent walk is ballistic and follows one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04915","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":""},"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":"1702.04915","created_at":"2026-05-18T00:35:51.513140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04915v2","created_at":"2026-05-18T00:35:51.513140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04915","created_at":"2026-05-18T00:35:51.513140+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJL63QA7NI6Z","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJL63QA7NI6ZCNOD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJL63QA7","created_at":"2026-05-18T12:31:12.930513+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/EJL63QA7NI6ZCNODM2U3BV5QI4","json":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4.json","graph_json":"https://pith.science/api/pith-number/EJL63QA7NI6ZCNODM2U3BV5QI4/graph.json","events_json":"https://pith.science/api/pith-number/EJL63QA7NI6ZCNODM2U3BV5QI4/events.json","paper":"https://pith.science/paper/EJL63QA7"},"agent_actions":{"view_html":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4","download_json":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4.json","view_paper":"https://pith.science/paper/EJL63QA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04915&json=true","fetch_graph":"https://pith.science/api/pith-number/EJL63QA7NI6ZCNODM2U3BV5QI4/graph.json","fetch_events":"https://pith.science/api/pith-number/EJL63QA7NI6ZCNODM2U3BV5QI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4/action/storage_attestation","attest_author":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4/action/author_attestation","sign_citation":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4/action/citation_signature","submit_replication":"https://pith.science/pith/EJL63QA7NI6ZCNODM2U3BV5QI4/action/replication_record"}},"created_at":"2026-05-18T00:35:51.513140+00:00","updated_at":"2026-05-18T00:35:51.513140+00:00"}