{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:62M6SMSNWFU2XASSOY54JJADIW","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":"88ea55e46350a7534ac226ad438eca9edf231956e062fbf60d08152b8566f5be","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2022-11-08T09:27:53Z","title_canon_sha256":"34111c6a54dbce497084236097f26ce673e81250b9ca4c70d00bdcf78ab7c2b4"},"schema_version":"1.0","source":{"id":"2211.04117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04117","created_at":"2026-07-05T05:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04117v1","created_at":"2026-07-05T05:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04117","created_at":"2026-07-05T05:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"62M6SMSNWFU2","created_at":"2026-07-05T05:14:02Z"},{"alias_kind":"pith_short_16","alias_value":"62M6SMSNWFU2XASS","created_at":"2026-07-05T05:14:02Z"},{"alias_kind":"pith_short_8","alias_value":"62M6SMSN","created_at":"2026-07-05T05:14:02Z"}],"graph_snapshots":[{"event_id":"sha256:2ed61e3da4408dd647928bfcc0fc3874493e8997d3b429f5333ea70b24e654be","target":"graph","created_at":"2026-07-05T05:14:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.04117/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ioannis Caragiannis, Zhile Jiang","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2022-11-08T09:27:53Z","title":"Computing better approximate pure Nash equilibria in cut games via semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04117","kind":"arxiv","version":1},"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:65c9fd634952ae7b36f9654dd03109ee4965938a2a870bab7d43f66bdb6b0ebb","target":"record","created_at":"2026-07-05T05:14:02Z","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":"88ea55e46350a7534ac226ad438eca9edf231956e062fbf60d08152b8566f5be","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2022-11-08T09:27:53Z","title_canon_sha256":"34111c6a54dbce497084236097f26ce673e81250b9ca4c70d00bdcf78ab7c2b4"},"schema_version":"1.0","source":{"id":"2211.04117","kind":"arxiv","version":1}},"canonical_sha256":"f699e9324db169ab8252763bc4a40345a55e4e98c19e97d04de7cd974d1824c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f699e9324db169ab8252763bc4a40345a55e4e98c19e97d04de7cd974d1824c7","first_computed_at":"2026-07-05T05:14:02.228565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:14:02.228565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Se7qnFHpIPMC+ydRWGFmQ3o4mx87WTpTdf3eibhFhnKYnqmT0YSiW/8GS53vyLhF1MVkuERuTH1Wo9MHHtLsBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:14:02.229000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65c9fd634952ae7b36f9654dd03109ee4965938a2a870bab7d43f66bdb6b0ebb","sha256:2ed61e3da4408dd647928bfcc0fc3874493e8997d3b429f5333ea70b24e654be"],"state_sha256":"a36e7d0e42caa04890c0627c042380358def06d0b39fdefab7075742e550ce29"}