{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HBC2XU4JWLOKR2WOCD3UBIPFGC","short_pith_number":"pith:HBC2XU4J","schema_version":"1.0","canonical_sha256":"3845abd389b2dca8eace10f740a1e530b81eea915e528036a9020ce0c7c33b84","source":{"kind":"arxiv","id":"1807.02290","version":1},"attestation_state":"computed","paper":{"title":"Differentially Private Online Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Adrian Rivera Cardoso, Rachel Cummings","submitted_at":"2018-07-06T07:30:17Z","abstract_excerpt":"In this paper we develop the first algorithms for online submodular minimization that preserve differential privacy under full information feedback and bandit feedback. A sequence of $T$ submodular functions over a collection of $n$ elements arrive online, and at each timestep the algorithm must choose a subset of $[n]$ before seeing the function. The algorithm incurs a cost equal to the function evaluated on the chosen set, and seeks to choose a sequence of sets that achieves low expected regret.\n  Our first result is in the full information setting, where the algorithm can observe the entire"},"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":"1807.02290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-06T07:30:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8d444687d65fa297fc4dc66e21599304a9d04f792d0e2f8ce9b6dbb1033d5cac","abstract_canon_sha256":"cbd38d198bd77e8d63cbef7c4446b647797d58b944068c9092e70f4bd57d8d9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.518617Z","signature_b64":"1I+3AnZFya7sHu3PwdAENfr3SIoflE3JP09j0w0lDGza6hNJuPNSRv1ZOV57lo3W9qOAY4Qj+ex5jtL9hoPQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3845abd389b2dca8eace10f740a1e530b81eea915e528036a9020ce0c7c33b84","last_reissued_at":"2026-05-18T00:11:22.518052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.518052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Online Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Adrian Rivera Cardoso, Rachel Cummings","submitted_at":"2018-07-06T07:30:17Z","abstract_excerpt":"In this paper we develop the first algorithms for online submodular minimization that preserve differential privacy under full information feedback and bandit feedback. A sequence of $T$ submodular functions over a collection of $n$ elements arrive online, and at each timestep the algorithm must choose a subset of $[n]$ before seeing the function. The algorithm incurs a cost equal to the function evaluated on the chosen set, and seeks to choose a sequence of sets that achieves low expected regret.\n  Our first result is in the full information setting, where the algorithm can observe the entire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02290","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":""},"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":"1807.02290","created_at":"2026-05-18T00:11:22.518130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02290v1","created_at":"2026-05-18T00:11:22.518130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02290","created_at":"2026-05-18T00:11:22.518130+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBC2XU4JWLOK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBC2XU4JWLOKR2WO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBC2XU4J","created_at":"2026-05-18T12:32:28.185984+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/HBC2XU4JWLOKR2WOCD3UBIPFGC","json":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC.json","graph_json":"https://pith.science/api/pith-number/HBC2XU4JWLOKR2WOCD3UBIPFGC/graph.json","events_json":"https://pith.science/api/pith-number/HBC2XU4JWLOKR2WOCD3UBIPFGC/events.json","paper":"https://pith.science/paper/HBC2XU4J"},"agent_actions":{"view_html":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC","download_json":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC.json","view_paper":"https://pith.science/paper/HBC2XU4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02290&json=true","fetch_graph":"https://pith.science/api/pith-number/HBC2XU4JWLOKR2WOCD3UBIPFGC/graph.json","fetch_events":"https://pith.science/api/pith-number/HBC2XU4JWLOKR2WOCD3UBIPFGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC/action/storage_attestation","attest_author":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC/action/author_attestation","sign_citation":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC/action/citation_signature","submit_replication":"https://pith.science/pith/HBC2XU4JWLOKR2WOCD3UBIPFGC/action/replication_record"}},"created_at":"2026-05-18T00:11:22.518130+00:00","updated_at":"2026-05-18T00:11:22.518130+00:00"}