{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6SSSMTKYAFR3HWMD3DQHDQQBI2","short_pith_number":"pith:6SSSMTKY","schema_version":"1.0","canonical_sha256":"f4a5264d580163b3d983d8e071c20146a7cb70624c36e86de3fafbc0cbb5368a","source":{"kind":"arxiv","id":"0904.4722","version":3},"attestation_state":"computed","paper":{"title":"VRRW on complete-like graphs: Almost sure behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Stanislav Volkov, Vlada Limic","submitted_at":"2009-04-30T00:01:03Z","abstract_excerpt":"By a theorem of Volkov (2001) we know that on most graphs with positive probability the linearly vertex-reinforced random walk (VRRW) stays within a finite \"trapping\" subgraph at all large times. The question of whether this tail behavior occurs with probability one is open in general. In his thesis, Pemantle (1988) proved, via a dynamical system approach, that for a VRRW on any complete graph the asymptotic frequency of visits is uniform over vertices. These techniques do not easily extend even to the setting of complete-like graphs, that is, complete graphs ornamented with finitely many leav"},"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":"0904.4722","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-04-30T00:01:03Z","cross_cats_sorted":[],"title_canon_sha256":"405ce8c710574a344ee0d19609170eb0e3c3a1951954cda85b4218f2aee74851","abstract_canon_sha256":"f5a62e03707828f2120e4eeb849dc7c5c60c03c51987c6e335acb6f82486466e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:57.308184Z","signature_b64":"9oPj6W+eh/0XfyND/waBEsQ4TVmsdo9UPEDjnX6uzdq9lLd+ZuVgrceZQzjJTijcrI3sD0eo6v7sxBE9m0cdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4a5264d580163b3d983d8e071c20146a7cb70624c36e86de3fafbc0cbb5368a","last_reissued_at":"2026-05-18T04:35:57.307579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:57.307579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VRRW on complete-like graphs: Almost sure behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Stanislav Volkov, Vlada Limic","submitted_at":"2009-04-30T00:01:03Z","abstract_excerpt":"By a theorem of Volkov (2001) we know that on most graphs with positive probability the linearly vertex-reinforced random walk (VRRW) stays within a finite \"trapping\" subgraph at all large times. The question of whether this tail behavior occurs with probability one is open in general. In his thesis, Pemantle (1988) proved, via a dynamical system approach, that for a VRRW on any complete graph the asymptotic frequency of visits is uniform over vertices. These techniques do not easily extend even to the setting of complete-like graphs, that is, complete graphs ornamented with finitely many leav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4722","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":"0904.4722","created_at":"2026-05-18T04:35:57.307668+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.4722v3","created_at":"2026-05-18T04:35:57.307668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4722","created_at":"2026-05-18T04:35:57.307668+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SSSMTKYAFR3","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SSSMTKYAFR3HWMD","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SSSMTKY","created_at":"2026-05-18T12:25:58.837520+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/6SSSMTKYAFR3HWMD3DQHDQQBI2","json":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2.json","graph_json":"https://pith.science/api/pith-number/6SSSMTKYAFR3HWMD3DQHDQQBI2/graph.json","events_json":"https://pith.science/api/pith-number/6SSSMTKYAFR3HWMD3DQHDQQBI2/events.json","paper":"https://pith.science/paper/6SSSMTKY"},"agent_actions":{"view_html":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2","download_json":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2.json","view_paper":"https://pith.science/paper/6SSSMTKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.4722&json=true","fetch_graph":"https://pith.science/api/pith-number/6SSSMTKYAFR3HWMD3DQHDQQBI2/graph.json","fetch_events":"https://pith.science/api/pith-number/6SSSMTKYAFR3HWMD3DQHDQQBI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2/action/storage_attestation","attest_author":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2/action/author_attestation","sign_citation":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2/action/citation_signature","submit_replication":"https://pith.science/pith/6SSSMTKYAFR3HWMD3DQHDQQBI2/action/replication_record"}},"created_at":"2026-05-18T04:35:57.307668+00:00","updated_at":"2026-05-18T04:35:57.307668+00:00"}