{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YK22FT4G6AI5KFWYLTHC3Y5K4V","short_pith_number":"pith:YK22FT4G","canonical_record":{"source":{"id":"2608.05327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-05T18:34:19Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"baa2b67ce970b1be682edc26cfe7fc37a46f8a145761043f26be076086fbb18a","abstract_canon_sha256":"1332328961f486815dd92dbd8671db1c9cc54b367290b69a152f82bb3a7fdb75"},"schema_version":"1.0"},"canonical_sha256":"c2b5a2cf86f011d516d85cce2de3aae5531a88de3784eb0c6ee518a3acc65a4e","source":{"kind":"arxiv","id":"2608.05327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05327","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05327v1","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05327","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"YK22FT4G6AI5","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"pith_short_16","alias_value":"YK22FT4G6AI5KFWY","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"pith_short_8","alias_value":"YK22FT4G","created_at":"2026-08-07T00:47:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YK22FT4G6AI5KFWYLTHC3Y5K4V","target":"record","payload":{"canonical_record":{"source":{"id":"2608.05327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-05T18:34:19Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"baa2b67ce970b1be682edc26cfe7fc37a46f8a145761043f26be076086fbb18a","abstract_canon_sha256":"1332328961f486815dd92dbd8671db1c9cc54b367290b69a152f82bb3a7fdb75"},"schema_version":"1.0"},"canonical_sha256":"c2b5a2cf86f011d516d85cce2de3aae5531a88de3784eb0c6ee518a3acc65a4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:47:01.183378Z","signature_b64":"7csksSl2Vkiswd9K9/eEQM8ewQFrbyAv3HdmfLhrg1q5YS4KiSBZuceWIZSNgGmrRrRaYi4klGenT9P/UdPoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b5a2cf86f011d516d85cce2de3aae5531a88de3784eb0c6ee518a3acc65a4e","last_reissued_at":"2026-08-07T00:47:01.181772Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:47:01.181772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.05327","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-08-07T00:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptLx3BlRee6yhA7hE7pAC7j2Q/bKrlHVde9VcNtNQbYru7gDjHi3vkXnjpv/FMSqa8uOQxyKe1qggYspkoF7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:46:37.382087Z"},"content_sha256":"69b68b6971bafef164651771ca956a89fc276a8035c5789156c01738d5b23771","schema_version":"1.0","event_id":"sha256:69b68b6971bafef164651771ca956a89fc276a8035c5789156c01738d5b23771"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YK22FT4G6AI5KFWYLTHC3Y5K4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.GT","authors_text":"Mark Bedaywi, Nika Haghtalab, Scott Emmons, Stuart Russell","submitted_at":"2026-08-05T18:34:19Z","abstract_excerpt":"Our results show that the existence of a short high-utility protocol already suffices for efficient communication. In particular, in a game with $n$ possible observations and $m$ actions: (1) For any achievable target utility $\\alpha$, we give an algorithm with $\\mathrm{poly}(n, m, 1/\\epsilon)$ runtime that designs a protocol achieving utility at least $\\alpha-\\epsilon$ using only $2^{\\mathcal O(CC_\\alpha(G))}/\\epsilon^2$ bits of communication. Here, $CC_\\alpha(G)$ is the minimum number of bits used by any protocol, even a computationally inefficient one, to achieve utility $\\alpha$. (2) We pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05327","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/2608.05327/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"},"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-08-07T00:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nO/kxqXMzUMe7xx/rRaxHu/uXhmfdUcwkehlrFgu/3Ukj7df3MsGPE9QCbjPwXn1AFXhzCdo9eDZOLjDAwihCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:46:37.382597Z"},"content_sha256":"e9ae25c122e5f6d80f7f974e7ca2e4bb91148b64531ebf5f647ebf6c11cf7f56","schema_version":"1.0","event_id":"sha256:e9ae25c122e5f6d80f7f974e7ca2e4bb91148b64531ebf5f647ebf6c11cf7f56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/bundle.json","state_url":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/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-08-09T08:46:37Z","links":{"resolver":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V","bundle":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/bundle.json","state":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YK22FT4G6AI5KFWYLTHC3Y5K4V","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":"1332328961f486815dd92dbd8671db1c9cc54b367290b69a152f82bb3a7fdb75","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-05T18:34:19Z","title_canon_sha256":"baa2b67ce970b1be682edc26cfe7fc37a46f8a145761043f26be076086fbb18a"},"schema_version":"1.0","source":{"id":"2608.05327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05327","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05327v1","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05327","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"YK22FT4G6AI5","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"pith_short_16","alias_value":"YK22FT4G6AI5KFWY","created_at":"2026-08-07T00:47:01Z"},{"alias_kind":"pith_short_8","alias_value":"YK22FT4G","created_at":"2026-08-07T00:47:01Z"}],"graph_snapshots":[{"event_id":"sha256:e9ae25c122e5f6d80f7f974e7ca2e4bb91148b64531ebf5f647ebf6c11cf7f56","target":"graph","created_at":"2026-08-07T00:47:01Z","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/2608.05327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Our results show that the existence of a short high-utility protocol already suffices for efficient communication. In particular, in a game with $n$ possible observations and $m$ actions: (1) For any achievable target utility $\\alpha$, we give an algorithm with $\\mathrm{poly}(n, m, 1/\\epsilon)$ runtime that designs a protocol achieving utility at least $\\alpha-\\epsilon$ using only $2^{\\mathcal O(CC_\\alpha(G))}/\\epsilon^2$ bits of communication. Here, $CC_\\alpha(G)$ is the minimum number of bits used by any protocol, even a computationally inefficient one, to achieve utility $\\alpha$. (2) We pr","authors_text":"Mark Bedaywi, Nika Haghtalab, Scott Emmons, Stuart Russell","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05327","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:69b68b6971bafef164651771ca956a89fc276a8035c5789156c01738d5b23771","target":"record","created_at":"2026-08-07T00:47:01Z","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":"1332328961f486815dd92dbd8671db1c9cc54b367290b69a152f82bb3a7fdb75","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-05T18:34:19Z","title_canon_sha256":"baa2b67ce970b1be682edc26cfe7fc37a46f8a145761043f26be076086fbb18a"},"schema_version":"1.0","source":{"id":"2608.05327","kind":"arxiv","version":1}},"canonical_sha256":"c2b5a2cf86f011d516d85cce2de3aae5531a88de3784eb0c6ee518a3acc65a4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2b5a2cf86f011d516d85cce2de3aae5531a88de3784eb0c6ee518a3acc65a4e","first_computed_at":"2026-08-07T00:47:01.181772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T00:47:01.181772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7csksSl2Vkiswd9K9/eEQM8ewQFrbyAv3HdmfLhrg1q5YS4KiSBZuceWIZSNgGmrRrRaYi4klGenT9P/UdPoCA==","signature_status":"signed_v1","signed_at":"2026-08-07T00:47:01.183378Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.05327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69b68b6971bafef164651771ca956a89fc276a8035c5789156c01738d5b23771","sha256:e9ae25c122e5f6d80f7f974e7ca2e4bb91148b64531ebf5f647ebf6c11cf7f56"],"state_sha256":"32b1864619c7322c1c77eb494f636e89e26b65dbcd141ca720a574a0ac9497e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RglGAQSTqqsplNlpT7EiRhL3TemH9mu0VMZ0n/r5Z+hz9a7fq3U/h9Yg98PDG7AN03BTuBZLhxeMsg1pt+2jAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:46:37.389374Z","bundle_sha256":"937270fd4bc858a4659970d173d3507c4d6b5e09d4954598baabfe8446a8ab29"}}