{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LDCBNWQFGVZT2YJSPXHP2JZZUD","short_pith_number":"pith:LDCBNWQF","schema_version":"1.0","canonical_sha256":"58c416da0535733d61327dcefd2739a0e5bb7331b38be385a56a59a06a5bc89c","source":{"kind":"arxiv","id":"1403.3881","version":3},"attestation_state":"computed","paper":{"title":"Complexity of Equilibrium in Diffusion Games on Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.DM","cs.MA"],"primary_cat":"cs.GT","authors_text":"Seyed Rasoul Etesami, Tamer Basar","submitted_at":"2014-03-16T04:12:57Z","abstract_excerpt":"In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirected networks. We first determine the set of pure-strategy Nash equilibria for two special but well-known classes of networks, namely the lattice and the hypercube. Characterizing the utility of the players in terms of graphical distances of their initial seed placements to other nodes in the network, we show that in general networks the decision process on the existence of pure-strategy Nash equilibrium is an NP-hard problem. Following this, "},"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":"1403.3881","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-16T04:12:57Z","cross_cats_sorted":["cs.CC","cs.DC","cs.DM","cs.MA"],"title_canon_sha256":"2b384c1997ec1e42ae16636b78e80621206d647182f2c90be5389425e95ff6a4","abstract_canon_sha256":"537efabae7ebc8f5f86ec7f8d52a400a3061bcabac8bed87bc6199513e485398"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:53.505598Z","signature_b64":"0lL4lbeawSfU6t0Wh2hfEGBDATz8/qccu9/1Zx9gsaCOcvVmZHvWUcmkRqPmlHhDClRO/QW9giAGcFQmq/7cDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c416da0535733d61327dcefd2739a0e5bb7331b38be385a56a59a06a5bc89c","last_reissued_at":"2026-05-18T01:55:53.504995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:53.504995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Equilibrium in Diffusion Games on Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.DM","cs.MA"],"primary_cat":"cs.GT","authors_text":"Seyed Rasoul Etesami, Tamer Basar","submitted_at":"2014-03-16T04:12:57Z","abstract_excerpt":"In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirected networks. We first determine the set of pure-strategy Nash equilibria for two special but well-known classes of networks, namely the lattice and the hypercube. Characterizing the utility of the players in terms of graphical distances of their initial seed placements to other nodes in the network, we show that in general networks the decision process on the existence of pure-strategy Nash equilibrium is an NP-hard problem. Following this, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3881","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":"1403.3881","created_at":"2026-05-18T01:55:53.505073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3881v3","created_at":"2026-05-18T01:55:53.505073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3881","created_at":"2026-05-18T01:55:53.505073+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDCBNWQFGVZT","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDCBNWQFGVZT2YJS","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDCBNWQF","created_at":"2026-05-18T12:28:35.611951+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/LDCBNWQFGVZT2YJSPXHP2JZZUD","json":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD.json","graph_json":"https://pith.science/api/pith-number/LDCBNWQFGVZT2YJSPXHP2JZZUD/graph.json","events_json":"https://pith.science/api/pith-number/LDCBNWQFGVZT2YJSPXHP2JZZUD/events.json","paper":"https://pith.science/paper/LDCBNWQF"},"agent_actions":{"view_html":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD","download_json":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD.json","view_paper":"https://pith.science/paper/LDCBNWQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3881&json=true","fetch_graph":"https://pith.science/api/pith-number/LDCBNWQFGVZT2YJSPXHP2JZZUD/graph.json","fetch_events":"https://pith.science/api/pith-number/LDCBNWQFGVZT2YJSPXHP2JZZUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD/action/storage_attestation","attest_author":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD/action/author_attestation","sign_citation":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD/action/citation_signature","submit_replication":"https://pith.science/pith/LDCBNWQFGVZT2YJSPXHP2JZZUD/action/replication_record"}},"created_at":"2026-05-18T01:55:53.505073+00:00","updated_at":"2026-05-18T01:55:53.505073+00:00"}