{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KW2AQMIL4UMZQ3JLN3VQ5BMHBT","short_pith_number":"pith:KW2AQMIL","canonical_record":{"source":{"id":"2407.20640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-30T08:35:26Z","cross_cats_sorted":[],"title_canon_sha256":"4d2dfc50f588d1f8ef04c5a7e40fd6f482bc6748e487dfe13e4ad81e60f27fca","abstract_canon_sha256":"c1edbc68edb22aa6328a694fbc6b9552973091cbcf2879d27b0e602391045b94"},"schema_version":"1.0"},"canonical_sha256":"55b408310be519986d2b6eeb0e85870ce4baea4f227fa794c25465bb24be2823","source":{"kind":"arxiv","id":"2407.20640","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.20640","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"arxiv_version","alias_value":"2407.20640v2","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20640","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"pith_short_12","alias_value":"KW2AQMIL4UMZ","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"pith_short_16","alias_value":"KW2AQMIL4UMZQ3JL","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"pith_short_8","alias_value":"KW2AQMIL","created_at":"2026-07-05T10:32:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KW2AQMIL4UMZQ3JLN3VQ5BMHBT","target":"record","payload":{"canonical_record":{"source":{"id":"2407.20640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-30T08:35:26Z","cross_cats_sorted":[],"title_canon_sha256":"4d2dfc50f588d1f8ef04c5a7e40fd6f482bc6748e487dfe13e4ad81e60f27fca","abstract_canon_sha256":"c1edbc68edb22aa6328a694fbc6b9552973091cbcf2879d27b0e602391045b94"},"schema_version":"1.0"},"canonical_sha256":"55b408310be519986d2b6eeb0e85870ce4baea4f227fa794c25465bb24be2823","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:29.138687Z","signature_b64":"e/H5jBsQyz12N9U88xlpIuY6vXH6McF/GQyDuO9oEbEOLg6FnX8epYEr9r54jHB4HQntvsIquULmLa38g9gMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b408310be519986d2b6eeb0e85870ce4baea4f227fa794c25465bb24be2823","last_reissued_at":"2026-07-05T10:32:29.138028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:29.138028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.20640","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-07-05T10:32:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRvaC/7or3BhIu+vev8eEY/nAQYcBDY0DomFH3FmnjXRU6JRpblv8S16V31lZeJP8/PZp/Z2UD9dR2zkhsDiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:25:11.727643Z"},"content_sha256":"5841145192e3a162a37bd9ff916026fb2e95f8257c65816dc17dbc78bc6d68eb","schema_version":"1.0","event_id":"sha256:5841145192e3a162a37bd9ff916026fb2e95f8257c65816dc17dbc78bc6d68eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KW2AQMIL4UMZQ3JLN3VQ5BMHBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Bounds for Pure Private Agnostic Learning: Item-Level and User-Level Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Li, Peng Ye, Wei Wang","submitted_at":"2024-07-30T08:35:26Z","abstract_excerpt":"Machine Learning has made remarkable progress in a wide range of fields. In many scenarios, learning is performed on datasets involving sensitive information, in which privacy protection is essential for learning algorithms. In this work, we study pure private learning in the agnostic model -- a framework reflecting the learning process in practice. We examine the number of users required under item-level (where each user contributes one example) and user-level (where each user contributes multiple examples) privacy and derive several improved upper bounds. For item-level privacy, our algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20640","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.20640/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"},"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-07-05T10:32:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhztAycI4rTp3xcVHFPe2goez8sygUPuwJmRR5ODG609OFIpSDr7eBCrtkvRYPxjKcUJPt6Tp59qaILnlEoaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:25:11.728062Z"},"content_sha256":"b28f30c56854baa927375c2494b54b2fa6daa4ed85551384c1633a5ffcaaa2f1","schema_version":"1.0","event_id":"sha256:b28f30c56854baa927375c2494b54b2fa6daa4ed85551384c1633a5ffcaaa2f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT/bundle.json","state_url":"https://pith.science/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT/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-18T08:25:11Z","links":{"resolver":"https://pith.science/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT","bundle":"https://pith.science/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT/bundle.json","state":"https://pith.science/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KW2AQMIL4UMZQ3JLN3VQ5BMHBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KW2AQMIL4UMZQ3JLN3VQ5BMHBT","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":"c1edbc68edb22aa6328a694fbc6b9552973091cbcf2879d27b0e602391045b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-30T08:35:26Z","title_canon_sha256":"4d2dfc50f588d1f8ef04c5a7e40fd6f482bc6748e487dfe13e4ad81e60f27fca"},"schema_version":"1.0","source":{"id":"2407.20640","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.20640","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"arxiv_version","alias_value":"2407.20640v2","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20640","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"pith_short_12","alias_value":"KW2AQMIL4UMZ","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"pith_short_16","alias_value":"KW2AQMIL4UMZQ3JL","created_at":"2026-07-05T10:32:29Z"},{"alias_kind":"pith_short_8","alias_value":"KW2AQMIL","created_at":"2026-07-05T10:32:29Z"}],"graph_snapshots":[{"event_id":"sha256:b28f30c56854baa927375c2494b54b2fa6daa4ed85551384c1633a5ffcaaa2f1","target":"graph","created_at":"2026-07-05T10:32:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.20640/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine Learning has made remarkable progress in a wide range of fields. In many scenarios, learning is performed on datasets involving sensitive information, in which privacy protection is essential for learning algorithms. In this work, we study pure private learning in the agnostic model -- a framework reflecting the learning process in practice. We examine the number of users required under item-level (where each user contributes one example) and user-level (where each user contributes multiple examples) privacy and derive several improved upper bounds. For item-level privacy, our algorith","authors_text":"Bo Li, Peng Ye, Wei Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-30T08:35:26Z","title":"Improved Bounds for Pure Private Agnostic Learning: Item-Level and User-Level Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20640","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:5841145192e3a162a37bd9ff916026fb2e95f8257c65816dc17dbc78bc6d68eb","target":"record","created_at":"2026-07-05T10:32:29Z","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":"c1edbc68edb22aa6328a694fbc6b9552973091cbcf2879d27b0e602391045b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-30T08:35:26Z","title_canon_sha256":"4d2dfc50f588d1f8ef04c5a7e40fd6f482bc6748e487dfe13e4ad81e60f27fca"},"schema_version":"1.0","source":{"id":"2407.20640","kind":"arxiv","version":2}},"canonical_sha256":"55b408310be519986d2b6eeb0e85870ce4baea4f227fa794c25465bb24be2823","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55b408310be519986d2b6eeb0e85870ce4baea4f227fa794c25465bb24be2823","first_computed_at":"2026-07-05T10:32:29.138028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:32:29.138028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e/H5jBsQyz12N9U88xlpIuY6vXH6McF/GQyDuO9oEbEOLg6FnX8epYEr9r54jHB4HQntvsIquULmLa38g9gMAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:32:29.138687Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.20640","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5841145192e3a162a37bd9ff916026fb2e95f8257c65816dc17dbc78bc6d68eb","sha256:b28f30c56854baa927375c2494b54b2fa6daa4ed85551384c1633a5ffcaaa2f1"],"state_sha256":"64b8aa5334288f5f4cc8297f9f673db7dbb6ad1e407deb999f27391fcdf49816"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DOpIGD9abLI/YK+rJIV8Vktd3kqxirmnbeJrFOiyRo80qvWhYiHCOcQSgGMctT9gx+DYzIAfduyFMjVWy5mCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:25:11.730496Z","bundle_sha256":"58ce9bbe2a6ef04d0350baddc2c605965e61b962f30847906929eb076f2a22bc"}}