{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N7H7MUXBIBSGMFSQ2EM3F3BSML","short_pith_number":"pith:N7H7MUXB","schema_version":"1.0","canonical_sha256":"6fcff652e14064661650d119b2ec3262cbe900f7446b9a67f9bdcaee645611e2","source":{"kind":"arxiv","id":"1412.2544","version":3},"attestation_state":"computed","paper":{"title":"Multi-Player Diffusion Games on Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Laurent Bulteau, Nimrod Talmon, Vincent Froese","submitted_at":"2014-12-08T12:50:17Z","abstract_excerpt":"We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players, we investigate the existence of pure Nash equilibria for at least three players on different classes of graphs including paths, cycles, grid graphs and hypercubes; as a main contribution, we answer an open question proving that there is no Nash equilibrium for three players on (m x n) grids with min(m, n) >= 5. Further, extending results of Etesami and Basar [3] for two players, we prove the existence of pure Nash "},"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":"1412.2544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-08T12:50:17Z","cross_cats_sorted":[],"title_canon_sha256":"7657c1629dcdee20c393163ed5ff6a95c3109babe1ad5ade36618be35dba0d1a","abstract_canon_sha256":"6a1bc3cbacbaa72bbf44027d392f6e450cbdcc31983045ad8a879638160356b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:32.255678Z","signature_b64":"xleEXtEXDEmoiYKjRZa3Q1u3VWokR1Icv679PZHU6W1EOC7SaYPR9B5t56pKTO770YZO8sY5wwUjedEwEWLcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fcff652e14064661650d119b2ec3262cbe900f7446b9a67f9bdcaee645611e2","last_reissued_at":"2026-05-18T00:46:32.255072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:32.255072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Player Diffusion Games on Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Laurent Bulteau, Nimrod Talmon, Vincent Froese","submitted_at":"2014-12-08T12:50:17Z","abstract_excerpt":"We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players, we investigate the existence of pure Nash equilibria for at least three players on different classes of graphs including paths, cycles, grid graphs and hypercubes; as a main contribution, we answer an open question proving that there is no Nash equilibrium for three players on (m x n) grids with min(m, n) >= 5. Further, extending results of Etesami and Basar [3] for two players, we prove the existence of pure Nash "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2544","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":"1412.2544","created_at":"2026-05-18T00:46:32.255143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2544v3","created_at":"2026-05-18T00:46:32.255143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2544","created_at":"2026-05-18T00:46:32.255143+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7H7MUXBIBSG","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7H7MUXBIBSGMFSQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7H7MUXB","created_at":"2026-05-18T12:28:41.024544+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/N7H7MUXBIBSGMFSQ2EM3F3BSML","json":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML.json","graph_json":"https://pith.science/api/pith-number/N7H7MUXBIBSGMFSQ2EM3F3BSML/graph.json","events_json":"https://pith.science/api/pith-number/N7H7MUXBIBSGMFSQ2EM3F3BSML/events.json","paper":"https://pith.science/paper/N7H7MUXB"},"agent_actions":{"view_html":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML","download_json":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML.json","view_paper":"https://pith.science/paper/N7H7MUXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2544&json=true","fetch_graph":"https://pith.science/api/pith-number/N7H7MUXBIBSGMFSQ2EM3F3BSML/graph.json","fetch_events":"https://pith.science/api/pith-number/N7H7MUXBIBSGMFSQ2EM3F3BSML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/action/storage_attestation","attest_author":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/action/author_attestation","sign_citation":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/action/citation_signature","submit_replication":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/action/replication_record"}},"created_at":"2026-05-18T00:46:32.255143+00:00","updated_at":"2026-05-18T00:46:32.255143+00:00"}