{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6HNM4F3HQPFLB3VPPRGI7PSI53","short_pith_number":"pith:6HNM4F3H","canonical_record":{"source":{"id":"1805.08356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T02:18:56Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"9a4d689b37925bd11ea0e90d0e44db53b372307ba1b5ef4682493514b581a50f","abstract_canon_sha256":"21cdb2c6655fcdf4bde618c01cb58d7108441070bcc1c90358f1b8f91d651c6d"},"schema_version":"1.0"},"canonical_sha256":"f1dace176783cab0eeaf7c4c8fbe48eec09d8d9279cc6df16277133c3f3badff","source":{"kind":"arxiv","id":"1805.08356","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08356","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08356v2","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08356","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"6HNM4F3HQPFL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HNM4F3HQPFLB3VP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HNM4F3H","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6HNM4F3HQPFLB3VPPRGI7PSI53","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T02:18:56Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"9a4d689b37925bd11ea0e90d0e44db53b372307ba1b5ef4682493514b581a50f","abstract_canon_sha256":"21cdb2c6655fcdf4bde618c01cb58d7108441070bcc1c90358f1b8f91d651c6d"},"schema_version":"1.0"},"canonical_sha256":"f1dace176783cab0eeaf7c4c8fbe48eec09d8d9279cc6df16277133c3f3badff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.222730Z","signature_b64":"AKDtN1Zf09/lgfv61awSQrZH4au1V515oVcUovgfcdkJxfCCh21EZ1iJCtvH8jA2dGHEZ6EG7qoU5EJbTojRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1dace176783cab0eeaf7c4c8fbe48eec09d8d9279cc6df16277133c3f3badff","last_reissued_at":"2026-05-18T00:01:53.222287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.222287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08356","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4+l0zIuhzoDFUQ4Rzi2Z9w5K37u1RWhRSDVZR/F2BGwxNfGFVyyHAjmi8eDf/3pSngQJbt16sWJefFqWZpJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:49.160303Z"},"content_sha256":"f7a050ab617836f654b2edc0ad076cec5e6c08a4b760abc87e6b6572e828a36d","schema_version":"1.0","event_id":"sha256:f7a050ab617836f654b2edc0ad076cec5e6c08a4b760abc87e6b6572e828a36d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6HNM4F3HQPFLB3VPPRGI7PSI53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Collaborative PAC Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Huy L. Nguyen, Lydia Zakynthinou","submitted_at":"2018-05-22T02:18:56Z","abstract_excerpt":"We study a recent model of collaborative PAC learning where $k$ players with $k$ different tasks collaborate to learn a single classifier that works for all tasks. Previous work showed that when there is a classifier that has very small error on all tasks, there is a collaborative algorithm that finds a single classifier for all tasks and has $O((\\ln (k))^2)$ times the worst-case sample complexity for learning a single task. In this work, we design new algorithms for both the realizable and the non-realizable setting, having sample complexity only $O(\\ln (k))$ times the worst-case sample compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08356","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKmmxEjwKY4gBwBnnC2btM5qte/hEmMgKZMkStJdHnmOZ3h80w9t90UGHKEa+vvOM4U72iUGwMruwySHpFTLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:49.161061Z"},"content_sha256":"4de8ddbb68ce20c4e3b38749d0364a30dad68347f4308d46e4fe566783713afb","schema_version":"1.0","event_id":"sha256:4de8ddbb68ce20c4e3b38749d0364a30dad68347f4308d46e4fe566783713afb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HNM4F3HQPFLB3VPPRGI7PSI53/bundle.json","state_url":"https://pith.science/pith/6HNM4F3HQPFLB3VPPRGI7PSI53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HNM4F3HQPFLB3VPPRGI7PSI53/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-06-11T23:33:49Z","links":{"resolver":"https://pith.science/pith/6HNM4F3HQPFLB3VPPRGI7PSI53","bundle":"https://pith.science/pith/6HNM4F3HQPFLB3VPPRGI7PSI53/bundle.json","state":"https://pith.science/pith/6HNM4F3HQPFLB3VPPRGI7PSI53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HNM4F3HQPFLB3VPPRGI7PSI53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6HNM4F3HQPFLB3VPPRGI7PSI53","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":"21cdb2c6655fcdf4bde618c01cb58d7108441070bcc1c90358f1b8f91d651c6d","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T02:18:56Z","title_canon_sha256":"9a4d689b37925bd11ea0e90d0e44db53b372307ba1b5ef4682493514b581a50f"},"schema_version":"1.0","source":{"id":"1805.08356","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08356","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08356v2","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08356","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"6HNM4F3HQPFL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HNM4F3HQPFLB3VP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HNM4F3H","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:4de8ddbb68ce20c4e3b38749d0364a30dad68347f4308d46e4fe566783713afb","target":"graph","created_at":"2026-05-18T00:01:53Z","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 study a recent model of collaborative PAC learning where $k$ players with $k$ different tasks collaborate to learn a single classifier that works for all tasks. Previous work showed that when there is a classifier that has very small error on all tasks, there is a collaborative algorithm that finds a single classifier for all tasks and has $O((\\ln (k))^2)$ times the worst-case sample complexity for learning a single task. In this work, we design new algorithms for both the realizable and the non-realizable setting, having sample complexity only $O(\\ln (k))$ times the worst-case sample compl","authors_text":"Huy L. Nguyen, Lydia Zakynthinou","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T02:18:56Z","title":"Improved Algorithms for Collaborative PAC Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08356","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:f7a050ab617836f654b2edc0ad076cec5e6c08a4b760abc87e6b6572e828a36d","target":"record","created_at":"2026-05-18T00:01:53Z","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":"21cdb2c6655fcdf4bde618c01cb58d7108441070bcc1c90358f1b8f91d651c6d","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T02:18:56Z","title_canon_sha256":"9a4d689b37925bd11ea0e90d0e44db53b372307ba1b5ef4682493514b581a50f"},"schema_version":"1.0","source":{"id":"1805.08356","kind":"arxiv","version":2}},"canonical_sha256":"f1dace176783cab0eeaf7c4c8fbe48eec09d8d9279cc6df16277133c3f3badff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1dace176783cab0eeaf7c4c8fbe48eec09d8d9279cc6df16277133c3f3badff","first_computed_at":"2026-05-18T00:01:53.222287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:53.222287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKDtN1Zf09/lgfv61awSQrZH4au1V515oVcUovgfcdkJxfCCh21EZ1iJCtvH8jA2dGHEZ6EG7qoU5EJbTojRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:53.222730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08356","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7a050ab617836f654b2edc0ad076cec5e6c08a4b760abc87e6b6572e828a36d","sha256:4de8ddbb68ce20c4e3b38749d0364a30dad68347f4308d46e4fe566783713afb"],"state_sha256":"359b1b0bf3dccc1743ce80c5d8ab0cd315c9531b1e7235f320670b8fc3a0626c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojneGtje3d2SwGml214pWSj9h5WuHQ6MroZjLA/pcb9m2RHcSqdGHGa7vnOe4EKyw6hHzB5eBAd3jLDkWPixBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:33:49.165895Z","bundle_sha256":"6c1c31704212b898be64669abac5b13019dcd8e01b5aa81189a231869d77b8ae"}}