{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RWY7ZQAMQXSCTAPBHVE5ZL7CZJ","short_pith_number":"pith:RWY7ZQAM","schema_version":"1.0","canonical_sha256":"8db1fcc00c85e42981e13d49dcafe2ca46a12fb9597d8de7266e349b04c4b013","source":{"kind":"arxiv","id":"1105.2434","version":3},"attestation_state":"computed","paper":{"title":"Diffusion in Social Networks with Competing Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Evangelos Markakis, Krzysztof R. Apt","submitted_at":"2011-05-12T11:44:58Z","abstract_excerpt":"We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible (respectively necessary) and the ones for which a unique outcome is guaranteed. These characterizations directly yield polynomial time algorithms that allow us to determine whether a given social network satisfies one of the above properties.\n  We also study algorithmic questions for networks without unique outcomes. We show that the problem of computing the"},"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":"1105.2434","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-12T11:44:58Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"9943fd822ea66773107af91cbac319fcc1970f8772844bc3c1d4fb55581711c1","abstract_canon_sha256":"0af8fc68481d6cffb6185fa1b66a47bc9637d22824eea999bde5d838a5bd4057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.335934Z","signature_b64":"rOVdtwr9880Kl1q0y/+TQWhsC20of5hYxmxem2I7tbRaoe3CqGUso9IeXjD3aJJb2GLoHhHJysV/vftxDvfGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8db1fcc00c85e42981e13d49dcafe2ca46a12fb9597d8de7266e349b04c4b013","last_reissued_at":"2026-05-18T02:22:00.335044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.335044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion in Social Networks with Competing Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Evangelos Markakis, Krzysztof R. Apt","submitted_at":"2011-05-12T11:44:58Z","abstract_excerpt":"We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible (respectively necessary) and the ones for which a unique outcome is guaranteed. These characterizations directly yield polynomial time algorithms that allow us to determine whether a given social network satisfies one of the above properties.\n  We also study algorithmic questions for networks without unique outcomes. We show that the problem of computing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2434","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":"1105.2434","created_at":"2026-05-18T02:22:00.335257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2434v3","created_at":"2026-05-18T02:22:00.335257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2434","created_at":"2026-05-18T02:22:00.335257+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWY7ZQAMQXSC","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWY7ZQAMQXSCTAPB","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWY7ZQAM","created_at":"2026-05-18T12:26:41.206345+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/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ","json":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ.json","graph_json":"https://pith.science/api/pith-number/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/graph.json","events_json":"https://pith.science/api/pith-number/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/events.json","paper":"https://pith.science/paper/RWY7ZQAM"},"agent_actions":{"view_html":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ","download_json":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ.json","view_paper":"https://pith.science/paper/RWY7ZQAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2434&json=true","fetch_graph":"https://pith.science/api/pith-number/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/action/storage_attestation","attest_author":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/action/author_attestation","sign_citation":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/action/citation_signature","submit_replication":"https://pith.science/pith/RWY7ZQAMQXSCTAPBHVE5ZL7CZJ/action/replication_record"}},"created_at":"2026-05-18T02:22:00.335257+00:00","updated_at":"2026-05-18T02:22:00.335257+00:00"}