{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:464QT7X2WXTX7WMP3G7HSGDIFH","short_pith_number":"pith:464QT7X2","schema_version":"1.0","canonical_sha256":"e7b909fefab5e77fd98fd9be79186829ed34bbab40a8826cac1799017d554f2c","source":{"kind":"arxiv","id":"1810.02735","version":3},"attestation_state":"computed","paper":{"title":"Random walks with preferential relocations and fading memory: a study through random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.PR","authors_text":"C\\'ecile Mailler, Ger\\'onimo Uribe Bravo","submitted_at":"2018-10-05T14:57:14Z","abstract_excerpt":"Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the time it has already spent there. This process has been analyzed in the physics literature under the name \"random walk with preferential relocations\", where it is argued that the position of the walker after $n$ steps, scaled by $\\log n$, converges to a Gaussian random variable; because of the $\\log$ spatial scaling, the process is said to undergo a \"slow diff"},"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":"1810.02735","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-10-05T14:57:14Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"24053fcea0e6630d3256d0a18672776a55ebe2fd241397aa7b5d6c53291a55f7","abstract_canon_sha256":"97d5ba1cda6b1d2dc297dc140d712b6b7d6e0a7f56689e8b78950d75f78e26c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:29:26.420463Z","signature_b64":"vv/c2+6pOz3JlMj9d18hvw+fM5PEtN6n6UvPut/iGZw2EdEfKLfmJIDMVJVwZ8qa2E19xXx1E/gmmLi1wKj1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b909fefab5e77fd98fd9be79186829ed34bbab40a8826cac1799017d554f2c","last_reissued_at":"2026-07-05T01:29:26.419984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:29:26.419984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random walks with preferential relocations and fading memory: a study through random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.PR","authors_text":"C\\'ecile Mailler, Ger\\'onimo Uribe Bravo","submitted_at":"2018-10-05T14:57:14Z","abstract_excerpt":"Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the time it has already spent there. This process has been analyzed in the physics literature under the name \"random walk with preferential relocations\", where it is argued that the position of the walker after $n$ steps, scaled by $\\log n$, converges to a Gaussian random variable; because of the $\\log$ spatial scaling, the process is said to undergo a \"slow diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02735","kind":"arxiv","version":3},"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/1810.02735/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":"1810.02735","created_at":"2026-07-05T01:29:26.420039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02735v3","created_at":"2026-07-05T01:29:26.420039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02735","created_at":"2026-07-05T01:29:26.420039+00:00"},{"alias_kind":"pith_short_12","alias_value":"464QT7X2WXTX","created_at":"2026-07-05T01:29:26.420039+00:00"},{"alias_kind":"pith_short_16","alias_value":"464QT7X2WXTX7WMP","created_at":"2026-07-05T01:29:26.420039+00:00"},{"alias_kind":"pith_short_8","alias_value":"464QT7X2","created_at":"2026-07-05T01:29:26.420039+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09488","citing_title":"The temporal stochastic block model","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH","json":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH.json","graph_json":"https://pith.science/api/pith-number/464QT7X2WXTX7WMP3G7HSGDIFH/graph.json","events_json":"https://pith.science/api/pith-number/464QT7X2WXTX7WMP3G7HSGDIFH/events.json","paper":"https://pith.science/paper/464QT7X2"},"agent_actions":{"view_html":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH","download_json":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH.json","view_paper":"https://pith.science/paper/464QT7X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02735&json=true","fetch_graph":"https://pith.science/api/pith-number/464QT7X2WXTX7WMP3G7HSGDIFH/graph.json","fetch_events":"https://pith.science/api/pith-number/464QT7X2WXTX7WMP3G7HSGDIFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH/action/storage_attestation","attest_author":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH/action/author_attestation","sign_citation":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH/action/citation_signature","submit_replication":"https://pith.science/pith/464QT7X2WXTX7WMP3G7HSGDIFH/action/replication_record"}},"created_at":"2026-07-05T01:29:26.420039+00:00","updated_at":"2026-07-05T01:29:26.420039+00:00"}