{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GRM7MJ2GNCU3EKLLGYWKQVN4VB","short_pith_number":"pith:GRM7MJ2G","canonical_record":{"source":{"id":"1511.08552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-27T03:57:22Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"b414a8ba93391220a388ceb0da8400159d26366fa027ff0975e48a7537ad3bcc","abstract_canon_sha256":"0d54d4e5cd9a6ace56c22a0b7500e69fedac3c6219515b0c9deb2ca8f5c790fa"},"schema_version":"1.0"},"canonical_sha256":"3459f6274668a9b2296b362ca855bca851b950b14a07752774640b4f7dae2035","source":{"kind":"arxiv","id":"1511.08552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08552","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08552v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08552","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"GRM7MJ2GNCU3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRM7MJ2GNCU3EKLL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRM7MJ2G","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GRM7MJ2GNCU3EKLLGYWKQVN4VB","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-27T03:57:22Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"b414a8ba93391220a388ceb0da8400159d26366fa027ff0975e48a7537ad3bcc","abstract_canon_sha256":"0d54d4e5cd9a6ace56c22a0b7500e69fedac3c6219515b0c9deb2ca8f5c790fa"},"schema_version":"1.0"},"canonical_sha256":"3459f6274668a9b2296b362ca855bca851b950b14a07752774640b4f7dae2035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:48.676384Z","signature_b64":"a89luvAhZ1xzUhUraeBCavnjY3KKAuD+Njfhc7kLKloGo2+SYMnNS5mzBCZVuzaxUY4C2Eun7NnXtKLa57bgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3459f6274668a9b2296b362ca855bca851b950b14a07752774640b4f7dae2035","last_reissued_at":"2026-05-18T01:25:48.675692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:48.675692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08552","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:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ug+FOkv2dpMQBycLEZNcmDPWgWnYjXkFIC1pipm5lAOkQAUfs48HEEJ2bL54PW/ugjaQeFviSX7+LoBiDQfLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:07.383178Z"},"content_sha256":"6d30f191b2f736978ea7010367fda81c9237b6c269a55afaec0c4aa1b2eb8338","schema_version":"1.0","event_id":"sha256:6d30f191b2f736978ea7010367fda81c9237b6c269a55afaec0c4aa1b2eb8338"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GRM7MJ2GNCU3EKLLGYWKQVN4VB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Private Learning of Multiple Concepts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Kobbi Nissim, Mark Bun, Uri Stemmer","submitted_at":"2015-11-27T03:57:22Z","abstract_excerpt":"We investigate the direct-sum problem in the context of differentially private PAC learning: What is the sample complexity of solving $k$ learning tasks simultaneously under differential privacy, and how does this cost compare to that of solving $k$ learning tasks without privacy? In our setting, an individual example consists of a domain element $x$ labeled by $k$ unknown concepts $(c_1,\\ldots,c_k)$. The goal of a multi-learner is to output $k$ hypotheses $(h_1,\\ldots,h_k)$ that generalize the input examples.\n  Without concern for privacy, the sample complexity needed to simultaneously learn "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08552","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:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yg7iQQ5VwNpS8M9istPF2nctk5K6BxbFVQnKh6oeEUY62NIKUik2B+BrxxWX/ncPZNiWIJxVUtSFUhifYNkGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:07.383555Z"},"content_sha256":"fd430fa6b568c16a99f558e9a4206b31d25c3b7e1b1f0669ec1c1e4a9e71bc7d","schema_version":"1.0","event_id":"sha256:fd430fa6b568c16a99f558e9a4206b31d25c3b7e1b1f0669ec1c1e4a9e71bc7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/bundle.json","state_url":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/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-01T22:22:07Z","links":{"resolver":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB","bundle":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/bundle.json","state":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GRM7MJ2GNCU3EKLLGYWKQVN4VB","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":"0d54d4e5cd9a6ace56c22a0b7500e69fedac3c6219515b0c9deb2ca8f5c790fa","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-27T03:57:22Z","title_canon_sha256":"b414a8ba93391220a388ceb0da8400159d26366fa027ff0975e48a7537ad3bcc"},"schema_version":"1.0","source":{"id":"1511.08552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08552","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08552v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08552","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"GRM7MJ2GNCU3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRM7MJ2GNCU3EKLL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRM7MJ2G","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:fd430fa6b568c16a99f558e9a4206b31d25c3b7e1b1f0669ec1c1e4a9e71bc7d","target":"graph","created_at":"2026-05-18T01:25:48Z","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 investigate the direct-sum problem in the context of differentially private PAC learning: What is the sample complexity of solving $k$ learning tasks simultaneously under differential privacy, and how does this cost compare to that of solving $k$ learning tasks without privacy? In our setting, an individual example consists of a domain element $x$ labeled by $k$ unknown concepts $(c_1,\\ldots,c_k)$. The goal of a multi-learner is to output $k$ hypotheses $(h_1,\\ldots,h_k)$ that generalize the input examples.\n  Without concern for privacy, the sample complexity needed to simultaneously learn ","authors_text":"Kobbi Nissim, Mark Bun, Uri Stemmer","cross_cats":["cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-27T03:57:22Z","title":"Simultaneous Private Learning of Multiple Concepts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08552","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:6d30f191b2f736978ea7010367fda81c9237b6c269a55afaec0c4aa1b2eb8338","target":"record","created_at":"2026-05-18T01:25:48Z","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":"0d54d4e5cd9a6ace56c22a0b7500e69fedac3c6219515b0c9deb2ca8f5c790fa","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-27T03:57:22Z","title_canon_sha256":"b414a8ba93391220a388ceb0da8400159d26366fa027ff0975e48a7537ad3bcc"},"schema_version":"1.0","source":{"id":"1511.08552","kind":"arxiv","version":1}},"canonical_sha256":"3459f6274668a9b2296b362ca855bca851b950b14a07752774640b4f7dae2035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3459f6274668a9b2296b362ca855bca851b950b14a07752774640b4f7dae2035","first_computed_at":"2026-05-18T01:25:48.675692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:48.675692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a89luvAhZ1xzUhUraeBCavnjY3KKAuD+Njfhc7kLKloGo2+SYMnNS5mzBCZVuzaxUY4C2Eun7NnXtKLa57bgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:48.676384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d30f191b2f736978ea7010367fda81c9237b6c269a55afaec0c4aa1b2eb8338","sha256:fd430fa6b568c16a99f558e9a4206b31d25c3b7e1b1f0669ec1c1e4a9e71bc7d"],"state_sha256":"ad56bc2d927db125dbdede13c63c55e64317a57e6c1421d6ff1f7faf76af725e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PUHxhf90viyMQhMrzpffHl9PXG26gS0E8ptGqt9WcKuvyPfYwEOGWmQxBvhKOjaUqCIXn6vWzdjVtbMwx8tDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:07.385437Z","bundle_sha256":"443c8583cf76eb5b4d28e44d0feb50f0c58203ae036cb9b2f6e2fc5771123138"}}