{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:B7ASKJDPMTB772UQCYSZJMFB5O","short_pith_number":"pith:B7ASKJDP","schema_version":"1.0","canonical_sha256":"0fc125246f64c3ffea90162594b0a1ebb54830fa5e2afd2c69083dc5153a62dc","source":{"kind":"arxiv","id":"math/0612048","version":3},"attestation_state":"computed","paper":{"title":"Attraction time for strongly reinforced walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Codina Cotar, Vlada Limic","submitted_at":"2006-12-02T11:47:54Z","abstract_excerpt":"We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges with probability 1 whenever the underlying graph is locally bounded. We study the asymptotic behavior of the tail distribution of the (random) time of attraction. In particular, we obtain exact (up to a multiplicative constant) asymptotics if the underlying graph has two edges. Next, we show some extensions in the setting of finite graphs, and infinite graph"},"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":"math/0612048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-12-02T11:47:54Z","cross_cats_sorted":[],"title_canon_sha256":"a551da0960020d4c4dded3b5d2feca41190e10108fc1e85ae49182ad52e2c56b","abstract_canon_sha256":"8a2d7cece90145ff5a37390b1fa12c373247ed7ab884480ead03fa74ceeb5fd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:22.470664Z","signature_b64":"jsETq0jGiMMgWoWotqbCLJ53zYqsjtwagV94q6wOnKgJIb0u8ItUPcrt2LHmY6TTnTPJ8uylG+uD3nrERKFyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fc125246f64c3ffea90162594b0a1ebb54830fa5e2afd2c69083dc5153a62dc","last_reissued_at":"2026-05-18T01:05:22.470109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:22.470109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attraction time for strongly reinforced walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Codina Cotar, Vlada Limic","submitted_at":"2006-12-02T11:47:54Z","abstract_excerpt":"We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges with probability 1 whenever the underlying graph is locally bounded. We study the asymptotic behavior of the tail distribution of the (random) time of attraction. In particular, we obtain exact (up to a multiplicative constant) asymptotics if the underlying graph has two edges. Next, we show some extensions in the setting of finite graphs, and infinite graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612048","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":"math/0612048","created_at":"2026-05-18T01:05:22.470196+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0612048v3","created_at":"2026-05-18T01:05:22.470196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612048","created_at":"2026-05-18T01:05:22.470196+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7ASKJDPMTB7","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7ASKJDPMTB772UQ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7ASKJDP","created_at":"2026-05-18T12:25:53.939244+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/B7ASKJDPMTB772UQCYSZJMFB5O","json":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O.json","graph_json":"https://pith.science/api/pith-number/B7ASKJDPMTB772UQCYSZJMFB5O/graph.json","events_json":"https://pith.science/api/pith-number/B7ASKJDPMTB772UQCYSZJMFB5O/events.json","paper":"https://pith.science/paper/B7ASKJDP"},"agent_actions":{"view_html":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O","download_json":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O.json","view_paper":"https://pith.science/paper/B7ASKJDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0612048&json=true","fetch_graph":"https://pith.science/api/pith-number/B7ASKJDPMTB772UQCYSZJMFB5O/graph.json","fetch_events":"https://pith.science/api/pith-number/B7ASKJDPMTB772UQCYSZJMFB5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O/action/storage_attestation","attest_author":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O/action/author_attestation","sign_citation":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O/action/citation_signature","submit_replication":"https://pith.science/pith/B7ASKJDPMTB772UQCYSZJMFB5O/action/replication_record"}},"created_at":"2026-05-18T01:05:22.470196+00:00","updated_at":"2026-05-18T01:05:22.470196+00:00"}