{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BALH5VMBNDEUJKN3QTCL5TMJDY","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":"1fdb3596fc73714734baa528315c004043455469f249f8bef6d74d8bdec0dae9","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-01T09:26:50Z","title_canon_sha256":"b7ef22293f4bfdb8cc6c388efcdd7548f1f90ee0c7cd42a6df4aa0ba7ea8509f"},"schema_version":"1.0","source":{"id":"2606.01963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01963","created_at":"2026-06-02T02:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01963v1","created_at":"2026-06-02T02:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01963","created_at":"2026-06-02T02:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"BALH5VMBNDEU","created_at":"2026-06-02T02:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"BALH5VMBNDEUJKN3","created_at":"2026-06-02T02:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"BALH5VMB","created_at":"2026-06-02T02:05:02Z"}],"graph_snapshots":[{"event_id":"sha256:18af4749fa54bdb3aeb56fca872d88b0b1eec6cc0a5d8f9f308bb0b909c9b496","target":"graph","created_at":"2026-06-02T02:05: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/2606.01963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study local pure coordination games on finite social networks, continuing the framework of Hutchcroft, Rospuskova, and Tamuz. They showed that low inefficiency in local coordination forces the underlying graph to be amenable, with a square-root loss in the amenability parameter. We improve this loss in the binary unbiased setting. Using Shapley values of a mutual-information game associated with the players' local outputs, we prove that if the average disagreement is at most $\\varepsilon$, then the graph is $(O(\\varepsilon\\log(1/\\varepsilon)),r)$-amenable. This gives a sharper quantitative ","authors_text":"Dean Kraizberg, Ron Peretz","cross_cats":["cs.IT","math.IT","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-01T09:26:50Z","title":"Improved Amenability Bounds for Local Coordination Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01963","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:fa39b20ead06a8d4c3b83db3462fbe57050deab405bfb04e0de695143057d6aa","target":"record","created_at":"2026-06-02T02:05: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":"1fdb3596fc73714734baa528315c004043455469f249f8bef6d74d8bdec0dae9","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-01T09:26:50Z","title_canon_sha256":"b7ef22293f4bfdb8cc6c388efcdd7548f1f90ee0c7cd42a6df4aa0ba7ea8509f"},"schema_version":"1.0","source":{"id":"2606.01963","kind":"arxiv","version":1}},"canonical_sha256":"08167ed58168c944a9bb84c4becd891e12b7a769627efdd1dee5f864b8a48083","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08167ed58168c944a9bb84c4becd891e12b7a769627efdd1dee5f864b8a48083","first_computed_at":"2026-06-02T02:05:02.108779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:02.108779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jqPaltvrzYFCOH7h5OyMZIzoXRrV46L32ylFPdJzTQgHzfM90T+EFimouVngbLnd+u2krd10TCvEJcdI17mZCA==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:02.109188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa39b20ead06a8d4c3b83db3462fbe57050deab405bfb04e0de695143057d6aa","sha256:18af4749fa54bdb3aeb56fca872d88b0b1eec6cc0a5d8f9f308bb0b909c9b496"],"state_sha256":"a4f6930a49e013ea8455c9f98ca2795a0739911a9f39b1fa1bb1fbfd87bbe627"}