{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZJFUXQ2MWWZEP75AVEEX7JDSRO","short_pith_number":"pith:ZJFUXQ2M","schema_version":"1.0","canonical_sha256":"ca4b4bc34cb5b247ffa0a9097fa4728baf3c15b623f6dcf2e35aed218b998060","source":{"kind":"arxiv","id":"2506.12856","version":1},"attestation_state":"computed","paper":{"title":"Private List Learnability vs. Online List Learnability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Hilla Schefler, Iska Tsubari, Shay Moran, Steve Hanneke","submitted_at":"2025-06-15T14:10:46Z","abstract_excerpt":"This work explores the connection between differential privacy (DP) and online learning in the context of PAC list learning. In this setting, a $k$-list learner outputs a list of $k$ potential predictions for an instance $x$ and incurs a loss if the true label of $x$ is not included in the list. A basic result in the multiclass PAC framework with a finite number of labels states that private learnability is equivalent to online learnability [Alon, Livni, Malliaris, and Moran (2019); Bun, Livni, and Moran (2020); Jung, Kim, and Tewari (2020)]. Perhaps surprisingly, we show that this equivalence"},"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":"2506.12856","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-15T14:10:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"983f74ce62f63945c1ca1ae28d59db2e6b72972e40a39d9afa71bc53ace7d801","abstract_canon_sha256":"82ab03210124d798af0b4dda62af8a8a0e1a1430d907a7f134594b4182e00db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:01.449567Z","signature_b64":"avw6BiHioHmpA7GdTxqR8hlsF6npEJzdI5Q1RX9QmkHiSP1YWMoGyTgrnvolBMQI0nNMTZBTzIdL7aFQYwJcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca4b4bc34cb5b247ffa0a9097fa4728baf3c15b623f6dcf2e35aed218b998060","last_reissued_at":"2026-07-05T11:22:01.449139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:01.449139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private List Learnability vs. Online List Learnability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Hilla Schefler, Iska Tsubari, Shay Moran, Steve Hanneke","submitted_at":"2025-06-15T14:10:46Z","abstract_excerpt":"This work explores the connection between differential privacy (DP) and online learning in the context of PAC list learning. In this setting, a $k$-list learner outputs a list of $k$ potential predictions for an instance $x$ and incurs a loss if the true label of $x$ is not included in the list. A basic result in the multiclass PAC framework with a finite number of labels states that private learnability is equivalent to online learnability [Alon, Livni, Malliaris, and Moran (2019); Bun, Livni, and Moran (2020); Jung, Kim, and Tewari (2020)]. Perhaps surprisingly, we show that this equivalence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12856","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.12856/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.12856","created_at":"2026-07-05T11:22:01.449188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12856v1","created_at":"2026-07-05T11:22:01.449188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12856","created_at":"2026-07-05T11:22:01.449188+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJFUXQ2MWWZE","created_at":"2026-07-05T11:22:01.449188+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJFUXQ2MWWZEP75A","created_at":"2026-07-05T11:22:01.449188+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJFUXQ2M","created_at":"2026-07-05T11:22:01.449188+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12952","citing_title":"An Optimal Sauer Lemma Over $k$-ary Alphabets","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO","json":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO.json","graph_json":"https://pith.science/api/pith-number/ZJFUXQ2MWWZEP75AVEEX7JDSRO/graph.json","events_json":"https://pith.science/api/pith-number/ZJFUXQ2MWWZEP75AVEEX7JDSRO/events.json","paper":"https://pith.science/paper/ZJFUXQ2M"},"agent_actions":{"view_html":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO","download_json":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO.json","view_paper":"https://pith.science/paper/ZJFUXQ2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12856&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJFUXQ2MWWZEP75AVEEX7JDSRO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJFUXQ2MWWZEP75AVEEX7JDSRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO/action/storage_attestation","attest_author":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO/action/author_attestation","sign_citation":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO/action/citation_signature","submit_replication":"https://pith.science/pith/ZJFUXQ2MWWZEP75AVEEX7JDSRO/action/replication_record"}},"created_at":"2026-07-05T11:22:01.449188+00:00","updated_at":"2026-07-05T11:22:01.449188+00:00"}