{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ULKHNXQ6VJ4H35I5US5SYI5V47","short_pith_number":"pith:ULKHNXQ6","schema_version":"1.0","canonical_sha256":"a2d476de1eaa787df51da4bb2c23b5e7d3ff325a32add22d714e93de6efd2f3f","source":{"kind":"arxiv","id":"1802.05249","version":2},"attestation_state":"computed","paper":{"title":"Distributionally Robust Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Wilder, Matthew Staib, Stefanie Jegelka","submitted_at":"2018-02-14T18:16:43Z","abstract_excerpt":"Submodular functions have applications throughout machine learning, but in many settings, we do not have direct access to the underlying function $f$. We focus on stochastic functions that are given as an expectation of functions over a distribution $P$. In practice, we often have only a limited set of samples $f_i$ from $P$. The standard approach indirectly optimizes $f$ by maximizing the sum of $f_i$. However, this ignores generalization to the true (unknown) distribution. In this paper, we achieve better performance on the actual underlying function $f$ by directly optimizing a combination "},"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":"1802.05249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-14T18:16:43Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"0a6a6a27d23508cac12197f995f420455a69fe8365784612ce01653b418e7c06","abstract_canon_sha256":"2fc05268e0ffdccf7f89f79f311cd0394c1fccaa5da484c4521b34062ae6653d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:06.312779Z","signature_b64":"uBrzYhrgZZ3DUQUfb8b8ky2/oljFjzv/WTk6xdCKlDSiAeAJp4zuD4vZEYT5Acv2SBeoM7p8ZjdM6BW5a3h1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d476de1eaa787df51da4bb2c23b5e7d3ff325a32add22d714e93de6efd2f3f","last_reissued_at":"2026-05-18T00:14:06.312001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:06.312001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally Robust Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Wilder, Matthew Staib, Stefanie Jegelka","submitted_at":"2018-02-14T18:16:43Z","abstract_excerpt":"Submodular functions have applications throughout machine learning, but in many settings, we do not have direct access to the underlying function $f$. We focus on stochastic functions that are given as an expectation of functions over a distribution $P$. In practice, we often have only a limited set of samples $f_i$ from $P$. The standard approach indirectly optimizes $f$ by maximizing the sum of $f_i$. However, this ignores generalization to the true (unknown) distribution. In this paper, we achieve better performance on the actual underlying function $f$ by directly optimizing a combination "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05249","kind":"arxiv","version":2},"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":"1802.05249","created_at":"2026-05-18T00:14:06.312171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05249v2","created_at":"2026-05-18T00:14:06.312171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05249","created_at":"2026-05-18T00:14:06.312171+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULKHNXQ6VJ4H","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULKHNXQ6VJ4H35I5","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULKHNXQ6","created_at":"2026-05-18T12:32:56.356000+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/ULKHNXQ6VJ4H35I5US5SYI5V47","json":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47.json","graph_json":"https://pith.science/api/pith-number/ULKHNXQ6VJ4H35I5US5SYI5V47/graph.json","events_json":"https://pith.science/api/pith-number/ULKHNXQ6VJ4H35I5US5SYI5V47/events.json","paper":"https://pith.science/paper/ULKHNXQ6"},"agent_actions":{"view_html":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47","download_json":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47.json","view_paper":"https://pith.science/paper/ULKHNXQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05249&json=true","fetch_graph":"https://pith.science/api/pith-number/ULKHNXQ6VJ4H35I5US5SYI5V47/graph.json","fetch_events":"https://pith.science/api/pith-number/ULKHNXQ6VJ4H35I5US5SYI5V47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47/action/storage_attestation","attest_author":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47/action/author_attestation","sign_citation":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47/action/citation_signature","submit_replication":"https://pith.science/pith/ULKHNXQ6VJ4H35I5US5SYI5V47/action/replication_record"}},"created_at":"2026-05-18T00:14:06.312171+00:00","updated_at":"2026-05-18T00:14:06.312171+00:00"}