{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CXP6UTHVYM2A4WAA4XUEEGQYA7","short_pith_number":"pith:CXP6UTHV","schema_version":"1.0","canonical_sha256":"15dfea4cf5c3340e5800e5e8421a1807f4bd38bf437c30ad511cf3c9c390a132","source":{"kind":"arxiv","id":"1711.01660","version":1},"attestation_state":"computed","paper":{"title":"Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Amin Karbasi, Aryan Mokhtari, Hamed Hassani","submitted_at":"2017-11-05T20:56:44Z","abstract_excerpt":"In this paper, we study the problem of \\textit{constrained} and \\textit{stochastic} continuous submodular maximization. Even though the objective function is not concave (nor convex) and is defined in terms of an expectation, we develop a variant of the conditional gradient method, called \\alg, which achieves a \\textit{tight} approximation guarantee. More precisely, for a monotone and continuous DR-submodular function and subject to a \\textit{general} convex body constraint, we prove that \\alg achieves a $[(1-1/e)\\text{OPT} -\\eps]$ guarantee (in expectation) with $\\mathcal{O}{(1/\\eps^3)}$ stoc"},"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":"1711.01660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-05T20:56:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0aab900760bac37a02f247f7de4f037f403261784b588ea0c9827bc7e824b613","abstract_canon_sha256":"602c4ccf679b0a34057dc81beb382217bfb9c3160dd8ee8407607545ac1b0c87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.198157Z","signature_b64":"W5/yI8RpeaOPZXz2z2lhXfSib+FGogHbMO5iOVX3R+IBX/tepr6tDg1+4zKJo/otseDaKZeYk+eged4o5z4eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15dfea4cf5c3340e5800e5e8421a1807f4bd38bf437c30ad511cf3c9c390a132","last_reissued_at":"2026-05-18T00:31:17.197404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.197404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Amin Karbasi, Aryan Mokhtari, Hamed Hassani","submitted_at":"2017-11-05T20:56:44Z","abstract_excerpt":"In this paper, we study the problem of \\textit{constrained} and \\textit{stochastic} continuous submodular maximization. Even though the objective function is not concave (nor convex) and is defined in terms of an expectation, we develop a variant of the conditional gradient method, called \\alg, which achieves a \\textit{tight} approximation guarantee. More precisely, for a monotone and continuous DR-submodular function and subject to a \\textit{general} convex body constraint, we prove that \\alg achieves a $[(1-1/e)\\text{OPT} -\\eps]$ guarantee (in expectation) with $\\mathcal{O}{(1/\\eps^3)}$ stoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01660","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":"1711.01660","created_at":"2026-05-18T00:31:17.197537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01660v1","created_at":"2026-05-18T00:31:17.197537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01660","created_at":"2026-05-18T00:31:17.197537+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXP6UTHVYM2A","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXP6UTHVYM2A4WAA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXP6UTHV","created_at":"2026-05-18T12:31:10.602751+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/CXP6UTHVYM2A4WAA4XUEEGQYA7","json":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7.json","graph_json":"https://pith.science/api/pith-number/CXP6UTHVYM2A4WAA4XUEEGQYA7/graph.json","events_json":"https://pith.science/api/pith-number/CXP6UTHVYM2A4WAA4XUEEGQYA7/events.json","paper":"https://pith.science/paper/CXP6UTHV"},"agent_actions":{"view_html":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7","download_json":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7.json","view_paper":"https://pith.science/paper/CXP6UTHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01660&json=true","fetch_graph":"https://pith.science/api/pith-number/CXP6UTHVYM2A4WAA4XUEEGQYA7/graph.json","fetch_events":"https://pith.science/api/pith-number/CXP6UTHVYM2A4WAA4XUEEGQYA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7/action/storage_attestation","attest_author":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7/action/author_attestation","sign_citation":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7/action/citation_signature","submit_replication":"https://pith.science/pith/CXP6UTHVYM2A4WAA4XUEEGQYA7/action/replication_record"}},"created_at":"2026-05-18T00:31:17.197537+00:00","updated_at":"2026-05-18T00:31:17.197537+00:00"}