{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KUVNTMEGAXGNWMJDZVA3LQ2E6A","short_pith_number":"pith:KUVNTMEG","canonical_record":{"source":{"id":"2405.18534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-28T19:02:30Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a2e164c4381082ab04494ca96dcc0dfad272df61d1a15b74b6d191e86af2232b","abstract_canon_sha256":"c942486c4a3d00bf679ab725ef61027257b56a00052b96a62d356fdd80eb2d75"},"schema_version":"1.0"},"canonical_sha256":"552ad9b08605ccdb3123cd41b5c344f01fdd4e785ce6cee235a6168615d5c4b5","source":{"kind":"arxiv","id":"2405.18534","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18534","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18534v1","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18534","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"KUVNTMEGAXGN","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"pith_short_16","alias_value":"KUVNTMEGAXGNWMJD","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"pith_short_8","alias_value":"KUVNTMEG","created_at":"2026-07-05T08:24:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KUVNTMEGAXGNWMJDZVA3LQ2E6A","target":"record","payload":{"canonical_record":{"source":{"id":"2405.18534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-28T19:02:30Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a2e164c4381082ab04494ca96dcc0dfad272df61d1a15b74b6d191e86af2232b","abstract_canon_sha256":"c942486c4a3d00bf679ab725ef61027257b56a00052b96a62d356fdd80eb2d75"},"schema_version":"1.0"},"canonical_sha256":"552ad9b08605ccdb3123cd41b5c344f01fdd4e785ce6cee235a6168615d5c4b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:26.942291Z","signature_b64":"6crg372OwAmdzzfNxhXh4rdPqCgpwBnW8ttV/UhRrFFz5qDarDrt/dV+FrmCdCn1nRhb28rtcuL83nTv73tNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"552ad9b08605ccdb3123cd41b5c344f01fdd4e785ce6cee235a6168615d5c4b5","last_reissued_at":"2026-07-05T08:24:26.941778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:26.941778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.18534","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-05T08:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gkCKYYDhkwcGBueX9w1bYJlAsHdKxzfEFWs5IRxnRbWhLirRNfF+fwousRRD3yBRNWrg0Np6kvkL0rIFqllBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:12:27.844231Z"},"content_sha256":"54d9d46a855d6f1acb681ede4b1838ec5de238c65278a54922b28e874523d8c7","schema_version":"1.0","event_id":"sha256:54d9d46a855d6f1acb681ede4b1838ec5de238c65278a54922b28e874523d8c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KUVNTMEGAXGNWMJDZVA3LQ2E6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Adam Sealfon, Badih Ghazi, Pasin Manurangsi, Pritish Kamath, Ravi Kumar","submitted_at":"2024-05-28T19:02:30Z","abstract_excerpt":"In this work, we give a new technique for analyzing individualized privacy accounting via the following simple observation: if an algorithm is one-sided add-DP, then its subsampled variant satisfies two-sided DP. From this, we obtain several improved algorithms for private combinatorial optimization problems, including decomposable submodular maximization and set cover. Our error guarantees are asymptotically tight and our algorithm satisfies pure-DP while previously known algorithms (Gupta et al., 2010; Chaturvedi et al., 2021) are approximate-DP. We also show an application of our technique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18534","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/2405.18534/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-05T08:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kL6h+ss4jR77azUlxifISfUQnTHiAelDSIl4/KSJJoJJR+cLiGni+YvP2KmL+OJrb4jK/Q2yPPCoIvxeap+kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:12:27.844735Z"},"content_sha256":"64bbad5cbf5a409998461d4fa5eeb52dc959ebe0c1350ebcd620154db7385147","schema_version":"1.0","event_id":"sha256:64bbad5cbf5a409998461d4fa5eeb52dc959ebe0c1350ebcd620154db7385147"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A/bundle.json","state_url":"https://pith.science/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A/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-08T13:12:27Z","links":{"resolver":"https://pith.science/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A","bundle":"https://pith.science/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A/bundle.json","state":"https://pith.science/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUVNTMEGAXGNWMJDZVA3LQ2E6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KUVNTMEGAXGNWMJDZVA3LQ2E6A","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":"c942486c4a3d00bf679ab725ef61027257b56a00052b96a62d356fdd80eb2d75","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-28T19:02:30Z","title_canon_sha256":"a2e164c4381082ab04494ca96dcc0dfad272df61d1a15b74b6d191e86af2232b"},"schema_version":"1.0","source":{"id":"2405.18534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18534","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18534v1","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18534","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"KUVNTMEGAXGN","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"pith_short_16","alias_value":"KUVNTMEGAXGNWMJD","created_at":"2026-07-05T08:24:26Z"},{"alias_kind":"pith_short_8","alias_value":"KUVNTMEG","created_at":"2026-07-05T08:24:26Z"}],"graph_snapshots":[{"event_id":"sha256:64bbad5cbf5a409998461d4fa5eeb52dc959ebe0c1350ebcd620154db7385147","target":"graph","created_at":"2026-07-05T08:24:26Z","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/2405.18534/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we give a new technique for analyzing individualized privacy accounting via the following simple observation: if an algorithm is one-sided add-DP, then its subsampled variant satisfies two-sided DP. From this, we obtain several improved algorithms for private combinatorial optimization problems, including decomposable submodular maximization and set cover. Our error guarantees are asymptotically tight and our algorithm satisfies pure-DP while previously known algorithms (Gupta et al., 2010; Chaturvedi et al., 2021) are approximate-DP. We also show an application of our technique ","authors_text":"Adam Sealfon, Badih Ghazi, Pasin Manurangsi, Pritish Kamath, Ravi Kumar","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-28T19:02:30Z","title":"Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18534","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:54d9d46a855d6f1acb681ede4b1838ec5de238c65278a54922b28e874523d8c7","target":"record","created_at":"2026-07-05T08:24:26Z","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":"c942486c4a3d00bf679ab725ef61027257b56a00052b96a62d356fdd80eb2d75","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-28T19:02:30Z","title_canon_sha256":"a2e164c4381082ab04494ca96dcc0dfad272df61d1a15b74b6d191e86af2232b"},"schema_version":"1.0","source":{"id":"2405.18534","kind":"arxiv","version":1}},"canonical_sha256":"552ad9b08605ccdb3123cd41b5c344f01fdd4e785ce6cee235a6168615d5c4b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"552ad9b08605ccdb3123cd41b5c344f01fdd4e785ce6cee235a6168615d5c4b5","first_computed_at":"2026-07-05T08:24:26.941778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:26.941778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6crg372OwAmdzzfNxhXh4rdPqCgpwBnW8ttV/UhRrFFz5qDarDrt/dV+FrmCdCn1nRhb28rtcuL83nTv73tNCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:26.942291Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.18534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54d9d46a855d6f1acb681ede4b1838ec5de238c65278a54922b28e874523d8c7","sha256:64bbad5cbf5a409998461d4fa5eeb52dc959ebe0c1350ebcd620154db7385147"],"state_sha256":"3f854ab99551756f227ee25bc74d2cd215d75384450447242acafae0a28e667d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80JMrG5G5bP4f7r5r9NzhfGNertjuG779YYM7TMDfPj0kqNgL1tuCfsFiJe6MjeE27NxvhZtrJ0IY1gsn57hDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:12:27.848310Z","bundle_sha256":"57f4c964f8ba55a8c87a8cbc5d1f6d37af0df7478f6c94098e39ca88bb80354b"}}