{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VVM5SF472ALFR5OOLZIKPCHCHP","short_pith_number":"pith:VVM5SF47","canonical_record":{"source":{"id":"1605.02105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T21:47:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b92988c5db73571c4dab0031fed1c65928b77c6351febc21a452a169869d9cd1","abstract_canon_sha256":"0a55b4ae751cc4f022ae6997488a31bd94bf02979a36b6935bc74b964acfd109"},"schema_version":"1.0"},"canonical_sha256":"ad59d9179fd01658f5ce5e50a788e23bfd4c4bb0914afb408a32e77367c3981d","source":{"kind":"arxiv","id":"1605.02105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02105","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02105v1","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02105","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"VVM5SF472ALF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VVM5SF472ALFR5OO","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VVM5SF47","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VVM5SF472ALFR5OOLZIKPCHCHP","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T21:47:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b92988c5db73571c4dab0031fed1c65928b77c6351febc21a452a169869d9cd1","abstract_canon_sha256":"0a55b4ae751cc4f022ae6997488a31bd94bf02979a36b6935bc74b964acfd109"},"schema_version":"1.0"},"canonical_sha256":"ad59d9179fd01658f5ce5e50a788e23bfd4c4bb0914afb408a32e77367c3981d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:22.078002Z","signature_b64":"u6zX39ZCzh//TsddF91Rg3XDrYqqo2KZwdI6OmU9B9kQmsowReYY78laOBKo/9v5K7FRWmgb0TXVZ+eBmjorCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad59d9179fd01658f5ce5e50a788e23bfd4c4bb0914afb408a32e77367c3981d","last_reissued_at":"2026-05-18T01:15:22.077341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:22.077341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02105","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-05-18T01:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlpCE3iEwAeDeEoFIByrxzOP330wahKXhv4x0g9/2747rgRZBOzxvhaKCgXGirpW43KlVIej1pLbBFCIDm8oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:45:01.096654Z"},"content_sha256":"78b70d7b807ee3c89dd90acc3fcd021077ce4908b44d8baffd0f4bf61ee32110","schema_version":"1.0","event_id":"sha256:78b70d7b807ee3c89dd90acc3fcd021077ce4908b44d8baffd0f4bf61ee32110"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VVM5SF472ALFR5OOLZIKPCHCHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Learning with Infinitely Many Hypotheses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar Uribe","submitted_at":"2016-05-06T21:47:36Z","abstract_excerpt":"We consider a distributed learning setup where a network of agents sequentially access realizations of a set of random variables with unknown distributions. The network objective is to find a parametrized distribution that best describes their joint observations in the sense of the Kullback-Leibler divergence. Apart from recent efforts in the literature, we analyze the case of countably many hypotheses and the case of a continuum of hypotheses. We provide non-asymptotic bounds for the concentration rate of the agents' beliefs around the correct hypothesis in terms of the number of agents, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02105","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"},"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:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAmcjYgatPbIgwzHbwU1Sf2m9Jj6Oa7KoZyJf/3lHrvEZS0gx9wnVs8FruoauZzjONtQauQqQi8Czz0GfEnbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:45:01.097187Z"},"content_sha256":"9921aba733c47736aa4fbb7a8ab8582e48e7c68667208ae40b778f486328240c","schema_version":"1.0","event_id":"sha256:9921aba733c47736aa4fbb7a8ab8582e48e7c68667208ae40b778f486328240c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVM5SF472ALFR5OOLZIKPCHCHP/bundle.json","state_url":"https://pith.science/pith/VVM5SF472ALFR5OOLZIKPCHCHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVM5SF472ALFR5OOLZIKPCHCHP/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-03T18:45:01Z","links":{"resolver":"https://pith.science/pith/VVM5SF472ALFR5OOLZIKPCHCHP","bundle":"https://pith.science/pith/VVM5SF472ALFR5OOLZIKPCHCHP/bundle.json","state":"https://pith.science/pith/VVM5SF472ALFR5OOLZIKPCHCHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVM5SF472ALFR5OOLZIKPCHCHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VVM5SF472ALFR5OOLZIKPCHCHP","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":"0a55b4ae751cc4f022ae6997488a31bd94bf02979a36b6935bc74b964acfd109","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T21:47:36Z","title_canon_sha256":"b92988c5db73571c4dab0031fed1c65928b77c6351febc21a452a169869d9cd1"},"schema_version":"1.0","source":{"id":"1605.02105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02105","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02105v1","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02105","created_at":"2026-05-18T01:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"VVM5SF472ALF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VVM5SF472ALFR5OO","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VVM5SF47","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:9921aba733c47736aa4fbb7a8ab8582e48e7c68667208ae40b778f486328240c","target":"graph","created_at":"2026-05-18T01:15:22Z","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 consider a distributed learning setup where a network of agents sequentially access realizations of a set of random variables with unknown distributions. The network objective is to find a parametrized distribution that best describes their joint observations in the sense of the Kullback-Leibler divergence. Apart from recent efforts in the literature, we analyze the case of countably many hypotheses and the case of a continuum of hypotheses. We provide non-asymptotic bounds for the concentration rate of the agents' beliefs around the correct hypothesis in terms of the number of agents, the ","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar Uribe","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T21:47:36Z","title":"Distributed Learning with Infinitely Many Hypotheses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02105","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:78b70d7b807ee3c89dd90acc3fcd021077ce4908b44d8baffd0f4bf61ee32110","target":"record","created_at":"2026-05-18T01:15:22Z","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":"0a55b4ae751cc4f022ae6997488a31bd94bf02979a36b6935bc74b964acfd109","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T21:47:36Z","title_canon_sha256":"b92988c5db73571c4dab0031fed1c65928b77c6351febc21a452a169869d9cd1"},"schema_version":"1.0","source":{"id":"1605.02105","kind":"arxiv","version":1}},"canonical_sha256":"ad59d9179fd01658f5ce5e50a788e23bfd4c4bb0914afb408a32e77367c3981d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad59d9179fd01658f5ce5e50a788e23bfd4c4bb0914afb408a32e77367c3981d","first_computed_at":"2026-05-18T01:15:22.077341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:22.077341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u6zX39ZCzh//TsddF91Rg3XDrYqqo2KZwdI6OmU9B9kQmsowReYY78laOBKo/9v5K7FRWmgb0TXVZ+eBmjorCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:22.078002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78b70d7b807ee3c89dd90acc3fcd021077ce4908b44d8baffd0f4bf61ee32110","sha256:9921aba733c47736aa4fbb7a8ab8582e48e7c68667208ae40b778f486328240c"],"state_sha256":"e6b033fe1b08ab2251d71292b8db20ed94e002cd1b929154ac61b8b7247d948e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0jHYqURw6kTLRT/DIJ0Aex/PUP32gVMEjcY+sbVihw8WoAaf0/j9DNJ2mTO59dias7qsy0rfy13XI2gaLFxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:45:01.102348Z","bundle_sha256":"783ab4d2653c6637af3e4154d18e44d0f50efa4a2a347f3310184351c059167a"}}