{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A67R4R3NOL6NLDJ64HTMTSRF3T","short_pith_number":"pith:A67R4R3N","schema_version":"1.0","canonical_sha256":"07bf1e476d72fcd58d3ee1e6c9ca25dcfd9fe564c350363d374164f6a63ba45f","source":{"kind":"arxiv","id":"2409.05201","version":3},"attestation_state":"computed","paper":{"title":"Multiplayer Games of War","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Axel Adjei, Elchanan Mossel, Neil Krishnan","submitted_at":"2024-09-08T19:31:13Z","abstract_excerpt":"A recent paper by Bhatia, Chin, Mani, and Mossel (2026) defined stochastic processes modeling the game of War for {\\em two players} with $n$ cards. That paper showed that these models, assuming uniform random decks, are equivalent to the Gambler's Ruin problem and therefore have an expected termination time of $\\Theta(n^2)$. In this paper, we generalize these models to {\\em any number of players} $m$. We prove that the game with $m$ players is equivalent to a simple sticky random walk on an $(m-1)$-simplex; therefore, the termination time is the same as the absorption time of the simple sticky"},"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":"2409.05201","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-09-08T19:31:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ccc03c52ab75c5fa3e06d28518e078f73e5f6d4626e3a8e1eb5a9499f5ed4920","abstract_canon_sha256":"61e04bbe9665befd26c9b23cf9c75bf91784f75d99dab59608dd0ca8743c765e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:09:13.113805Z","signature_b64":"PfMOohmKw1YgSpUcyxP0epCysqRWzTUByStBmYAwtT+NvookLPVAVm+fYf73dHkvLqz2rXCirEK4zzvianDXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07bf1e476d72fcd58d3ee1e6c9ca25dcfd9fe564c350363d374164f6a63ba45f","last_reissued_at":"2026-06-10T01:09:13.112736Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:09:13.112736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiplayer Games of War","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Axel Adjei, Elchanan Mossel, Neil Krishnan","submitted_at":"2024-09-08T19:31:13Z","abstract_excerpt":"A recent paper by Bhatia, Chin, Mani, and Mossel (2026) defined stochastic processes modeling the game of War for {\\em two players} with $n$ cards. That paper showed that these models, assuming uniform random decks, are equivalent to the Gambler's Ruin problem and therefore have an expected termination time of $\\Theta(n^2)$. In this paper, we generalize these models to {\\em any number of players} $m$. We prove that the game with $m$ players is equivalent to a simple sticky random walk on an $(m-1)$-simplex; therefore, the termination time is the same as the absorption time of the simple sticky"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05201","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.05201/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":"2409.05201","created_at":"2026-06-10T01:09:13.112892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05201v3","created_at":"2026-06-10T01:09:13.112892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05201","created_at":"2026-06-10T01:09:13.112892+00:00"},{"alias_kind":"pith_short_12","alias_value":"A67R4R3NOL6N","created_at":"2026-06-10T01:09:13.112892+00:00"},{"alias_kind":"pith_short_16","alias_value":"A67R4R3NOL6NLDJ6","created_at":"2026-06-10T01:09:13.112892+00:00"},{"alias_kind":"pith_short_8","alias_value":"A67R4R3N","created_at":"2026-06-10T01:09:13.112892+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/A67R4R3NOL6NLDJ64HTMTSRF3T","json":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T.json","graph_json":"https://pith.science/api/pith-number/A67R4R3NOL6NLDJ64HTMTSRF3T/graph.json","events_json":"https://pith.science/api/pith-number/A67R4R3NOL6NLDJ64HTMTSRF3T/events.json","paper":"https://pith.science/paper/A67R4R3N"},"agent_actions":{"view_html":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T","download_json":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T.json","view_paper":"https://pith.science/paper/A67R4R3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05201&json=true","fetch_graph":"https://pith.science/api/pith-number/A67R4R3NOL6NLDJ64HTMTSRF3T/graph.json","fetch_events":"https://pith.science/api/pith-number/A67R4R3NOL6NLDJ64HTMTSRF3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T/action/storage_attestation","attest_author":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T/action/author_attestation","sign_citation":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T/action/citation_signature","submit_replication":"https://pith.science/pith/A67R4R3NOL6NLDJ64HTMTSRF3T/action/replication_record"}},"created_at":"2026-06-10T01:09:13.112892+00:00","updated_at":"2026-06-10T01:09:13.112892+00:00"}