{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZB763YS566Z6QI7EYK3MTCA62F","short_pith_number":"pith:ZB763YS5","schema_version":"1.0","canonical_sha256":"c87fede25df7b3e823e4c2b6c9881ed156a7352287806025208620125bf12abe","source":{"kind":"arxiv","id":"1101.1410","version":2},"attestation_state":"computed","paper":{"title":"Interacting Urn Models","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Micka\\\"el Launay","submitted_at":"2011-01-07T11:46:56Z","abstract_excerpt":"The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball from either all the urns combined (with probability $p$) or the urn alone (with probability $1-p$) and add a new ball of the same color to this urn. The probability of drawing a ball of a certain color is proportional to $w_k$ where $k$ is the number of balls of this color. The higher the $p$, the more memory is shared between the urns. The main results can be"},"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":"1101.1410","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2011-01-07T11:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"bfa39ce9b70a5317c332d948ad50e9dabd6d315f993a285b2d3a68956330f171","abstract_canon_sha256":"4491eeb512efff5b97111cbcb0c9c33e66eabcc20d19bcd9883857e85d14723d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:04.070572Z","signature_b64":"ABArGjv2A6COFxtN+w14ShbF5nBx++QJmCIZ3rvNr/757KAEJvjcvLMvZ7sNDPF3HKhN+JXcFA0Po6CDI0eWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c87fede25df7b3e823e4c2b6c9881ed156a7352287806025208620125bf12abe","last_reissued_at":"2026-05-18T04:05:04.069877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:04.069877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interacting Urn Models","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Micka\\\"el Launay","submitted_at":"2011-01-07T11:46:56Z","abstract_excerpt":"The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball from either all the urns combined (with probability $p$) or the urn alone (with probability $1-p$) and add a new ball of the same color to this urn. The probability of drawing a ball of a certain color is proportional to $w_k$ where $k$ is the number of balls of this color. The higher the $p$, the more memory is shared between the urns. The main results can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1410","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":""},"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":"1101.1410","created_at":"2026-05-18T04:05:04.069983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1410v2","created_at":"2026-05-18T04:05:04.069983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1410","created_at":"2026-05-18T04:05:04.069983+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZB763YS566Z6","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZB763YS566Z6QI7E","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZB763YS5","created_at":"2026-05-18T12:26:47.523578+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/ZB763YS566Z6QI7EYK3MTCA62F","json":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F.json","graph_json":"https://pith.science/api/pith-number/ZB763YS566Z6QI7EYK3MTCA62F/graph.json","events_json":"https://pith.science/api/pith-number/ZB763YS566Z6QI7EYK3MTCA62F/events.json","paper":"https://pith.science/paper/ZB763YS5"},"agent_actions":{"view_html":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F","download_json":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F.json","view_paper":"https://pith.science/paper/ZB763YS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1410&json=true","fetch_graph":"https://pith.science/api/pith-number/ZB763YS566Z6QI7EYK3MTCA62F/graph.json","fetch_events":"https://pith.science/api/pith-number/ZB763YS566Z6QI7EYK3MTCA62F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F/action/storage_attestation","attest_author":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F/action/author_attestation","sign_citation":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F/action/citation_signature","submit_replication":"https://pith.science/pith/ZB763YS566Z6QI7EYK3MTCA62F/action/replication_record"}},"created_at":"2026-05-18T04:05:04.069983+00:00","updated_at":"2026-05-18T04:05:04.069983+00:00"}