{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QUVYYIIVOMAXTD5BAE3UP3N44J","short_pith_number":"pith:QUVYYIIV","schema_version":"1.0","canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","source":{"kind":"arxiv","id":"1802.08183","version":4},"attestation_state":"computed","paper":{"title":"Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Amin Karbasi, Christopher Harshaw, Hamed Hassani, Lin Chen","submitted_at":"2018-02-22T17:13:36Z","abstract_excerpt":"Online optimization has been a successful framework for solving large-scale problems under computational constraints and partial information. Current methods for online convex optimization require either a projection or exact gradient computation at each step, both of which can be prohibitively expensive for large-scale applications. At the same time, there is a growing trend of non-convex optimization in machine learning community and a need for online methods. Continuous DR-submodular functions, which exhibit a natural diminishing returns condition, have recently been proposed as a broad cla"},"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.08183","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-22T17:13:36Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG"],"title_canon_sha256":"a0b7865a63fcc83b613cf0a11f0a60f85b158684cdec6d11ebb065d40be47bbc","abstract_canon_sha256":"4a7a87bbd3b6ae9442b9ba3c92e8410810cf7b5f14488c42c85e96515a4dae39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:17.303336Z","signature_b64":"9oCLsw0VVIV2R299dbpJTrwjHf0V2P3eu91id3hJjIhz5+m7nG1dxYecRGk60PPfljpV+c309ywmvIhj+vsrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","last_reissued_at":"2026-05-18T00:13:17.302442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:17.302442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Amin Karbasi, Christopher Harshaw, Hamed Hassani, Lin Chen","submitted_at":"2018-02-22T17:13:36Z","abstract_excerpt":"Online optimization has been a successful framework for solving large-scale problems under computational constraints and partial information. Current methods for online convex optimization require either a projection or exact gradient computation at each step, both of which can be prohibitively expensive for large-scale applications. At the same time, there is a growing trend of non-convex optimization in machine learning community and a need for online methods. Continuous DR-submodular functions, which exhibit a natural diminishing returns condition, have recently been proposed as a broad cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08183","kind":"arxiv","version":4},"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.08183","created_at":"2026-05-18T00:13:17.302580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08183v4","created_at":"2026-05-18T00:13:17.302580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08183","created_at":"2026-05-18T00:13:17.302580+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUVYYIIVOMAX","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUVYYIIVOMAXTD5B","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUVYYIIV","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00316","citing_title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J","json":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J.json","graph_json":"https://pith.science/api/pith-number/QUVYYIIVOMAXTD5BAE3UP3N44J/graph.json","events_json":"https://pith.science/api/pith-number/QUVYYIIVOMAXTD5BAE3UP3N44J/events.json","paper":"https://pith.science/paper/QUVYYIIV"},"agent_actions":{"view_html":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J","download_json":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J.json","view_paper":"https://pith.science/paper/QUVYYIIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08183&json=true","fetch_graph":"https://pith.science/api/pith-number/QUVYYIIVOMAXTD5BAE3UP3N44J/graph.json","fetch_events":"https://pith.science/api/pith-number/QUVYYIIVOMAXTD5BAE3UP3N44J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/action/storage_attestation","attest_author":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/action/author_attestation","sign_citation":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/action/citation_signature","submit_replication":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/action/replication_record"}},"created_at":"2026-05-18T00:13:17.302580+00:00","updated_at":"2026-05-18T00:13:17.302580+00:00"}