{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EZ3BVQJ7WXFEYU6JVBMBEUSW5N","short_pith_number":"pith:EZ3BVQJ7","schema_version":"1.0","canonical_sha256":"26761ac13fb5ca4c53c9a858125256eb6cb81d730eb448e04970da5216fd76bb","source":{"kind":"arxiv","id":"2507.23432","version":1},"attestation_state":"computed","paper":{"title":"Scalable contribution bounding to achieve privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Alessandro Epasto, Jason Lee, Morteza Zadimoghaddam, Vincent Cohen-Addad","submitted_at":"2025-07-31T11:14:17Z","abstract_excerpt":"In modern datasets, where single records can have multiple owners, enforcing user-level differential privacy requires capping each user's total contribution. This \"contribution bounding\" becomes a significant combinatorial challenge. Existing sequential algorithms for this task are computationally intensive and do not scale to the massive datasets prevalent today. To address this scalability bottleneck, we propose a novel and efficient distributed algorithm. Our approach models the complex ownership structure as a hypergraph, where users are vertices and records are hyperedges. The algorithm p"},"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":"2507.23432","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-31T11:14:17Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"c703969a63f281e4a32705fca8634bdf3c2dd86f1673f2cc6a60b40c6799bbc1","abstract_canon_sha256":"41d856859a2bf4f622bdc65e46bc2998965a4bc53410f67bfd69da07749a9605"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:12.288605Z","signature_b64":"Uo6+X+vNSkNNHkk5KfH5/wB1GJEivpEWFxwKYJWRaTj/juKFXdh2cpiHVAec/UdGfQ2xojuMqQeWyJ12ui1XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26761ac13fb5ca4c53c9a858125256eb6cb81d730eb448e04970da5216fd76bb","last_reissued_at":"2026-07-05T11:46:12.288114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:12.288114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable contribution bounding to achieve privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Alessandro Epasto, Jason Lee, Morteza Zadimoghaddam, Vincent Cohen-Addad","submitted_at":"2025-07-31T11:14:17Z","abstract_excerpt":"In modern datasets, where single records can have multiple owners, enforcing user-level differential privacy requires capping each user's total contribution. This \"contribution bounding\" becomes a significant combinatorial challenge. Existing sequential algorithms for this task are computationally intensive and do not scale to the massive datasets prevalent today. To address this scalability bottleneck, we propose a novel and efficient distributed algorithm. Our approach models the complex ownership structure as a hypergraph, where users are vertices and records are hyperedges. The algorithm p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.23432","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/2507.23432/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":"2507.23432","created_at":"2026-07-05T11:46:12.288174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.23432v1","created_at":"2026-07-05T11:46:12.288174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.23432","created_at":"2026-07-05T11:46:12.288174+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ3BVQJ7WXFE","created_at":"2026-07-05T11:46:12.288174+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ3BVQJ7WXFEYU6J","created_at":"2026-07-05T11:46:12.288174+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ3BVQJ7","created_at":"2026-07-05T11:46:12.288174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N","json":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N.json","graph_json":"https://pith.science/api/pith-number/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/graph.json","events_json":"https://pith.science/api/pith-number/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/events.json","paper":"https://pith.science/paper/EZ3BVQJ7"},"agent_actions":{"view_html":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N","download_json":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N.json","view_paper":"https://pith.science/paper/EZ3BVQJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.23432&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/action/storage_attestation","attest_author":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/action/author_attestation","sign_citation":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/action/citation_signature","submit_replication":"https://pith.science/pith/EZ3BVQJ7WXFEYU6JVBMBEUSW5N/action/replication_record"}},"created_at":"2026-07-05T11:46:12.288174+00:00","updated_at":"2026-07-05T11:46:12.288174+00:00"}