{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YK22FT4G6AI5KFWYLTHC3Y5K4V","short_pith_number":"pith:YK22FT4G","schema_version":"1.0","canonical_sha256":"c2b5a2cf86f011d516d85cce2de3aae5531a88de3784eb0c6ee518a3acc65a4e","source":{"kind":"arxiv","id":"2608.05327","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.05327","created_at":"2026-08-07T00:47:01.183149+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05327v1","created_at":"2026-08-07T00:47:01.183149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05327","created_at":"2026-08-07T00:47:01.183149+00:00"},{"alias_kind":"pith_short_12","alias_value":"YK22FT4G6AI5","created_at":"2026-08-07T00:47:01.183149+00:00"},{"alias_kind":"pith_short_16","alias_value":"YK22FT4G6AI5KFWY","created_at":"2026-08-07T00:47:01.183149+00:00"},{"alias_kind":"pith_short_8","alias_value":"YK22FT4G","created_at":"2026-08-07T00:47:01.183149+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/YK22FT4G6AI5KFWYLTHC3Y5K4V","json":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V.json","graph_json":"https://pith.science/api/pith-number/YK22FT4G6AI5KFWYLTHC3Y5K4V/graph.json","events_json":"https://pith.science/api/pith-number/YK22FT4G6AI5KFWYLTHC3Y5K4V/events.json","paper":"https://pith.science/paper/YK22FT4G"},"agent_actions":{"view_html":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V","download_json":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V.json","view_paper":"https://pith.science/paper/YK22FT4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05327&json=true","fetch_graph":"https://pith.science/api/pith-number/YK22FT4G6AI5KFWYLTHC3Y5K4V/graph.json","fetch_events":"https://pith.science/api/pith-number/YK22FT4G6AI5KFWYLTHC3Y5K4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/action/storage_attestation","attest_author":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/action/author_attestation","sign_citation":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/action/citation_signature","submit_replication":"https://pith.science/pith/YK22FT4G6AI5KFWYLTHC3Y5K4V/action/replication_record"}},"created_at":"2026-08-07T00:47:01.183149+00:00","updated_at":"2026-08-07T00:47:01.183149+00:00"}