{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZBDS6Y3TUT6WJ5XDYIBQZKMPXA","short_pith_number":"pith:ZBDS6Y3T","schema_version":"1.0","canonical_sha256":"c8472f6373a4fd64f6e3c2030ca98fb826f77301bb28ec49b6921aa1d0b5677a","source":{"kind":"arxiv","id":"1509.00807","version":3},"attestation_state":"computed","paper":{"title":"Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Codina Cotar, Debleena Thacker","submitted_at":"2015-09-02T18:14:07Z","abstract_excerpt":"In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of vertex, traversals. The technique relies on upper bound estimates for the number of edge traversals, proved in a different context by Cotar and Limic [Ann. Appl. Probab. (2009)] for finite graphs with edge reinforcement. We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected gra"},"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.00807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-02T18:14:07Z","cross_cats_sorted":[],"title_canon_sha256":"6b172cec72046abc2df485caf5d9d7c1f1ac9b06e0ab08985de87bfd6e783174","abstract_canon_sha256":"6abd77a5cdadc36df90c8000ff50237b4a9cdd491c052f2336fa5b87299cf823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.960364Z","signature_b64":"/4P44YJWtt4kGxPMtY9i1ZM6wpJNgU7B6Ikh1NGynYgYmaCqDJjimePP0hUJItnnXEmDbD7aWD+5OmuHXfMMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8472f6373a4fd64f6e3c2030ca98fb826f77301bb28ec49b6921aa1d0b5677a","last_reissued_at":"2026-05-18T01:13:04.959758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.959758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Codina Cotar, Debleena Thacker","submitted_at":"2015-09-02T18:14:07Z","abstract_excerpt":"In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of vertex, traversals. The technique relies on upper bound estimates for the number of edge traversals, proved in a different context by Cotar and Limic [Ann. Appl. Probab. (2009)] for finite graphs with edge reinforcement. We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00807","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":""},"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.00807","created_at":"2026-05-18T01:13:04.959825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00807v3","created_at":"2026-05-18T01:13:04.959825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00807","created_at":"2026-05-18T01:13:04.959825+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBDS6Y3TUT6W","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBDS6Y3TUT6WJ5XD","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBDS6Y3T","created_at":"2026-05-18T12:29:52.810259+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/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA","json":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA.json","graph_json":"https://pith.science/api/pith-number/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/graph.json","events_json":"https://pith.science/api/pith-number/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/events.json","paper":"https://pith.science/paper/ZBDS6Y3T"},"agent_actions":{"view_html":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA","download_json":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA.json","view_paper":"https://pith.science/paper/ZBDS6Y3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00807&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/action/storage_attestation","attest_author":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/action/author_attestation","sign_citation":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/action/citation_signature","submit_replication":"https://pith.science/pith/ZBDS6Y3TUT6WJ5XDYIBQZKMPXA/action/replication_record"}},"created_at":"2026-05-18T01:13:04.959825+00:00","updated_at":"2026-05-18T01:13:04.959825+00:00"}