{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RN7LA6XDFL2G45SSJFI437535F","short_pith_number":"pith:RN7LA6XD","schema_version":"1.0","canonical_sha256":"8b7eb07ae32af46e76524951cdffbbe9627b58c17284751e62542a76f41b953c","source":{"kind":"arxiv","id":"1905.11680","version":1},"attestation_state":"computed","paper":{"title":"Computational Aspects of Equilibria in Discrete Preference Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gyana R Parija, Pankaj S Dayama, Phani Raj Lolakapuri, Ramasuri Narayanam, Umang Bhaskar","submitted_at":"2019-05-28T08:35:58Z","abstract_excerpt":"We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decision-making by agents in a social network that choose a strategy from a finite, discrete set, balancing between their intrinsic preferences for the strategies and their desire to choose a strategy that is `similar' to their neighbours. There are thus two components: a social network with the agents as vertices, and a metric space of strategies. These games are potential games, and hence pure Nash equilibria exist. Sinc"},"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":"1905.11680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-28T08:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"6060f0713aa498749f961d9896cd8b2c629aaa03de1938b446ed7399735a71db","abstract_canon_sha256":"c1f1dd478f3484c5fd3fdff5643221134a9b219529a40945800614ca68cc6df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:52.677729Z","signature_b64":"kj15XE1sd7t+qKrXWRqqPdX+G1RS2ldbicnqleeroCc/+0k7r2jVp335Uy11/zvGOqwYaX3aGAJ2pCzIHwtZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7eb07ae32af46e76524951cdffbbe9627b58c17284751e62542a76f41b953c","last_reissued_at":"2026-05-17T23:44:52.676899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:52.676899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Aspects of Equilibria in Discrete Preference Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gyana R Parija, Pankaj S Dayama, Phani Raj Lolakapuri, Ramasuri Narayanam, Umang Bhaskar","submitted_at":"2019-05-28T08:35:58Z","abstract_excerpt":"We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decision-making by agents in a social network that choose a strategy from a finite, discrete set, balancing between their intrinsic preferences for the strategies and their desire to choose a strategy that is `similar' to their neighbours. There are thus two components: a social network with the agents as vertices, and a metric space of strategies. These games are potential games, and hence pure Nash equilibria exist. Sinc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11680","kind":"arxiv","version":1},"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":"1905.11680","created_at":"2026-05-17T23:44:52.677044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11680v1","created_at":"2026-05-17T23:44:52.677044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11680","created_at":"2026-05-17T23:44:52.677044+00:00"},{"alias_kind":"pith_short_12","alias_value":"RN7LA6XDFL2G","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RN7LA6XDFL2G45SS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RN7LA6XD","created_at":"2026-05-18T12:33:27.125529+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/RN7LA6XDFL2G45SSJFI437535F","json":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F.json","graph_json":"https://pith.science/api/pith-number/RN7LA6XDFL2G45SSJFI437535F/graph.json","events_json":"https://pith.science/api/pith-number/RN7LA6XDFL2G45SSJFI437535F/events.json","paper":"https://pith.science/paper/RN7LA6XD"},"agent_actions":{"view_html":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F","download_json":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F.json","view_paper":"https://pith.science/paper/RN7LA6XD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11680&json=true","fetch_graph":"https://pith.science/api/pith-number/RN7LA6XDFL2G45SSJFI437535F/graph.json","fetch_events":"https://pith.science/api/pith-number/RN7LA6XDFL2G45SSJFI437535F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F/action/storage_attestation","attest_author":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F/action/author_attestation","sign_citation":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F/action/citation_signature","submit_replication":"https://pith.science/pith/RN7LA6XDFL2G45SSJFI437535F/action/replication_record"}},"created_at":"2026-05-17T23:44:52.677044+00:00","updated_at":"2026-05-17T23:44:52.677044+00:00"}