{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ACGWRZPM2KEM7UWUDOWV2KVVHS","short_pith_number":"pith:ACGWRZPM","canonical_record":{"source":{"id":"2107.11526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-24T04:06:11Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"8024d26c10798c2eea6890a056cd624ac94c84c76e5b5602979a43e0914e02ae","abstract_canon_sha256":"8826ac489d641bff69ee4be6baf05b4eb9dddd68c409a1d288dee60827162920"},"schema_version":"1.0"},"canonical_sha256":"008d68e5ecd288cfd2d41bad5d2ab53c86f34cb0a47b2501818639051190d417","source":{"kind":"arxiv","id":"2107.11526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.11526","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"2107.11526v1","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11526","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"ACGWRZPM2KEM","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"pith_short_16","alias_value":"ACGWRZPM2KEM7UWU","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"pith_short_8","alias_value":"ACGWRZPM","created_at":"2026-07-05T03:00:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ACGWRZPM2KEM7UWUDOWV2KVVHS","target":"record","payload":{"canonical_record":{"source":{"id":"2107.11526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-24T04:06:11Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"8024d26c10798c2eea6890a056cd624ac94c84c76e5b5602979a43e0914e02ae","abstract_canon_sha256":"8826ac489d641bff69ee4be6baf05b4eb9dddd68c409a1d288dee60827162920"},"schema_version":"1.0"},"canonical_sha256":"008d68e5ecd288cfd2d41bad5d2ab53c86f34cb0a47b2501818639051190d417","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:20.242222Z","signature_b64":"mBZOJE+7E1uupWxsTrZ8dAlG8crxLp+vX1ZwQXApn1UlaflQB64TG9pbRjIYwgFo0/Iq539gjYvfIjSSD0bhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008d68e5ecd288cfd2d41bad5d2ab53c86f34cb0a47b2501818639051190d417","last_reissued_at":"2026-07-05T03:00:20.241771Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:20.241771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.11526","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-07-05T03:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaPtNLo+Nl9r0eCAJISlrpcsBu/1l+w7at3AlP+komjhPf7G1pfbAROaedh+NF61iujEJ9S54+yjxSveLBp5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:43:46.424581Z"},"content_sha256":"274a2e59dbae538589a8af67e6f52aa788349d7499ad9c6b5ae542f86d991cf0","schema_version":"1.0","event_id":"sha256:274a2e59dbae538589a8af67e6f52aa788349d7499ad9c6b5ae542f86d991cf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ACGWRZPM2KEM7UWUDOWV2KVVHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sample Complexity of Privately Learning Axis-Aligned Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.LG","authors_text":"Menachem Sadigurschi, Uri Stemmer","submitted_at":"2021-07-24T04:06:11Z","abstract_excerpt":"We revisit the fundamental problem of learning Axis-Aligned-Rectangles over a finite grid $X^d\\subseteq{\\mathbb{R}}^d$ with differential privacy. Existing results show that the sample complexity of this problem is at most $\\min\\left\\{ d{\\cdot}\\log|X| \\;,\\; d^{1.5}{\\cdot}\\left(\\log^*|X| \\right)^{1.5}\\right\\}$. That is, existing constructions either require sample complexity that grows linearly with $\\log|X|$, or else it grows super linearly with the dimension $d$. We present a novel algorithm that reduces the sample complexity to only $\\tilde{O}\\left\\{d{\\cdot}\\left(\\log^*|X|\\right)^{1.5}\\right\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11526","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/2107.11526/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-05T03:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Lx01Ujoh+1AjqxLvxjJSAp6Ctz8v63ZUtJaMKU3yIsFB9oO1ZSI4jBy6QTrYwjy3kh27GEKLO4LCC1PMm8zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:43:46.425218Z"},"content_sha256":"4925fc5cdd1aafc18c9118ead805f01661e172bcf62ebffb4644f57036ee2e78","schema_version":"1.0","event_id":"sha256:4925fc5cdd1aafc18c9118ead805f01661e172bcf62ebffb4644f57036ee2e78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS/bundle.json","state_url":"https://pith.science/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS/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-07-05T15:43:46Z","links":{"resolver":"https://pith.science/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS","bundle":"https://pith.science/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS/bundle.json","state":"https://pith.science/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACGWRZPM2KEM7UWUDOWV2KVVHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ACGWRZPM2KEM7UWUDOWV2KVVHS","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":"8826ac489d641bff69ee4be6baf05b4eb9dddd68c409a1d288dee60827162920","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-24T04:06:11Z","title_canon_sha256":"8024d26c10798c2eea6890a056cd624ac94c84c76e5b5602979a43e0914e02ae"},"schema_version":"1.0","source":{"id":"2107.11526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.11526","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"2107.11526v1","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11526","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"ACGWRZPM2KEM","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"pith_short_16","alias_value":"ACGWRZPM2KEM7UWU","created_at":"2026-07-05T03:00:20Z"},{"alias_kind":"pith_short_8","alias_value":"ACGWRZPM","created_at":"2026-07-05T03:00:20Z"}],"graph_snapshots":[{"event_id":"sha256:4925fc5cdd1aafc18c9118ead805f01661e172bcf62ebffb4644f57036ee2e78","target":"graph","created_at":"2026-07-05T03:00:20Z","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/2107.11526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We revisit the fundamental problem of learning Axis-Aligned-Rectangles over a finite grid $X^d\\subseteq{\\mathbb{R}}^d$ with differential privacy. Existing results show that the sample complexity of this problem is at most $\\min\\left\\{ d{\\cdot}\\log|X| \\;,\\; d^{1.5}{\\cdot}\\left(\\log^*|X| \\right)^{1.5}\\right\\}$. That is, existing constructions either require sample complexity that grows linearly with $\\log|X|$, or else it grows super linearly with the dimension $d$. We present a novel algorithm that reduces the sample complexity to only $\\tilde{O}\\left\\{d{\\cdot}\\left(\\log^*|X|\\right)^{1.5}\\right\\","authors_text":"Menachem Sadigurschi, Uri Stemmer","cross_cats":["cs.CR","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-24T04:06:11Z","title":"On the Sample Complexity of Privately Learning Axis-Aligned Rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11526","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:274a2e59dbae538589a8af67e6f52aa788349d7499ad9c6b5ae542f86d991cf0","target":"record","created_at":"2026-07-05T03:00:20Z","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":"8826ac489d641bff69ee4be6baf05b4eb9dddd68c409a1d288dee60827162920","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-24T04:06:11Z","title_canon_sha256":"8024d26c10798c2eea6890a056cd624ac94c84c76e5b5602979a43e0914e02ae"},"schema_version":"1.0","source":{"id":"2107.11526","kind":"arxiv","version":1}},"canonical_sha256":"008d68e5ecd288cfd2d41bad5d2ab53c86f34cb0a47b2501818639051190d417","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"008d68e5ecd288cfd2d41bad5d2ab53c86f34cb0a47b2501818639051190d417","first_computed_at":"2026-07-05T03:00:20.241771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:00:20.241771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBZOJE+7E1uupWxsTrZ8dAlG8crxLp+vX1ZwQXApn1UlaflQB64TG9pbRjIYwgFo0/Iq539gjYvfIjSSD0bhBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:00:20.242222Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.11526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:274a2e59dbae538589a8af67e6f52aa788349d7499ad9c6b5ae542f86d991cf0","sha256:4925fc5cdd1aafc18c9118ead805f01661e172bcf62ebffb4644f57036ee2e78"],"state_sha256":"913b367bd934e537d2c40059d16b53058508cd8ad4662952cbe05c3e78350c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70k4Fuse7DzXf1A5mlLymvSuUl/zwDdWm5toJ8RV0YSE/ogDtZwtegy75wZ81nMjdIEcRyvadOOA+TvDD5N1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:43:46.427996Z","bundle_sha256":"b40b78b992c57c5a888419c1e6543e01f3d68fba1b36464a8253921f88ec0be1"}}