{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UHHDPOL4ZX37C7ZHMGSMR46J6Z","short_pith_number":"pith:UHHDPOL4","schema_version":"1.0","canonical_sha256":"a1ce37b97ccdf7f17f2761a4c8f3c9f6410ab5e90f735cf03a01580a98ee7c7f","source":{"kind":"arxiv","id":"2403.11445","version":4},"attestation_state":"computed","paper":{"title":"Budget Recycling Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","eess.SP"],"primary_cat":"cs.CR","authors_text":"Bo Jiang, Jian Du, Qiang Yan, Sagar Sharma","submitted_at":"2024-03-18T03:43:45Z","abstract_excerpt":"Differential Privacy (DP) mechanisms usually {force} reduction in data utility by producing \"out-of-bound\" noisy results for a tight privacy budget. We introduce the Budget Recycling Differential Privacy (BR-DP) framework, designed to provide soft-bounded noisy outputs for a broad range of existing DP mechanisms. By \"soft-bounded,\" we refer to the mechanism's ability to release most outputs within a predefined error boundary, thereby improving utility and maintaining privacy simultaneously. The core of BR-DP consists of two components: a DP kernel responsible for generating a noisy answer per "},"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":"2403.11445","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-03-18T03:43:45Z","cross_cats_sorted":["cs.DS","eess.SP"],"title_canon_sha256":"358f86678dab39e3fa8eac32490982f444afb344bccfc448a1b173ea488c8d03","abstract_canon_sha256":"8b902483133c1a64db8fb999b53412b1756aef3b2f0702c2597dda594c744791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:09.263262Z","signature_b64":"cszON/CRwJog0K3KpSoEWP/LYaI5oAergdyaubRuFBW+QlwhFhHbLbCxiKONX8TQJF/dzMpNgd3INN7Nv2mqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ce37b97ccdf7f17f2761a4c8f3c9f6410ab5e90f735cf03a01580a98ee7c7f","last_reissued_at":"2026-07-05T08:43:09.262875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:09.262875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Budget Recycling Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","eess.SP"],"primary_cat":"cs.CR","authors_text":"Bo Jiang, Jian Du, Qiang Yan, Sagar Sharma","submitted_at":"2024-03-18T03:43:45Z","abstract_excerpt":"Differential Privacy (DP) mechanisms usually {force} reduction in data utility by producing \"out-of-bound\" noisy results for a tight privacy budget. We introduce the Budget Recycling Differential Privacy (BR-DP) framework, designed to provide soft-bounded noisy outputs for a broad range of existing DP mechanisms. By \"soft-bounded,\" we refer to the mechanism's ability to release most outputs within a predefined error boundary, thereby improving utility and maintaining privacy simultaneously. The core of BR-DP consists of two components: a DP kernel responsible for generating a noisy answer per "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11445","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.11445/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":"2403.11445","created_at":"2026-07-05T08:43:09.262931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.11445v4","created_at":"2026-07-05T08:43:09.262931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11445","created_at":"2026-07-05T08:43:09.262931+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHHDPOL4ZX37","created_at":"2026-07-05T08:43:09.262931+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHHDPOL4ZX37C7ZH","created_at":"2026-07-05T08:43:09.262931+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHHDPOL4","created_at":"2026-07-05T08:43:09.262931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10612","citing_title":"Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z","json":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z.json","graph_json":"https://pith.science/api/pith-number/UHHDPOL4ZX37C7ZHMGSMR46J6Z/graph.json","events_json":"https://pith.science/api/pith-number/UHHDPOL4ZX37C7ZHMGSMR46J6Z/events.json","paper":"https://pith.science/paper/UHHDPOL4"},"agent_actions":{"view_html":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z","download_json":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z.json","view_paper":"https://pith.science/paper/UHHDPOL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.11445&json=true","fetch_graph":"https://pith.science/api/pith-number/UHHDPOL4ZX37C7ZHMGSMR46J6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/UHHDPOL4ZX37C7ZHMGSMR46J6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z/action/storage_attestation","attest_author":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z/action/author_attestation","sign_citation":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z/action/citation_signature","submit_replication":"https://pith.science/pith/UHHDPOL4ZX37C7ZHMGSMR46J6Z/action/replication_record"}},"created_at":"2026-07-05T08:43:09.262931+00:00","updated_at":"2026-07-05T08:43:09.262931+00:00"}