{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QUU2QSGSNEII7JJZOGQ2DVQTNP","short_pith_number":"pith:QUU2QSGS","schema_version":"1.0","canonical_sha256":"8529a848d269108fa53971a1a1d6136bed823ee51211bc23a4bf39a88d2aec27","source":{"kind":"arxiv","id":"1508.03735","version":2},"attestation_state":"computed","paper":{"title":"Coordination Complexity: Small Information Coordinating Large Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Jaikumar Radhakrishnan, Katrina Ligett, Rachel Cummings, Zhiwei Steven Wu","submitted_at":"2015-08-15T14:02:53Z","abstract_excerpt":"We initiate the study of a quantity that we call coordination complexity. In a distributed optimization problem, the information defining a problem instance is distributed among $n$ parties, who need to each choose an action, which jointly will form a solution to the optimization problem. The coordination complexity represents the minimal amount of information that a centralized coordinator, who has full knowledge of the problem instance, needs to broadcast in order to coordinate the $n$ parties to play a nearly optimal solution.\n  We show that upper bounds on the coordination complexity of a "},"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":"1508.03735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T14:02:53Z","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"title_canon_sha256":"2161b52bfce99acb60c44072821dd84b4f0da479e19327407f0c276ed5f1573f","abstract_canon_sha256":"1981db2d1c792201c3a34b8ec4f78862b1cc45a15cd182ecf8c2e81d61f96d81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:23.595142Z","signature_b64":"va7nmtEdDwndxsAkkx1xVJTyx277WXRce0u0jydntTpWvnn6yDpkbPDajDejRO3CJpK0ljWYT30wCZSFUngsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8529a848d269108fa53971a1a1d6136bed823ee51211bc23a4bf39a88d2aec27","last_reissued_at":"2026-05-18T01:23:23.594413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:23.594413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coordination Complexity: Small Information Coordinating Large Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Jaikumar Radhakrishnan, Katrina Ligett, Rachel Cummings, Zhiwei Steven Wu","submitted_at":"2015-08-15T14:02:53Z","abstract_excerpt":"We initiate the study of a quantity that we call coordination complexity. In a distributed optimization problem, the information defining a problem instance is distributed among $n$ parties, who need to each choose an action, which jointly will form a solution to the optimization problem. The coordination complexity represents the minimal amount of information that a centralized coordinator, who has full knowledge of the problem instance, needs to broadcast in order to coordinate the $n$ parties to play a nearly optimal solution.\n  We show that upper bounds on the coordination complexity of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03735","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03735","created_at":"2026-05-18T01:23:23.594541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03735v2","created_at":"2026-05-18T01:23:23.594541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03735","created_at":"2026-05-18T01:23:23.594541+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUU2QSGSNEII","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUU2QSGSNEII7JJZ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUU2QSGS","created_at":"2026-05-18T12:29:39.896362+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/QUU2QSGSNEII7JJZOGQ2DVQTNP","json":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP.json","graph_json":"https://pith.science/api/pith-number/QUU2QSGSNEII7JJZOGQ2DVQTNP/graph.json","events_json":"https://pith.science/api/pith-number/QUU2QSGSNEII7JJZOGQ2DVQTNP/events.json","paper":"https://pith.science/paper/QUU2QSGS"},"agent_actions":{"view_html":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP","download_json":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP.json","view_paper":"https://pith.science/paper/QUU2QSGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03735&json=true","fetch_graph":"https://pith.science/api/pith-number/QUU2QSGSNEII7JJZOGQ2DVQTNP/graph.json","fetch_events":"https://pith.science/api/pith-number/QUU2QSGSNEII7JJZOGQ2DVQTNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/action/storage_attestation","attest_author":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/action/author_attestation","sign_citation":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/action/citation_signature","submit_replication":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/action/replication_record"}},"created_at":"2026-05-18T01:23:23.594541+00:00","updated_at":"2026-05-18T01:23:23.594541+00:00"}