{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y4G2GK7ISNDDZ4KHR6JIVWCFJM","short_pith_number":"pith:Y4G2GK7I","schema_version":"1.0","canonical_sha256":"c70da32be893463cf1478f928ad8454b112fc96340d3561e7b7e18cb2b8de0f0","source":{"kind":"arxiv","id":"2508.15992","version":2},"attestation_state":"computed","paper":{"title":"Interacting vertex reinforced random walks on complete sub-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Fernando P. A. Prado, Rafael A. Rosales","submitted_at":"2025-08-21T22:26:08Z","abstract_excerpt":"This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete subgraph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the cumulative proportion of visits by all walks that have access to that vertex. Proportions are modified by multiplication by a real valued interaction parameter and the addition of a parameter representing the intrinsic preference of the walk for the vertex. This model covers a wide range of interactions, including the cooperation (attraction) or competition (repulsio"},"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":"2508.15992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-08-21T22:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"aeba81a6583b5c9c62a3562008d18165ecc3ccb48672571ca6b5e0f176b74e8e","abstract_canon_sha256":"ccf020ed2c45868daf8459676a98c41fb49e6f79ed4d628fbe7dd1960947f44c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:15:03.114281Z","signature_b64":"bdWeR0H+11qs9lNDS/d+xvZuxLhdMvTsQWxPOrM/LW5AVk6ZLoo9jA/Bd9OhX/ILB0/b3b3WDTLPgLgb/TW+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c70da32be893463cf1478f928ad8454b112fc96340d3561e7b7e18cb2b8de0f0","last_reissued_at":"2026-06-29T01:15:03.113817Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:15:03.113817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interacting vertex reinforced random walks on complete sub-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Fernando P. A. Prado, Rafael A. Rosales","submitted_at":"2025-08-21T22:26:08Z","abstract_excerpt":"This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete subgraph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the cumulative proportion of visits by all walks that have access to that vertex. Proportions are modified by multiplication by a real valued interaction parameter and the addition of a parameter representing the intrinsic preference of the walk for the vertex. This model covers a wide range of interactions, including the cooperation (attraction) or competition (repulsio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15992","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/2508.15992/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":"2508.15992","created_at":"2026-06-29T01:15:03.113865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.15992v2","created_at":"2026-06-29T01:15:03.113865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15992","created_at":"2026-06-29T01:15:03.113865+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4G2GK7ISNDD","created_at":"2026-06-29T01:15:03.113865+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4G2GK7ISNDDZ4KH","created_at":"2026-06-29T01:15:03.113865+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4G2GK7I","created_at":"2026-06-29T01:15:03.113865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.05386","citing_title":"Reinforced random walks with geometric inter-transition times","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05377","citing_title":"The Clark-Kushner condition for interacting reinforced random walks on finite graphs","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM","json":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM.json","graph_json":"https://pith.science/api/pith-number/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/graph.json","events_json":"https://pith.science/api/pith-number/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/events.json","paper":"https://pith.science/paper/Y4G2GK7I"},"agent_actions":{"view_html":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM","download_json":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM.json","view_paper":"https://pith.science/paper/Y4G2GK7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.15992&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/action/storage_attestation","attest_author":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/action/author_attestation","sign_citation":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/action/citation_signature","submit_replication":"https://pith.science/pith/Y4G2GK7ISNDDZ4KHR6JIVWCFJM/action/replication_record"}},"created_at":"2026-06-29T01:15:03.113865+00:00","updated_at":"2026-06-29T01:15:03.113865+00:00"}