{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QUU2QSGSNEII7JJZOGQ2DVQTNP","short_pith_number":"pith:QUU2QSGS","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"},"canonical_sha256":"8529a848d269108fa53971a1a1d6136bed823ee51211bc23a4bf39a88d2aec27","source":{"kind":"arxiv","id":"1508.03735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03735","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03735v2","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03735","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"QUU2QSGSNEII","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUU2QSGSNEII7JJZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUU2QSGS","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QUU2QSGSNEII7JJZOGQ2DVQTNP","target":"record","payload":{"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"},"canonical_sha256":"8529a848d269108fa53971a1a1d6136bed823ee51211bc23a4bf39a88d2aec27","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"},"source_kind":"arxiv","source_id":"1508.03735","source_version":2,"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-18T01:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fa2s0U/N0p3VklZLHgbOeen8pfryATcPc+tuDySdzt2LKIVLpIviix9hq+8QnJVbPnnK28Qmri4eoWkO/BerCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:19:29.142090Z"},"content_sha256":"4803ebc8b878a9cdf60c477256880c609b5ae4ca50b1d4e51e6e9dbc1d0978ee","schema_version":"1.0","event_id":"sha256:4803ebc8b878a9cdf60c477256880c609b5ae4ca50b1d4e51e6e9dbc1d0978ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QUU2QSGSNEII7JJZOGQ2DVQTNP","target":"graph","payload":{"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"},"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-18T01:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UjjTLWafyNWdBKrTwUffbkrhIVJbfbpx+7DUjgIXkJ1C2xzxvAbqhe0FaT0hGXWbhZdcS6ZR9/WcCCdvsHjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:19:29.142789Z"},"content_sha256":"8f966c8447b86e32ba24234aeab87ce5755fb314f2fe515d7c1944bfe593c219","schema_version":"1.0","event_id":"sha256:8f966c8447b86e32ba24234aeab87ce5755fb314f2fe515d7c1944bfe593c219"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/bundle.json","state_url":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/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-30T12:19:29Z","links":{"resolver":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP","bundle":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/bundle.json","state":"https://pith.science/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUU2QSGSNEII7JJZOGQ2DVQTNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QUU2QSGSNEII7JJZOGQ2DVQTNP","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":"1981db2d1c792201c3a34b8ec4f78862b1cc45a15cd182ecf8c2e81d61f96d81","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T14:02:53Z","title_canon_sha256":"2161b52bfce99acb60c44072821dd84b4f0da479e19327407f0c276ed5f1573f"},"schema_version":"1.0","source":{"id":"1508.03735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03735","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03735v2","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03735","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"QUU2QSGSNEII","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUU2QSGSNEII7JJZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUU2QSGS","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:8f966c8447b86e32ba24234aeab87ce5755fb314f2fe515d7c1944bfe593c219","target":"graph","created_at":"2026-05-18T01:23:23Z","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 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 ","authors_text":"Aaron Roth, Jaikumar Radhakrishnan, Katrina Ligett, Rachel Cummings, Zhiwei Steven Wu","cross_cats":["cs.GT","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T14:02:53Z","title":"Coordination Complexity: Small Information Coordinating Large Populations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03735","kind":"arxiv","version":2},"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:4803ebc8b878a9cdf60c477256880c609b5ae4ca50b1d4e51e6e9dbc1d0978ee","target":"record","created_at":"2026-05-18T01:23:23Z","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":"1981db2d1c792201c3a34b8ec4f78862b1cc45a15cd182ecf8c2e81d61f96d81","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T14:02:53Z","title_canon_sha256":"2161b52bfce99acb60c44072821dd84b4f0da479e19327407f0c276ed5f1573f"},"schema_version":"1.0","source":{"id":"1508.03735","kind":"arxiv","version":2}},"canonical_sha256":"8529a848d269108fa53971a1a1d6136bed823ee51211bc23a4bf39a88d2aec27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8529a848d269108fa53971a1a1d6136bed823ee51211bc23a4bf39a88d2aec27","first_computed_at":"2026-05-18T01:23:23.594413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:23.594413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"va7nmtEdDwndxsAkkx1xVJTyx277WXRce0u0jydntTpWvnn6yDpkbPDajDejRO3CJpK0ljWYT30wCZSFUngsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:23.595142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4803ebc8b878a9cdf60c477256880c609b5ae4ca50b1d4e51e6e9dbc1d0978ee","sha256:8f966c8447b86e32ba24234aeab87ce5755fb314f2fe515d7c1944bfe593c219"],"state_sha256":"3935efb2a4ed61513e83dfcdea48b2a39023ecb24b37db2b9038698f12b481de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUPSwDrsWYdTJdbjR2wBQEhNGRdRf5FuXxzQ/FVW+q1Wpg06Yc9xDoZXtOAb/7pMBm5Sc57w6d+u9QnzIOa2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:19:29.146415Z","bundle_sha256":"8a8c160f8ad0146c5d2a7b16ee7aefa6dc3557baf0556a71f88ef1da74100b2c"}}