{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HVCBSHOGKLCKH4WKPLXJHUODQ5","short_pith_number":"pith:HVCBSHOG","schema_version":"1.0","canonical_sha256":"3d44191dc652c4a3f2ca7aee93d1c3875e6c97aa265447fdeafe05f19e6257ef","source":{"kind":"arxiv","id":"1204.5636","version":4},"attestation_state":"computed","paper":{"title":"Social Networks with Competing Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Evangelos Markakis, Krzysztof R. Apt","submitted_at":"2012-04-25T12:27:35Z","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 social networks 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 determin"},"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":"1204.5636","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-25T12:27:35Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"7c3fb3bbdcb18a628e134386e848c79360bae0ed4db315e01bd78f9f1b26b0c5","abstract_canon_sha256":"9f954fe85328f4a9efe14072b2070a92d96779f62934bf4c85d61d917511c7a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.968572Z","signature_b64":"vDZ6BEtEEj790pAcV0hEnDWsJjhFiS/d/ao5wQdJ3VzSjNcTk1XDQWZLK52OxoLkuLQ9RrnXzmm2TIk0KLgtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d44191dc652c4a3f2ca7aee93d1c3875e6c97aa265447fdeafe05f19e6257ef","last_reissued_at":"2026-05-18T02:21:15.967991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.967991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Social Networks with Competing Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Evangelos Markakis, Krzysztof R. Apt","submitted_at":"2012-04-25T12:27:35Z","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 social networks 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 determin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5636","kind":"arxiv","version":4},"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":"1204.5636","created_at":"2026-05-18T02:21:15.968078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5636v4","created_at":"2026-05-18T02:21:15.968078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5636","created_at":"2026-05-18T02:21:15.968078+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVCBSHOGKLCK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVCBSHOGKLCKH4WK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVCBSHOG","created_at":"2026-05-18T12:27:09.501522+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/HVCBSHOGKLCKH4WKPLXJHUODQ5","json":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5.json","graph_json":"https://pith.science/api/pith-number/HVCBSHOGKLCKH4WKPLXJHUODQ5/graph.json","events_json":"https://pith.science/api/pith-number/HVCBSHOGKLCKH4WKPLXJHUODQ5/events.json","paper":"https://pith.science/paper/HVCBSHOG"},"agent_actions":{"view_html":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5","download_json":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5.json","view_paper":"https://pith.science/paper/HVCBSHOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5636&json=true","fetch_graph":"https://pith.science/api/pith-number/HVCBSHOGKLCKH4WKPLXJHUODQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/HVCBSHOGKLCKH4WKPLXJHUODQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5/action/storage_attestation","attest_author":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5/action/author_attestation","sign_citation":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5/action/citation_signature","submit_replication":"https://pith.science/pith/HVCBSHOGKLCKH4WKPLXJHUODQ5/action/replication_record"}},"created_at":"2026-05-18T02:21:15.968078+00:00","updated_at":"2026-05-18T02:21:15.968078+00:00"}