{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5Y4WOTDBBYTI4OTVYOYXXMSJRU","short_pith_number":"pith:5Y4WOTDB","canonical_record":{"source":{"id":"2005.14717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-29T17:59:46Z","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"title_canon_sha256":"289e9d12c72037046b7d530020bd9d3b34f44af2395201a01fafc4661b5dd23a","abstract_canon_sha256":"fd90dc5f6beb2f4a0d3925c8ff6709985df9d146b2ff1ce536fe4666973d39e8"},"schema_version":"1.0"},"canonical_sha256":"ee39674c610e268e3a75c3b17bb2498d0693df56c4334d35c47f10110430a2e9","source":{"kind":"arxiv","id":"2005.14717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.14717","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"2005.14717v1","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14717","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"5Y4WOTDBBYTI","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"pith_short_16","alias_value":"5Y4WOTDBBYTI4OTV","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"pith_short_8","alias_value":"5Y4WOTDB","created_at":"2026-07-05T01:06:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5Y4WOTDBBYTI4OTVYOYXXMSJRU","target":"record","payload":{"canonical_record":{"source":{"id":"2005.14717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-29T17:59:46Z","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"title_canon_sha256":"289e9d12c72037046b7d530020bd9d3b34f44af2395201a01fafc4661b5dd23a","abstract_canon_sha256":"fd90dc5f6beb2f4a0d3925c8ff6709985df9d146b2ff1ce536fe4666973d39e8"},"schema_version":"1.0"},"canonical_sha256":"ee39674c610e268e3a75c3b17bb2498d0693df56c4334d35c47f10110430a2e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:44.259098Z","signature_b64":"eq2I7LTiJGqxWVBPVWZouhluDTjUeLuhC+ZfzyzkMcphsb24ynRG8VGkG/99D3wJNLz5xds2nW59QU64tkXKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee39674c610e268e3a75c3b17bb2498d0693df56c4334d35c47f10110430a2e9","last_reissued_at":"2026-07-05T01:06:44.258631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:44.258631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.14717","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-05T01:06:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzALHJ1vhShmAHZLGVaipQj9k3Eu2Dw1yGmj5NXdVEB28e6Twk0J/fGRNSMxxsyWAGRXQ132coUTEr+ACvNwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:00:43.214613Z"},"content_sha256":"f7f1c053fd7874cd326ac217c6a57dfb68afbaa361eb8c3678ca74436ecc4013","schema_version":"1.0","event_id":"sha256:f7f1c053fd7874cd326ac217c6a57dfb68afbaa361eb8c3678ca74436ecc4013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5Y4WOTDBBYTI4OTVYOYXXMSJRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentially Private Decomposable Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anamay Chaturvedi, Huy Nguyen, Lydia Zakynthinou","submitted_at":"2020-05-29T17:59:46Z","abstract_excerpt":"We study the problem of differentially private constrained maximization of decomposable submodular functions. A submodular function is decomposable if it takes the form of a sum of submodular functions. The special case of maximizing a monotone, decomposable submodular function under cardinality constraints is known as the Combinatorial Public Projects (CPP) problem [Papadimitriou et al., 2008]. Previous work by Gupta et al. [2010] gave a differentially private algorithm for the CPP problem. We extend this work by designing differentially private algorithms for both monotone and non-monotone d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.14717","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/2005.14717/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-05T01:06:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIbs0JVBJm87B+wI8g0wD5CYMhrFhkUg9ngiiW8p2P08whxkheVtlE1K7TncCxcbRB/sxyAkTzTysRKK2g6dDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:00:43.215147Z"},"content_sha256":"6c8c90290e417d044cfeebc1a8324c180b2d94b0432bdbb015ac24f4e0f46c05","schema_version":"1.0","event_id":"sha256:6c8c90290e417d044cfeebc1a8324c180b2d94b0432bdbb015ac24f4e0f46c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU/bundle.json","state_url":"https://pith.science/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU/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-20T06:00:43Z","links":{"resolver":"https://pith.science/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU","bundle":"https://pith.science/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU/bundle.json","state":"https://pith.science/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Y4WOTDBBYTI4OTVYOYXXMSJRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5Y4WOTDBBYTI4OTVYOYXXMSJRU","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":"fd90dc5f6beb2f4a0d3925c8ff6709985df9d146b2ff1ce536fe4666973d39e8","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-29T17:59:46Z","title_canon_sha256":"289e9d12c72037046b7d530020bd9d3b34f44af2395201a01fafc4661b5dd23a"},"schema_version":"1.0","source":{"id":"2005.14717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.14717","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"2005.14717v1","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14717","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"5Y4WOTDBBYTI","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"pith_short_16","alias_value":"5Y4WOTDBBYTI4OTV","created_at":"2026-07-05T01:06:44Z"},{"alias_kind":"pith_short_8","alias_value":"5Y4WOTDB","created_at":"2026-07-05T01:06:44Z"}],"graph_snapshots":[{"event_id":"sha256:6c8c90290e417d044cfeebc1a8324c180b2d94b0432bdbb015ac24f4e0f46c05","target":"graph","created_at":"2026-07-05T01:06:44Z","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/2005.14717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of differentially private constrained maximization of decomposable submodular functions. A submodular function is decomposable if it takes the form of a sum of submodular functions. The special case of maximizing a monotone, decomposable submodular function under cardinality constraints is known as the Combinatorial Public Projects (CPP) problem [Papadimitriou et al., 2008]. Previous work by Gupta et al. [2010] gave a differentially private algorithm for the CPP problem. We extend this work by designing differentially private algorithms for both monotone and non-monotone d","authors_text":"Anamay Chaturvedi, Huy Nguyen, Lydia Zakynthinou","cross_cats":["cs.CR","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-29T17:59:46Z","title":"Differentially Private Decomposable Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.14717","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:f7f1c053fd7874cd326ac217c6a57dfb68afbaa361eb8c3678ca74436ecc4013","target":"record","created_at":"2026-07-05T01:06:44Z","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":"fd90dc5f6beb2f4a0d3925c8ff6709985df9d146b2ff1ce536fe4666973d39e8","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-29T17:59:46Z","title_canon_sha256":"289e9d12c72037046b7d530020bd9d3b34f44af2395201a01fafc4661b5dd23a"},"schema_version":"1.0","source":{"id":"2005.14717","kind":"arxiv","version":1}},"canonical_sha256":"ee39674c610e268e3a75c3b17bb2498d0693df56c4334d35c47f10110430a2e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee39674c610e268e3a75c3b17bb2498d0693df56c4334d35c47f10110430a2e9","first_computed_at":"2026-07-05T01:06:44.258631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:06:44.258631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eq2I7LTiJGqxWVBPVWZouhluDTjUeLuhC+ZfzyzkMcphsb24ynRG8VGkG/99D3wJNLz5xds2nW59QU64tkXKAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:06:44.259098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.14717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7f1c053fd7874cd326ac217c6a57dfb68afbaa361eb8c3678ca74436ecc4013","sha256:6c8c90290e417d044cfeebc1a8324c180b2d94b0432bdbb015ac24f4e0f46c05"],"state_sha256":"8414ff03641c99a40d26a7c5e3030da5c4cb2ae7b8e4dee0e513bc76c4f14477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jP+8iIP5jZiGZeO5HhVpMA7ghYMWIgWT2TStK5dQuvDCHTSj5Xsmrl6+XvovojXxuS0Q3NhTuTORbZY3C+PBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T06:00:43.219420Z","bundle_sha256":"455bb7bcf862f5f7d5ff07a1db7b13737447e5e58308cf9e3a31f3f5652cb857"}}