{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XL6XS5ACZK4KTBKICQEGCHRG4I","short_pith_number":"pith:XL6XS5AC","schema_version":"1.0","canonical_sha256":"bafd797402cab8a985481408611e26e21edaf3ffdfd5edc6890b0e56414fa010","source":{"kind":"arxiv","id":"1604.04809","version":1},"attestation_state":"computed","paper":{"title":"Efficient Local Search in Coordination Games on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Dominik Wojtczak, Sunil Simon","submitted_at":"2016-04-16T23:07:59Z","abstract_excerpt":"We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given strategy. These games capture the idea of coordination in the absence of globally common strategies. Prior work shows that the problem of determining the existence of a pure Nash equilibrium for these games is NP-complete already for graphs with all weights equal to one and no bonuses. However, for several classes of graphs (e.g. DAGs and cliques) pure Nash equili"},"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":"1604.04809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-16T23:07:59Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"7e82b0f94c526e3d0993940d070865798efe7d3690db53817c107cd7c4de4711","abstract_canon_sha256":"771160919b7d183aec8c4fc7d1b54261624cf67b73fae4c06127554ba4b43c79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:58.451195Z","signature_b64":"hfaJPxikrcQ4NIs79xjIKfH4viA47jjM1fg04XlyvTQoQY4MQq3dzvvQzXgffmPY6JTLFrH+91QJmCbPI5dtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bafd797402cab8a985481408611e26e21edaf3ffdfd5edc6890b0e56414fa010","last_reissued_at":"2026-05-18T01:16:58.450529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:58.450529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Local Search in Coordination Games on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Dominik Wojtczak, Sunil Simon","submitted_at":"2016-04-16T23:07:59Z","abstract_excerpt":"We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given strategy. These games capture the idea of coordination in the absence of globally common strategies. Prior work shows that the problem of determining the existence of a pure Nash equilibrium for these games is NP-complete already for graphs with all weights equal to one and no bonuses. However, for several classes of graphs (e.g. DAGs and cliques) pure Nash equili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04809","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":"1604.04809","created_at":"2026-05-18T01:16:58.450621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04809v1","created_at":"2026-05-18T01:16:58.450621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04809","created_at":"2026-05-18T01:16:58.450621+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL6XS5ACZK4K","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL6XS5ACZK4KTBKI","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL6XS5AC","created_at":"2026-05-18T12:30:51.357362+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/XL6XS5ACZK4KTBKICQEGCHRG4I","json":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I.json","graph_json":"https://pith.science/api/pith-number/XL6XS5ACZK4KTBKICQEGCHRG4I/graph.json","events_json":"https://pith.science/api/pith-number/XL6XS5ACZK4KTBKICQEGCHRG4I/events.json","paper":"https://pith.science/paper/XL6XS5AC"},"agent_actions":{"view_html":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I","download_json":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I.json","view_paper":"https://pith.science/paper/XL6XS5AC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04809&json=true","fetch_graph":"https://pith.science/api/pith-number/XL6XS5ACZK4KTBKICQEGCHRG4I/graph.json","fetch_events":"https://pith.science/api/pith-number/XL6XS5ACZK4KTBKICQEGCHRG4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I/action/storage_attestation","attest_author":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I/action/author_attestation","sign_citation":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I/action/citation_signature","submit_replication":"https://pith.science/pith/XL6XS5ACZK4KTBKICQEGCHRG4I/action/replication_record"}},"created_at":"2026-05-18T01:16:58.450621+00:00","updated_at":"2026-05-18T01:16:58.450621+00:00"}