{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2IWDRNWVCOFCT5WEAGXZNO2MSL","short_pith_number":"pith:2IWDRNWV","canonical_record":{"source":{"id":"1305.5050","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T08:44:10Z","cross_cats_sorted":[],"title_canon_sha256":"4defd87317725376f5240b90490c54b28746c576e6865c148851bd28ae2c5fbb","abstract_canon_sha256":"13fb72853eee197b5c27992e57b43025bab9cc1150291035f63bb44d3dea6b2f"},"schema_version":"1.0"},"canonical_sha256":"d22c38b6d5138a29f6c401af96bb4c92e59c3f1849f83d50cb364a84404ed458","source":{"kind":"arxiv","id":"1305.5050","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5050","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5050v3","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5050","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"2IWDRNWVCOFC","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2IWDRNWVCOFCT5WE","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2IWDRNWV","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2IWDRNWVCOFCT5WEAGXZNO2MSL","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5050","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T08:44:10Z","cross_cats_sorted":[],"title_canon_sha256":"4defd87317725376f5240b90490c54b28746c576e6865c148851bd28ae2c5fbb","abstract_canon_sha256":"13fb72853eee197b5c27992e57b43025bab9cc1150291035f63bb44d3dea6b2f"},"schema_version":"1.0"},"canonical_sha256":"d22c38b6d5138a29f6c401af96bb4c92e59c3f1849f83d50cb364a84404ed458","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:18.227198Z","signature_b64":"OQjjyIm43IYvy5ujub4paluKsE/SqK56hcR3VE6xN0TENdj4+Z+knguwi7YyYZFExMu8Ol5dmCteWNgtY3mXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d22c38b6d5138a29f6c401af96bb4c92e59c3f1849f83d50cb364a84404ed458","last_reissued_at":"2026-05-18T03:18:18.226780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:18.226780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5050","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-18T03:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrpPpqxbFkXNoXs2U+p8M0zHzdO39FSSG80KBYTodfmRLesa7mfQbjXdGkEjtOyzB9LaxWY3DgthDT7HAl3XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:36:40.249829Z"},"content_sha256":"a09228ad4895309d0c1e378e8503eb12f760ad5d2e4abf0db22e56b0f0c811ec","schema_version":"1.0","event_id":"sha256:a09228ad4895309d0c1e378e8503eb12f760ad5d2e4abf0db22e56b0f0c811ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2IWDRNWVCOFCT5WEAGXZNO2MSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Social Network Games with Obligatory Product Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krzysztof R. Apt, Sunil Simon","submitted_at":"2013-05-22T08:44:10Z","abstract_excerpt":"Recently, Apt and Markakis introduced a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives (products). To analyze these networks we introduce social network games in which product adoption is obligatory.\n  We show that when the underlying graph is a simple cycle, there is a polynomial time algorithm allowing us to determine whether the game has a Nash equilibrium. In contrast, in the arbitrary case this problem is NP-complete. We also show that the problem of determining whether the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5050","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-18T03:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prRJ+x+YPFC4cSxpWGfzhWGAcW0RFt/scFEuSBJ252JmIZdWQBuWxdG9SdHxu8m0zRyoKgsMJqAw0H8B48yyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:36:40.250576Z"},"content_sha256":"9ef6882374603c1160bffa62653d4c30b2d0ce97f1a25d5bded56130f211ff05","schema_version":"1.0","event_id":"sha256:9ef6882374603c1160bffa62653d4c30b2d0ce97f1a25d5bded56130f211ff05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL/bundle.json","state_url":"https://pith.science/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL/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-05-26T02:36:40Z","links":{"resolver":"https://pith.science/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL","bundle":"https://pith.science/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL/bundle.json","state":"https://pith.science/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IWDRNWVCOFCT5WEAGXZNO2MSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2IWDRNWVCOFCT5WEAGXZNO2MSL","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":"13fb72853eee197b5c27992e57b43025bab9cc1150291035f63bb44d3dea6b2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T08:44:10Z","title_canon_sha256":"4defd87317725376f5240b90490c54b28746c576e6865c148851bd28ae2c5fbb"},"schema_version":"1.0","source":{"id":"1305.5050","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5050","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5050v3","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5050","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"2IWDRNWVCOFC","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2IWDRNWVCOFCT5WE","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2IWDRNWV","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:9ef6882374603c1160bffa62653d4c30b2d0ce97f1a25d5bded56130f211ff05","target":"graph","created_at":"2026-05-18T03:18:18Z","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":"Recently, Apt and Markakis introduced a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives (products). To analyze these networks we introduce social network games in which product adoption is obligatory.\n  We show that when the underlying graph is a simple cycle, there is a polynomial time algorithm allowing us to determine whether the game has a Nash equilibrium. In contrast, in the arbitrary case this problem is NP-complete. We also show that the problem of determining whether the g","authors_text":"Krzysztof R. Apt, Sunil Simon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T08:44:10Z","title":"Social Network Games with Obligatory Product Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5050","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:a09228ad4895309d0c1e378e8503eb12f760ad5d2e4abf0db22e56b0f0c811ec","target":"record","created_at":"2026-05-18T03:18:18Z","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":"13fb72853eee197b5c27992e57b43025bab9cc1150291035f63bb44d3dea6b2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T08:44:10Z","title_canon_sha256":"4defd87317725376f5240b90490c54b28746c576e6865c148851bd28ae2c5fbb"},"schema_version":"1.0","source":{"id":"1305.5050","kind":"arxiv","version":3}},"canonical_sha256":"d22c38b6d5138a29f6c401af96bb4c92e59c3f1849f83d50cb364a84404ed458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d22c38b6d5138a29f6c401af96bb4c92e59c3f1849f83d50cb364a84404ed458","first_computed_at":"2026-05-18T03:18:18.226780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:18.226780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OQjjyIm43IYvy5ujub4paluKsE/SqK56hcR3VE6xN0TENdj4+Z+knguwi7YyYZFExMu8Ol5dmCteWNgtY3mXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:18.227198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5050","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a09228ad4895309d0c1e378e8503eb12f760ad5d2e4abf0db22e56b0f0c811ec","sha256:9ef6882374603c1160bffa62653d4c30b2d0ce97f1a25d5bded56130f211ff05"],"state_sha256":"8c403376a5101c736f83d83936ede6288fde913fe9f480d79976f1ec156ee7cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixdNp5fw4hSvfJ7PDqxVqHD6wa2DsVXnPS6MCnXBdYgmtNy0c9W4HHK0TEv94Guj1Tp8xkb3s51o1Jibq+T+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:36:40.253386Z","bundle_sha256":"42edbea8f484267e8f14be07e3fb9f3d2ff63d1de87f1a630d563d543838bdf9"}}