{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O3KZ33XFI6UER4J5TWZV2Q3AAS","short_pith_number":"pith:O3KZ33XF","canonical_record":{"source":{"id":"1402.6278","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-25T19:00:15Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"6ad97024b044a87e04123c6afa7f7d0bffb0a4294e029a3ac132ee568f3d93c3","abstract_canon_sha256":"be2e4b84f847d8e1e660cd8e52cb7ff6e182cdd69f835ffa6476ab3d6b557334"},"schema_version":"1.0"},"canonical_sha256":"76d59deee547a848f13d9db35d436004882d737eef64e029a58fc33f96e5546f","source":{"kind":"arxiv","id":"1402.6278","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6278","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6278v4","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6278","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"O3KZ33XFI6UE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O3KZ33XFI6UER4J5","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O3KZ33XF","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O3KZ33XFI6UER4J5TWZV2Q3AAS","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6278","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-25T19:00:15Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"6ad97024b044a87e04123c6afa7f7d0bffb0a4294e029a3ac132ee568f3d93c3","abstract_canon_sha256":"be2e4b84f847d8e1e660cd8e52cb7ff6e182cdd69f835ffa6476ab3d6b557334"},"schema_version":"1.0"},"canonical_sha256":"76d59deee547a848f13d9db35d436004882d737eef64e029a58fc33f96e5546f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:16.820503Z","signature_b64":"ty7ywypTRSpgKxicBgVA0iItidx6B/j9mJPk1aAWJNeRiuUw6j0TLkuu3SeARofR7ReY6zPi+MMiKT+6sIH/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76d59deee547a848f13d9db35d436004882d737eef64e029a58fc33f96e5546f","last_reissued_at":"2026-05-18T01:33:16.819683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:16.819683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6278","source_version":4,"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:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eh5HkmFiK+etwFrFhkIVpbCdU4RuNW3UHpjBF/hhnO5EAGWz/wLCaL7YzFMKQCT4OVfqcSWyHtxA5uuLIf2KAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:58:43.273016Z"},"content_sha256":"16cda5c9a21393d5ee2236c67a221745a9d835da64f1fd9aac9e582d77042d75","schema_version":"1.0","event_id":"sha256:16cda5c9a21393d5ee2236c67a221745a9d835da64f1fd9aac9e582d77042d75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O3KZ33XFI6UER4J5TWZV2Q3AAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Complexity Bounds on Differentially Private Learning via Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DS","authors_text":"David Xiao, Vitaly Feldman","submitted_at":"2014-02-25T19:00:15Z","abstract_excerpt":"In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced by Dwork et al. (2006) that ensures that the output of an algorithm leaks little information about the data point provided by any of the participating individuals. Sample complexity of private PAC and agnostic learning was studied in a number of prior works starting with (Kasiviswanathan et al., 2008) but a number of basic questions still remain open, most notably whether learning with privacy requires more samples "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6278","kind":"arxiv","version":4},"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:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZQIyCMEwiHT3wh/1wikGPXEgQrPSLZdU0gL6RIQ7mt0p1Jy7IEJotTNfH6n9tsKE3VdtKpePM/ZymF8OVGCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:58:43.273393Z"},"content_sha256":"5c089319c2d953a0ef4b0fdc0dfd990e20a7ea6292223b872f07ee6ce3fb5199","schema_version":"1.0","event_id":"sha256:5c089319c2d953a0ef4b0fdc0dfd990e20a7ea6292223b872f07ee6ce3fb5199"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS/bundle.json","state_url":"https://pith.science/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS/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-05-31T21:58:43Z","links":{"resolver":"https://pith.science/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS","bundle":"https://pith.science/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS/bundle.json","state":"https://pith.science/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3KZ33XFI6UER4J5TWZV2Q3AAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O3KZ33XFI6UER4J5TWZV2Q3AAS","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":"be2e4b84f847d8e1e660cd8e52cb7ff6e182cdd69f835ffa6476ab3d6b557334","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-25T19:00:15Z","title_canon_sha256":"6ad97024b044a87e04123c6afa7f7d0bffb0a4294e029a3ac132ee568f3d93c3"},"schema_version":"1.0","source":{"id":"1402.6278","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6278","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6278v4","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6278","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"O3KZ33XFI6UE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O3KZ33XFI6UER4J5","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O3KZ33XF","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:5c089319c2d953a0ef4b0fdc0dfd990e20a7ea6292223b872f07ee6ce3fb5199","target":"graph","created_at":"2026-05-18T01:33:16Z","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":"In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced by Dwork et al. (2006) that ensures that the output of an algorithm leaks little information about the data point provided by any of the participating individuals. Sample complexity of private PAC and agnostic learning was studied in a number of prior works starting with (Kasiviswanathan et al., 2008) but a number of basic questions still remain open, most notably whether learning with privacy requires more samples ","authors_text":"David Xiao, Vitaly Feldman","cross_cats":["cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-25T19:00:15Z","title":"Sample Complexity Bounds on Differentially Private Learning via Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6278","kind":"arxiv","version":4},"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:16cda5c9a21393d5ee2236c67a221745a9d835da64f1fd9aac9e582d77042d75","target":"record","created_at":"2026-05-18T01:33:16Z","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":"be2e4b84f847d8e1e660cd8e52cb7ff6e182cdd69f835ffa6476ab3d6b557334","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-25T19:00:15Z","title_canon_sha256":"6ad97024b044a87e04123c6afa7f7d0bffb0a4294e029a3ac132ee568f3d93c3"},"schema_version":"1.0","source":{"id":"1402.6278","kind":"arxiv","version":4}},"canonical_sha256":"76d59deee547a848f13d9db35d436004882d737eef64e029a58fc33f96e5546f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76d59deee547a848f13d9db35d436004882d737eef64e029a58fc33f96e5546f","first_computed_at":"2026-05-18T01:33:16.819683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:16.819683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ty7ywypTRSpgKxicBgVA0iItidx6B/j9mJPk1aAWJNeRiuUw6j0TLkuu3SeARofR7ReY6zPi+MMiKT+6sIH/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:16.820503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6278","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16cda5c9a21393d5ee2236c67a221745a9d835da64f1fd9aac9e582d77042d75","sha256:5c089319c2d953a0ef4b0fdc0dfd990e20a7ea6292223b872f07ee6ce3fb5199"],"state_sha256":"097411c9759523335f37c6832c0c74ee47a4a3a6c5fe448be5b7a4eb5f01ada7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dH3czlp4kbDysjgmKyu+1j5QfCnDtThfMSY5o6LpcJiaEGPU3HO/qJcHbU791udtOz5HM+nZrjbSnIKayfjzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:58:43.275625Z","bundle_sha256":"4c74f5ae110751dbd9c74fbfb37703194e30d20899a446330f356c135683507e"}}