{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GRM7MJ2GNCU3EKLLGYWKQVN4VB","short_pith_number":"pith:GRM7MJ2G","schema_version":"1.0","canonical_sha256":"3459f6274668a9b2296b362ca855bca851b950b14a07752774640b4f7dae2035","source":{"kind":"arxiv","id":"1511.08552","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.08552","created_at":"2026-05-18T01:25:48.675783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08552v1","created_at":"2026-05-18T01:25:48.675783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08552","created_at":"2026-05-18T01:25:48.675783+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRM7MJ2GNCU3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRM7MJ2GNCU3EKLL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRM7MJ2G","created_at":"2026-05-18T12:29:22.688609+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/GRM7MJ2GNCU3EKLLGYWKQVN4VB","json":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB.json","graph_json":"https://pith.science/api/pith-number/GRM7MJ2GNCU3EKLLGYWKQVN4VB/graph.json","events_json":"https://pith.science/api/pith-number/GRM7MJ2GNCU3EKLLGYWKQVN4VB/events.json","paper":"https://pith.science/paper/GRM7MJ2G"},"agent_actions":{"view_html":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB","download_json":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB.json","view_paper":"https://pith.science/paper/GRM7MJ2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08552&json=true","fetch_graph":"https://pith.science/api/pith-number/GRM7MJ2GNCU3EKLLGYWKQVN4VB/graph.json","fetch_events":"https://pith.science/api/pith-number/GRM7MJ2GNCU3EKLLGYWKQVN4VB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/action/storage_attestation","attest_author":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/action/author_attestation","sign_citation":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/action/citation_signature","submit_replication":"https://pith.science/pith/GRM7MJ2GNCU3EKLLGYWKQVN4VB/action/replication_record"}},"created_at":"2026-05-18T01:25:48.675783+00:00","updated_at":"2026-05-18T01:25:48.675783+00:00"}