{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:K2FVCAJIYZP6J2RI6XIW6VYG66","short_pith_number":"pith:K2FVCAJI","schema_version":"1.0","canonical_sha256":"568b510128c65fe4ea28f5d16f5706f7a982e930e2fbf043f2b12ded53e861f9","source":{"kind":"arxiv","id":"2109.09078","version":1},"attestation_state":"computed","paper":{"title":"Making the Most of Parallel Composition in Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Gianpaolo Gioiosa, Hassan Jameel Asghar, Josh Smith, Paul Tyler, Serge Gaspers, Sirine Mrabet","submitted_at":"2021-09-19T08:06:04Z","abstract_excerpt":"We show that the `optimal' use of the parallel composition theorem corresponds to finding the size of the largest subset of queries that `overlap' on the data domain, a quantity we call the \\emph{maximum overlap} of the queries. It has previously been shown that a certain instance of this problem, formulated in terms of determining the sensitivity of the queries, is NP-hard, but also that it is possible to use graph-theoretic algorithms, such as finding the maximum clique, to approximate query sensitivity. In this paper, we consider a significant generalization of the aforementioned instance w"},"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":"2109.09078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2021-09-19T08:06:04Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c26c95a3608965ee08ca7a1cc9ba18814cfe5104ee10c7a0f42ac251e7490e18","abstract_canon_sha256":"09c259908d055f28e46d3503e117755a7ac256274093b99ca5cdc4363059d2b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:41.332797Z","signature_b64":"Q6t4oEhIGJobZW+BFvb1jCIaE8kSujWVQer/N5GhsU6Hchg0oxp7J70FrM7dranYyYmX7aCwuJ2iL+0T8RzrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"568b510128c65fe4ea28f5d16f5706f7a982e930e2fbf043f2b12ded53e861f9","last_reissued_at":"2026-07-05T03:15:41.332332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:41.332332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making the Most of Parallel Composition in Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Gianpaolo Gioiosa, Hassan Jameel Asghar, Josh Smith, Paul Tyler, Serge Gaspers, Sirine Mrabet","submitted_at":"2021-09-19T08:06:04Z","abstract_excerpt":"We show that the `optimal' use of the parallel composition theorem corresponds to finding the size of the largest subset of queries that `overlap' on the data domain, a quantity we call the \\emph{maximum overlap} of the queries. It has previously been shown that a certain instance of this problem, formulated in terms of determining the sensitivity of the queries, is NP-hard, but also that it is possible to use graph-theoretic algorithms, such as finding the maximum clique, to approximate query sensitivity. In this paper, we consider a significant generalization of the aforementioned instance w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09078","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/2109.09078/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":"2109.09078","created_at":"2026-07-05T03:15:41.332390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09078v1","created_at":"2026-07-05T03:15:41.332390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09078","created_at":"2026-07-05T03:15:41.332390+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2FVCAJIYZP6","created_at":"2026-07-05T03:15:41.332390+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2FVCAJIYZP6J2RI","created_at":"2026-07-05T03:15:41.332390+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2FVCAJI","created_at":"2026-07-05T03:15:41.332390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04255","citing_title":"PriDyG: Privacy-preserving Dynamic Graph Inference with LLM-GNN Collaboration","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66","json":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66.json","graph_json":"https://pith.science/api/pith-number/K2FVCAJIYZP6J2RI6XIW6VYG66/graph.json","events_json":"https://pith.science/api/pith-number/K2FVCAJIYZP6J2RI6XIW6VYG66/events.json","paper":"https://pith.science/paper/K2FVCAJI"},"agent_actions":{"view_html":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66","download_json":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66.json","view_paper":"https://pith.science/paper/K2FVCAJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09078&json=true","fetch_graph":"https://pith.science/api/pith-number/K2FVCAJIYZP6J2RI6XIW6VYG66/graph.json","fetch_events":"https://pith.science/api/pith-number/K2FVCAJIYZP6J2RI6XIW6VYG66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66/action/storage_attestation","attest_author":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66/action/author_attestation","sign_citation":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66/action/citation_signature","submit_replication":"https://pith.science/pith/K2FVCAJIYZP6J2RI6XIW6VYG66/action/replication_record"}},"created_at":"2026-07-05T03:15:41.332390+00:00","updated_at":"2026-07-05T03:15:41.332390+00:00"}