{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M5STD6H3ENZ56FTXYDSKAWAL5D","short_pith_number":"pith:M5STD6H3","schema_version":"1.0","canonical_sha256":"676531f8fb2373df1677c0e4a0580be8f9c749c172340d999a4d9dbf30b8c068","source":{"kind":"arxiv","id":"1211.3212","version":1},"attestation_state":"computed","paper":{"title":"Distributed Non-Stochastic Experts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bozidar Radunovic, Varun Kanade, Zhenming Liu","submitted_at":"2012-11-14T06:45:38Z","abstract_excerpt":"We consider the online distributed non-stochastic experts problem, where the distributed system consists of one coordinator node that is connected to $k$ sites, and the sites are required to communicate with each other via the coordinator. At each time-step $t$, one of the $k$ site nodes has to pick an expert from the set ${1, ..., n}$, and the same site receives information about payoffs of all experts for that round. The goal of the distributed system is to minimize regret at time horizon $T$, while simultaneously keeping communication to a minimum.\n  The two extreme solutions to this proble"},"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":"1211.3212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-14T06:45:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"48c1528cddcbd1808aafddaa7d504f951c5c317fc443880338db7324eb2bd6a6","abstract_canon_sha256":"51da3884af28014153d217396a8e0900e4641f4827be6b107629d0e4e3835fd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.597447Z","signature_b64":"/PfRYOzoLscVsekzvKsjvhK2BS/TkknxzYE4xRONRu6A7UUPFYt6e7ARFn8N6JG9Qyy7CkinyRKRr1A+6qCxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676531f8fb2373df1677c0e4a0580be8f9c749c172340d999a4d9dbf30b8c068","last_reissued_at":"2026-05-18T03:40:50.595680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.595680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Non-Stochastic Experts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bozidar Radunovic, Varun Kanade, Zhenming Liu","submitted_at":"2012-11-14T06:45:38Z","abstract_excerpt":"We consider the online distributed non-stochastic experts problem, where the distributed system consists of one coordinator node that is connected to $k$ sites, and the sites are required to communicate with each other via the coordinator. At each time-step $t$, one of the $k$ site nodes has to pick an expert from the set ${1, ..., n}$, and the same site receives information about payoffs of all experts for that round. The goal of the distributed system is to minimize regret at time horizon $T$, while simultaneously keeping communication to a minimum.\n  The two extreme solutions to this proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3212","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":""},"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":"1211.3212","created_at":"2026-05-18T03:40:50.595817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3212v1","created_at":"2026-05-18T03:40:50.595817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3212","created_at":"2026-05-18T03:40:50.595817+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5STD6H3ENZ5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5STD6H3ENZ56FTX","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5STD6H3","created_at":"2026-05-18T12:27:14.488303+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/M5STD6H3ENZ56FTXYDSKAWAL5D","json":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D.json","graph_json":"https://pith.science/api/pith-number/M5STD6H3ENZ56FTXYDSKAWAL5D/graph.json","events_json":"https://pith.science/api/pith-number/M5STD6H3ENZ56FTXYDSKAWAL5D/events.json","paper":"https://pith.science/paper/M5STD6H3"},"agent_actions":{"view_html":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D","download_json":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D.json","view_paper":"https://pith.science/paper/M5STD6H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3212&json=true","fetch_graph":"https://pith.science/api/pith-number/M5STD6H3ENZ56FTXYDSKAWAL5D/graph.json","fetch_events":"https://pith.science/api/pith-number/M5STD6H3ENZ56FTXYDSKAWAL5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D/action/storage_attestation","attest_author":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D/action/author_attestation","sign_citation":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D/action/citation_signature","submit_replication":"https://pith.science/pith/M5STD6H3ENZ56FTXYDSKAWAL5D/action/replication_record"}},"created_at":"2026-05-18T03:40:50.595817+00:00","updated_at":"2026-05-18T03:40:50.595817+00:00"}