{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:N7H7MUXBIBSGMFSQ2EM3F3BSML","short_pith_number":"pith:N7H7MUXB","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"},"canonical_sha256":"6fcff652e14064661650d119b2ec3262cbe900f7446b9a67f9bdcaee645611e2","source":{"kind":"arxiv","id":"1412.2544","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2544","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2544v3","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2544","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"N7H7MUXBIBSG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N7H7MUXBIBSGMFSQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N7H7MUXB","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:N7H7MUXBIBSGMFSQ2EM3F3BSML","target":"record","payload":{"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"},"canonical_sha256":"6fcff652e14064661650d119b2ec3262cbe900f7446b9a67f9bdcaee645611e2","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"},"source_kind":"arxiv","source_id":"1412.2544","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/yJMIpLsGuiPWiYbjV8I8IOmlNZtdQO/pFKohDAafkY/omq753AblgZqNVLzBYgLYq0venBZkK2c1Gt4OtgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:40.041123Z"},"content_sha256":"57dad987203053445ead9c3c0a27c4c993174e79e4c613b1d63b6837c3cbda97","schema_version":"1.0","event_id":"sha256:57dad987203053445ead9c3c0a27c4c993174e79e4c613b1d63b6837c3cbda97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:N7H7MUXBIBSGMFSQ2EM3F3BSML","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"viuPBVyx3a/2OvKS6ef2SFXH1eT5cqlEhKcYU+2DXdifPlKSx/iErZ6Apku/vptX6cp0LFS0hJeAdFp3fKSPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:40.041489Z"},"content_sha256":"69001e42fbdfbee550c93e37fcb6f49d18667ce3ac228dcc3d36ad55247f9197","schema_version":"1.0","event_id":"sha256:69001e42fbdfbee550c93e37fcb6f49d18667ce3ac228dcc3d36ad55247f9197"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/bundle.json","state_url":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T13:06:40Z","links":{"resolver":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML","bundle":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/bundle.json","state":"https://pith.science/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7H7MUXBIBSGMFSQ2EM3F3BSML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:N7H7MUXBIBSGMFSQ2EM3F3BSML","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a1bc3cbacbaa72bbf44027d392f6e450cbdcc31983045ad8a879638160356b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-08T12:50:17Z","title_canon_sha256":"7657c1629dcdee20c393163ed5ff6a95c3109babe1ad5ade36618be35dba0d1a"},"schema_version":"1.0","source":{"id":"1412.2544","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2544","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2544v3","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2544","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"N7H7MUXBIBSG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N7H7MUXBIBSGMFSQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N7H7MUXB","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:69001e42fbdfbee550c93e37fcb6f49d18667ce3ac228dcc3d36ad55247f9197","target":"graph","created_at":"2026-05-18T00:46:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Laurent Bulteau, Nimrod Talmon, Vincent Froese","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-08T12:50:17Z","title":"Multi-Player Diffusion Games on Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2544","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57dad987203053445ead9c3c0a27c4c993174e79e4c613b1d63b6837c3cbda97","target":"record","created_at":"2026-05-18T00:46:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a1bc3cbacbaa72bbf44027d392f6e450cbdcc31983045ad8a879638160356b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-08T12:50:17Z","title_canon_sha256":"7657c1629dcdee20c393163ed5ff6a95c3109babe1ad5ade36618be35dba0d1a"},"schema_version":"1.0","source":{"id":"1412.2544","kind":"arxiv","version":3}},"canonical_sha256":"6fcff652e14064661650d119b2ec3262cbe900f7446b9a67f9bdcaee645611e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fcff652e14064661650d119b2ec3262cbe900f7446b9a67f9bdcaee645611e2","first_computed_at":"2026-05-18T00:46:32.255072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:32.255072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xleEXtEXDEmoiYKjRZa3Q1u3VWokR1Icv679PZHU6W1EOC7SaYPR9B5t56pKTO770YZO8sY5wwUjedEwEWLcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:32.255678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2544","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57dad987203053445ead9c3c0a27c4c993174e79e4c613b1d63b6837c3cbda97","sha256:69001e42fbdfbee550c93e37fcb6f49d18667ce3ac228dcc3d36ad55247f9197"],"state_sha256":"d9c781944b6e8ee50b0c40e1457629768d0bd036ce63774cee564e0c2ac245e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWrKXt8OTreDdozGePsJyqRLa+CI4pEMv6R1zUC7IQumTax/WGWTkXw/hpDOXjleltVHZq9BsuS2F6ORgxaDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:06:40.043472Z","bundle_sha256":"282e39d4db607bd32033dc4a479f696c5b1c0fd3e4e1b5db678818a435668e02"}}