{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HWY6AC3T3EE4K6ID6XWGRHJOJH","short_pith_number":"pith:HWY6AC3T","schema_version":"1.0","canonical_sha256":"3db1e00b73d909c57903f5ec689d2e49c08c5ea575430f59d40a636a7f8a9c47","source":{"kind":"arxiv","id":"1908.07616","version":2},"attestation_state":"computed","paper":{"title":"Tree Builder Random Walk: recurrence, transience and ballisticity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Giulio Iacobelli, Glauco Valle, Leonel Zuaznabar, Rodrigo Ribeiro","submitted_at":"2019-08-20T21:26:59Z","abstract_excerpt":"The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and attached to the current position of the walker. These processes share similarities with other important classes of markovian and non-markovian random walks presenting a large variety of behaviors according to parameters specifications. We show that for a large and most significant class of tree builder random walks, the process is either null recurrent or trans"},"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":"1908.07616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-08-20T21:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"99c75c8c031d57e8cc515d0c1b0c1dee55bcabcf23adfd55833645537dd57940","abstract_canon_sha256":"15eabd80973d2d8e03fa06c46db71dfef51dab8adfece13198def1b4f3c1c4be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:39.652725Z","signature_b64":"9JvtsqdL4MgoHoZw0PuG47ZMwcMMrwwFlCLF/TzkhwuYcsHU8MktjiiBax12Z9/uokncC3g7R9R7i8Ol+hfCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db1e00b73d909c57903f5ec689d2e49c08c5ea575430f59d40a636a7f8a9c47","last_reissued_at":"2026-07-05T02:12:39.652220Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:39.652220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Builder Random Walk: recurrence, transience and ballisticity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Giulio Iacobelli, Glauco Valle, Leonel Zuaznabar, Rodrigo Ribeiro","submitted_at":"2019-08-20T21:26:59Z","abstract_excerpt":"The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and attached to the current position of the walker. These processes share similarities with other important classes of markovian and non-markovian random walks presenting a large variety of behaviors according to parameters specifications. We show that for a large and most significant class of tree builder random walks, the process is either null recurrent or trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07616","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/1908.07616/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":"1908.07616","created_at":"2026-07-05T02:12:39.652281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07616v2","created_at":"2026-07-05T02:12:39.652281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07616","created_at":"2026-07-05T02:12:39.652281+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWY6AC3T3EE4","created_at":"2026-07-05T02:12:39.652281+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWY6AC3T3EE4K6ID","created_at":"2026-07-05T02:12:39.652281+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWY6AC3T","created_at":"2026-07-05T02:12:39.652281+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/HWY6AC3T3EE4K6ID6XWGRHJOJH","json":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH.json","graph_json":"https://pith.science/api/pith-number/HWY6AC3T3EE4K6ID6XWGRHJOJH/graph.json","events_json":"https://pith.science/api/pith-number/HWY6AC3T3EE4K6ID6XWGRHJOJH/events.json","paper":"https://pith.science/paper/HWY6AC3T"},"agent_actions":{"view_html":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH","download_json":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH.json","view_paper":"https://pith.science/paper/HWY6AC3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07616&json=true","fetch_graph":"https://pith.science/api/pith-number/HWY6AC3T3EE4K6ID6XWGRHJOJH/graph.json","fetch_events":"https://pith.science/api/pith-number/HWY6AC3T3EE4K6ID6XWGRHJOJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH/action/storage_attestation","attest_author":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH/action/author_attestation","sign_citation":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH/action/citation_signature","submit_replication":"https://pith.science/pith/HWY6AC3T3EE4K6ID6XWGRHJOJH/action/replication_record"}},"created_at":"2026-07-05T02:12:39.652281+00:00","updated_at":"2026-07-05T02:12:39.652281+00:00"}