{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7GVIZG5VWH2QM7DQIYYZIS4XRY","short_pith_number":"pith:7GVIZG5V","canonical_record":{"source":{"id":"1402.3450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-14T12:31:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"93d63a212f2b0b48bcd6d045d714e329f2c826544db4de95993fd2f98f60d109","abstract_canon_sha256":"54abbd9e10acb4a8b70b9f1baf0f2f12d792969e434fdf9159be71209897b8fe"},"schema_version":"1.0"},"canonical_sha256":"f9aa8c9bb5b1f5067c704631944b978e0cf47efb5bacfd7f734b8490e56cdc36","source":{"kind":"arxiv","id":"1402.3450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3450","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3450v1","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3450","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"pith_short_12","alias_value":"7GVIZG5VWH2Q","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7GVIZG5VWH2QM7DQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7GVIZG5V","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7GVIZG5VWH2QM7DQIYYZIS4XRY","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-14T12:31:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"93d63a212f2b0b48bcd6d045d714e329f2c826544db4de95993fd2f98f60d109","abstract_canon_sha256":"54abbd9e10acb4a8b70b9f1baf0f2f12d792969e434fdf9159be71209897b8fe"},"schema_version":"1.0"},"canonical_sha256":"f9aa8c9bb5b1f5067c704631944b978e0cf47efb5bacfd7f734b8490e56cdc36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:05.141205Z","signature_b64":"WimslfPEcPp/PD7G0CITKjMZNm3avWgTbKqID9OOikGtPgRJgLSQ99TvAD0newDyD59NxWlFB/BUpUG5S9v4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9aa8c9bb5b1f5067c704631944b978e0cf47efb5bacfd7f734b8490e56cdc36","last_reissued_at":"2026-05-18T02:59:05.140547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:05.140547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3450","source_version":1,"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-18T02:59:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeLh4sCYtfU6xDPZPXhJ1DSuBiwxinvMzoqGEuedsckFZgScAKmg6vP8l+h7TzV0HMcOzCVYCQwPFmpChZ7bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:59:38.553446Z"},"content_sha256":"e17acd06caf0e02132b5887de7b1501e5169cad4c53a60a7ac412a9b715ad438","schema_version":"1.0","event_id":"sha256:e17acd06caf0e02132b5887de7b1501e5169cad4c53a60a7ac412a9b715ad438"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7GVIZG5VWH2QM7DQIYYZIS4XRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Angelo Fanelli, Ioannis Caragiannis, Nick Gravin","submitted_at":"2014-02-14T12:31:36Z","abstract_excerpt":"We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation games. Our results improve previous ones by Bhalgat et al.~(EC 10) in terms of the obtained approximation guarantee. More importantly, our algorithm identifies a polynomially-long sequence of improvement moves from any initial state to an approximate equilibrium in these games. The existence of such short sequences is an interesting structural property which, to the best of our knowledge, was not known before. Our tech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3450","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"},"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-18T02:59:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIF2eI5pFrWt7mugye67vS6lHTcHkmMK9RpT7UhA+qFfHtKKaY8hgGrfXWQlXzNC/ojUIq2SMJeXEE8Ka6kjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:59:38.554143Z"},"content_sha256":"7c3e7fbea0573ee7d2d6bbe7a6ada495f4b11b29860c142d6b00dad0748eb029","schema_version":"1.0","event_id":"sha256:7c3e7fbea0573ee7d2d6bbe7a6ada495f4b11b29860c142d6b00dad0748eb029"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY/bundle.json","state_url":"https://pith.science/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY/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-22T13:59:38Z","links":{"resolver":"https://pith.science/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY","bundle":"https://pith.science/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY/bundle.json","state":"https://pith.science/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GVIZG5VWH2QM7DQIYYZIS4XRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7GVIZG5VWH2QM7DQIYYZIS4XRY","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":"54abbd9e10acb4a8b70b9f1baf0f2f12d792969e434fdf9159be71209897b8fe","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-14T12:31:36Z","title_canon_sha256":"93d63a212f2b0b48bcd6d045d714e329f2c826544db4de95993fd2f98f60d109"},"schema_version":"1.0","source":{"id":"1402.3450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3450","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3450v1","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3450","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"pith_short_12","alias_value":"7GVIZG5VWH2Q","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7GVIZG5VWH2QM7DQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7GVIZG5V","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:7c3e7fbea0573ee7d2d6bbe7a6ada495f4b11b29860c142d6b00dad0748eb029","target":"graph","created_at":"2026-05-18T02:59:05Z","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":"We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation games. Our results improve previous ones by Bhalgat et al.~(EC 10) in terms of the obtained approximation guarantee. More importantly, our algorithm identifies a polynomially-long sequence of improvement moves from any initial state to an approximate equilibrium in these games. The existence of such short sequences is an interesting structural property which, to the best of our knowledge, was not known before. Our tech","authors_text":"Angelo Fanelli, Ioannis Caragiannis, Nick Gravin","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-14T12:31:36Z","title":"Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3450","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:e17acd06caf0e02132b5887de7b1501e5169cad4c53a60a7ac412a9b715ad438","target":"record","created_at":"2026-05-18T02:59:05Z","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":"54abbd9e10acb4a8b70b9f1baf0f2f12d792969e434fdf9159be71209897b8fe","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-14T12:31:36Z","title_canon_sha256":"93d63a212f2b0b48bcd6d045d714e329f2c826544db4de95993fd2f98f60d109"},"schema_version":"1.0","source":{"id":"1402.3450","kind":"arxiv","version":1}},"canonical_sha256":"f9aa8c9bb5b1f5067c704631944b978e0cf47efb5bacfd7f734b8490e56cdc36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9aa8c9bb5b1f5067c704631944b978e0cf47efb5bacfd7f734b8490e56cdc36","first_computed_at":"2026-05-18T02:59:05.140547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:05.140547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WimslfPEcPp/PD7G0CITKjMZNm3avWgTbKqID9OOikGtPgRJgLSQ99TvAD0newDyD59NxWlFB/BUpUG5S9v4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:05.141205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e17acd06caf0e02132b5887de7b1501e5169cad4c53a60a7ac412a9b715ad438","sha256:7c3e7fbea0573ee7d2d6bbe7a6ada495f4b11b29860c142d6b00dad0748eb029"],"state_sha256":"46dbec6a1d7469f9b792529eafc2480690adb3245de08d68b5cf952741f076c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adzkijLqdqF9truh/jOf/vC0Hb0FiPahguTKmav9G44ZqPQ/saST+y+9wB9IucfdXXLfuQIBaZARzXJwJ5GcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T13:59:38.558118Z","bundle_sha256":"ca31d850b71263501dc6a1898318b3f798ea5b159c2ede936659efa04bfc502d"}}