{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C55RTVVSBMZ75TNWGY5YJWITNF","short_pith_number":"pith:C55RTVVS","schema_version":"1.0","canonical_sha256":"177b19d6b20b33fecdb6363b84d9136954bcda6d8b9347c37a3c4f81392a8f13","source":{"kind":"arxiv","id":"1907.00316","version":1},"attestation_state":"computed","paper":{"title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Maryam Fazel, Omid Sadeghi","submitted_at":"2019-06-30T04:01:32Z","abstract_excerpt":"In this paper, we study a class of online optimization problems with long-term budget constraints where the objective functions are not necessarily concave (nor convex) but they instead satisfy the Diminishing Returns (DR) property. Specifically, a sequence of monotone DR-submodular objective functions $\\{f_t(x)\\}_{t=1}^T$ and monotone linear budget functions $\\{\\langle p_t,x \\rangle \\}_{t=1}^T$ arrive over time and assuming a total targeted budget $B_T$, the goal is to choose points $x_t$ at each time $t\\in\\{1,\\dots,T\\}$, without knowing $f_t$ and $p_t$ on that step, to achieve sub-linear reg"},"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":"1907.00316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-30T04:01:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fcc1c2d67eee1bebafd412291fb8ae921a8238c9c8d4be8046cb602232b02346","abstract_canon_sha256":"0a644be57ac43e264417c2d116e059460e02ff39eef77febd7ca04d1b151adce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.174408Z","signature_b64":"7GLNpaZ+Q1wJ1PJSnRU8bCgDXyqlcobIXL1OnCR/sw/KGForaWs7/q6oe5bL3nIO7KHT5OY+5VYQzhFBA/upAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177b19d6b20b33fecdb6363b84d9136954bcda6d8b9347c37a3c4f81392a8f13","last_reissued_at":"2026-05-17T23:41:52.173768Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.173768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Maryam Fazel, Omid Sadeghi","submitted_at":"2019-06-30T04:01:32Z","abstract_excerpt":"In this paper, we study a class of online optimization problems with long-term budget constraints where the objective functions are not necessarily concave (nor convex) but they instead satisfy the Diminishing Returns (DR) property. Specifically, a sequence of monotone DR-submodular objective functions $\\{f_t(x)\\}_{t=1}^T$ and monotone linear budget functions $\\{\\langle p_t,x \\rangle \\}_{t=1}^T$ arrive over time and assuming a total targeted budget $B_T$, the goal is to choose points $x_t$ at each time $t\\in\\{1,\\dots,T\\}$, without knowing $f_t$ and $p_t$ on that step, to achieve sub-linear reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00316","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":"1907.00316","created_at":"2026-05-17T23:41:52.173857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00316v1","created_at":"2026-05-17T23:41:52.173857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00316","created_at":"2026-05-17T23:41:52.173857+00:00"},{"alias_kind":"pith_short_12","alias_value":"C55RTVVSBMZ7","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"C55RTVVSBMZ75TNW","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"C55RTVVS","created_at":"2026-05-18T12:33:12.712433+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/C55RTVVSBMZ75TNWGY5YJWITNF","json":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF.json","graph_json":"https://pith.science/api/pith-number/C55RTVVSBMZ75TNWGY5YJWITNF/graph.json","events_json":"https://pith.science/api/pith-number/C55RTVVSBMZ75TNWGY5YJWITNF/events.json","paper":"https://pith.science/paper/C55RTVVS"},"agent_actions":{"view_html":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF","download_json":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF.json","view_paper":"https://pith.science/paper/C55RTVVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00316&json=true","fetch_graph":"https://pith.science/api/pith-number/C55RTVVSBMZ75TNWGY5YJWITNF/graph.json","fetch_events":"https://pith.science/api/pith-number/C55RTVVSBMZ75TNWGY5YJWITNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/action/storage_attestation","attest_author":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/action/author_attestation","sign_citation":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/action/citation_signature","submit_replication":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/action/replication_record"}},"created_at":"2026-05-17T23:41:52.173857+00:00","updated_at":"2026-05-17T23:41:52.173857+00:00"}