{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UQ3MPBLFTTW54POASX3XMA4SLW","short_pith_number":"pith:UQ3MPBLF","canonical_record":{"source":{"id":"2407.07262","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-09T22:33:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f06e46feb887cfdfa6bb3ad3c107994e4b735dd4bf7331e1292015b5a8a6279b","abstract_canon_sha256":"836f42dcff6034b2a98b7b1fe9cc0b14e63ae820591aa7d77cd06fbefb7b2dea"},"schema_version":"1.0"},"canonical_sha256":"a436c785659cedde3dc095f77603925d8f87372276babb390945a7e14b162b53","source":{"kind":"arxiv","id":"2407.07262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07262","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07262v2","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07262","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"UQ3MPBLFTTW5","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"UQ3MPBLFTTW54POA","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"UQ3MPBLF","created_at":"2026-07-05T10:00:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UQ3MPBLFTTW54POASX3XMA4SLW","target":"record","payload":{"canonical_record":{"source":{"id":"2407.07262","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-09T22:33:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f06e46feb887cfdfa6bb3ad3c107994e4b735dd4bf7331e1292015b5a8a6279b","abstract_canon_sha256":"836f42dcff6034b2a98b7b1fe9cc0b14e63ae820591aa7d77cd06fbefb7b2dea"},"schema_version":"1.0"},"canonical_sha256":"a436c785659cedde3dc095f77603925d8f87372276babb390945a7e14b162b53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:38.804520Z","signature_b64":"OJ6cEqx/DeGb+dNHcQxoTGTNCtr5QV42cUL24CFmD7YOZN93r5Kt1RgEtp3oxibP8GgXPhOMQ8Ho72ADh9D9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a436c785659cedde3dc095f77603925d8f87372276babb390945a7e14b162b53","last_reissued_at":"2026-07-05T10:00:38.803992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:38.803992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.07262","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2V7RMBjzyDEdF3SS1ahE6EIzlX/w2MeNIYF6x8BOG50xnAw1RLw6yNaQA6WNGzA7jZkVZz2OHiTZ8u0OZZFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:14:49.522470Z"},"content_sha256":"26ddad41221e20e9d82f767d01fd4b648066575c2499548b383c90ffd8b7fcbb","schema_version":"1.0","event_id":"sha256:26ddad41221e20e9d82f767d01fd4b648066575c2499548b383c90ffd8b7fcbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UQ3MPBLFTTW54POASX3XMA4SLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differential privacy and Sublinear time are incompatible sometimes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Hendrik Fichtenberger, Jeremiah Blocki, Tamalika Mukherjee","submitted_at":"2024-07-09T22:33:57Z","abstract_excerpt":"Differential privacy and sublinear algorithms are both rapidly emerging algorithmic themes in times of big data analysis. Although recent works have shown the existence of differentially private sublinear algorithms for many problems including graph parameter estimation and clustering, little is known regarding hardness results on these algorithms. In this paper, we initiate the study of lower bounds for problems that aim for both differentially-private and sublinear-time algorithms. Our main result is the incompatibility of both the desiderata in the general case. In particular, we prove that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07262","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.07262/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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKyBjBl10Cq6VeHY5g7yFnmnT5M77c9Z/xFBJfnKdkXXx5Ou18fv9wKETfQsRMtegX/7Du9pnPWiLhRSZ78vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:14:49.523018Z"},"content_sha256":"f51403e6299568651d095d0af2c5faf27a7f7db30ec1a4119b5e43729c13bcdb","schema_version":"1.0","event_id":"sha256:f51403e6299568651d095d0af2c5faf27a7f7db30ec1a4119b5e43729c13bcdb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQ3MPBLFTTW54POASX3XMA4SLW/bundle.json","state_url":"https://pith.science/pith/UQ3MPBLFTTW54POASX3XMA4SLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQ3MPBLFTTW54POASX3XMA4SLW/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-15T13:14:49Z","links":{"resolver":"https://pith.science/pith/UQ3MPBLFTTW54POASX3XMA4SLW","bundle":"https://pith.science/pith/UQ3MPBLFTTW54POASX3XMA4SLW/bundle.json","state":"https://pith.science/pith/UQ3MPBLFTTW54POASX3XMA4SLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQ3MPBLFTTW54POASX3XMA4SLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UQ3MPBLFTTW54POASX3XMA4SLW","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":"836f42dcff6034b2a98b7b1fe9cc0b14e63ae820591aa7d77cd06fbefb7b2dea","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-09T22:33:57Z","title_canon_sha256":"f06e46feb887cfdfa6bb3ad3c107994e4b735dd4bf7331e1292015b5a8a6279b"},"schema_version":"1.0","source":{"id":"2407.07262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07262","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07262v2","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07262","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"UQ3MPBLFTTW5","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"UQ3MPBLFTTW54POA","created_at":"2026-07-05T10:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"UQ3MPBLF","created_at":"2026-07-05T10:00:38Z"}],"graph_snapshots":[{"event_id":"sha256:f51403e6299568651d095d0af2c5faf27a7f7db30ec1a4119b5e43729c13bcdb","target":"graph","created_at":"2026-07-05T10:00:38Z","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.07262/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Differential privacy and sublinear algorithms are both rapidly emerging algorithmic themes in times of big data analysis. Although recent works have shown the existence of differentially private sublinear algorithms for many problems including graph parameter estimation and clustering, little is known regarding hardness results on these algorithms. In this paper, we initiate the study of lower bounds for problems that aim for both differentially-private and sublinear-time algorithms. Our main result is the incompatibility of both the desiderata in the general case. In particular, we prove that","authors_text":"Elena Grigorescu, Hendrik Fichtenberger, Jeremiah Blocki, Tamalika Mukherjee","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-09T22:33:57Z","title":"Differential privacy and Sublinear time are incompatible sometimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07262","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:26ddad41221e20e9d82f767d01fd4b648066575c2499548b383c90ffd8b7fcbb","target":"record","created_at":"2026-07-05T10:00:38Z","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":"836f42dcff6034b2a98b7b1fe9cc0b14e63ae820591aa7d77cd06fbefb7b2dea","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-09T22:33:57Z","title_canon_sha256":"f06e46feb887cfdfa6bb3ad3c107994e4b735dd4bf7331e1292015b5a8a6279b"},"schema_version":"1.0","source":{"id":"2407.07262","kind":"arxiv","version":2}},"canonical_sha256":"a436c785659cedde3dc095f77603925d8f87372276babb390945a7e14b162b53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a436c785659cedde3dc095f77603925d8f87372276babb390945a7e14b162b53","first_computed_at":"2026-07-05T10:00:38.803992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:38.803992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OJ6cEqx/DeGb+dNHcQxoTGTNCtr5QV42cUL24CFmD7YOZN93r5Kt1RgEtp3oxibP8GgXPhOMQ8Ho72ADh9D9Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:38.804520Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.07262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26ddad41221e20e9d82f767d01fd4b648066575c2499548b383c90ffd8b7fcbb","sha256:f51403e6299568651d095d0af2c5faf27a7f7db30ec1a4119b5e43729c13bcdb"],"state_sha256":"016ca969dd26970404bce7dd2311932958df1eb86767307b2ef811db26938909"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJFcDgeY0tK2jwB2aixxrm/E1VmmWi8c4mkaxvKl0q+YHV+BKMnlY6Rqzy8e/dlVAxIjLaQ0MSx7p7ubJTheAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:14:49.529827Z","bundle_sha256":"017de1a1721df8434269f0603b90c56a0e963811c5dadf587637fab1cec5ab27"}}