{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:62M6SMSNWFU2XASSOY54JJADIW","short_pith_number":"pith:62M6SMSN","schema_version":"1.0","canonical_sha256":"f699e9324db169ab8252763bc4a40345a55e4e98c19e97d04de7cd974d1824c7","source":{"kind":"arxiv","id":"2211.04117","version":1},"attestation_state":"computed","paper":{"title":"Computing better approximate pure Nash equilibria in cut games via semidefinite programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.GT","authors_text":"Ioannis Caragiannis, Zhile Jiang","submitted_at":"2022-11-08T09:27:53Z","abstract_excerpt":"Cut games are among the most fundamental strategic games in algorithmic game theory. It is well-known that computing an exact pure Nash equilibrium in these games is PLS-hard, so research has focused on computing approximate equilibria. We present a polynomial-time algorithm that computes $2.7371$-approximate pure Nash equilibria in cut games. This is the first improvement to the previously best-known bound of $3$, due to the work of Bhalgat, Chakraborty, and Khanna from EC 2010. Our algorithm is based on a general recipe proposed by Caragiannis, Fanelli, Gravin, and Skopalik from FOCS 2011 an"},"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":"2211.04117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2022-11-08T09:27:53Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"34111c6a54dbce497084236097f26ce673e81250b9ca4c70d00bdcf78ab7c2b4","abstract_canon_sha256":"88ea55e46350a7534ac226ad438eca9edf231956e062fbf60d08152b8566f5be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:14:02.229000Z","signature_b64":"Se7qnFHpIPMC+ydRWGFmQ3o4mx87WTpTdf3eibhFhnKYnqmT0YSiW/8GS53vyLhF1MVkuERuTH1Wo9MHHtLsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f699e9324db169ab8252763bc4a40345a55e4e98c19e97d04de7cd974d1824c7","last_reissued_at":"2026-07-05T05:14:02.228565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:14:02.228565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing better approximate pure Nash equilibria in cut games via semidefinite programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.GT","authors_text":"Ioannis Caragiannis, Zhile Jiang","submitted_at":"2022-11-08T09:27:53Z","abstract_excerpt":"Cut games are among the most fundamental strategic games in algorithmic game theory. It is well-known that computing an exact pure Nash equilibrium in these games is PLS-hard, so research has focused on computing approximate equilibria. We present a polynomial-time algorithm that computes $2.7371$-approximate pure Nash equilibria in cut games. This is the first improvement to the previously best-known bound of $3$, due to the work of Bhalgat, Chakraborty, and Khanna from EC 2010. Our algorithm is based on a general recipe proposed by Caragiannis, Fanelli, Gravin, and Skopalik from FOCS 2011 an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04117","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.04117/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.04117","created_at":"2026-07-05T05:14:02.228617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04117v1","created_at":"2026-07-05T05:14:02.228617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04117","created_at":"2026-07-05T05:14:02.228617+00:00"},{"alias_kind":"pith_short_12","alias_value":"62M6SMSNWFU2","created_at":"2026-07-05T05:14:02.228617+00:00"},{"alias_kind":"pith_short_16","alias_value":"62M6SMSNWFU2XASS","created_at":"2026-07-05T05:14:02.228617+00:00"},{"alias_kind":"pith_short_8","alias_value":"62M6SMSN","created_at":"2026-07-05T05:14:02.228617+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/62M6SMSNWFU2XASSOY54JJADIW","json":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW.json","graph_json":"https://pith.science/api/pith-number/62M6SMSNWFU2XASSOY54JJADIW/graph.json","events_json":"https://pith.science/api/pith-number/62M6SMSNWFU2XASSOY54JJADIW/events.json","paper":"https://pith.science/paper/62M6SMSN"},"agent_actions":{"view_html":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW","download_json":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW.json","view_paper":"https://pith.science/paper/62M6SMSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04117&json=true","fetch_graph":"https://pith.science/api/pith-number/62M6SMSNWFU2XASSOY54JJADIW/graph.json","fetch_events":"https://pith.science/api/pith-number/62M6SMSNWFU2XASSOY54JJADIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW/action/storage_attestation","attest_author":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW/action/author_attestation","sign_citation":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW/action/citation_signature","submit_replication":"https://pith.science/pith/62M6SMSNWFU2XASSOY54JJADIW/action/replication_record"}},"created_at":"2026-07-05T05:14:02.228617+00:00","updated_at":"2026-07-05T05:14:02.228617+00:00"}