{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C55RTVVSBMZ75TNWGY5YJWITNF","short_pith_number":"pith:C55RTVVS","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"},"canonical_sha256":"177b19d6b20b33fecdb6363b84d9136954bcda6d8b9347c37a3c4f81392a8f13","source":{"kind":"arxiv","id":"1907.00316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00316","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00316v1","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00316","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"C55RTVVSBMZ7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C55RTVVSBMZ75TNW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C55RTVVS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C55RTVVSBMZ75TNWGY5YJWITNF","target":"record","payload":{"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"},"canonical_sha256":"177b19d6b20b33fecdb6363b84d9136954bcda6d8b9347c37a3c4f81392a8f13","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"},"source_kind":"arxiv","source_id":"1907.00316","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfG4UNRmJFUqsDC9VQdlPHIG0mXyCcA3+5huUvcFaJu2YD6vvlBiTBMr43h9z90NtEzMWgZv3P+4npQU1GpxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:25:33.116702Z"},"content_sha256":"02c6e3fc504516838e1d29493ef3fe0a97ca95dfc6a3ea9af836cc726b7fc092","schema_version":"1.0","event_id":"sha256:02c6e3fc504516838e1d29493ef3fe0a97ca95dfc6a3ea9af836cc726b7fc092"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C55RTVVSBMZ75TNWGY5YJWITNF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2tNekj3q7+PKROI9qTRymKPf1FEZdsQg8lNMbfGcvtXWQbGWhiYs65dOYNC/0a+GyuoSo8CWtO1EndJfqUuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:25:33.117385Z"},"content_sha256":"54862809f00060cb86784606d931864c31b07e545a73b85f280b6f53f63161b8","schema_version":"1.0","event_id":"sha256:54862809f00060cb86784606d931864c31b07e545a73b85f280b6f53f63161b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/bundle.json","state_url":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C55RTVVSBMZ75TNWGY5YJWITNF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T09:25:33Z","links":{"resolver":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF","bundle":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/bundle.json","state":"https://pith.science/pith/C55RTVVSBMZ75TNWGY5YJWITNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C55RTVVSBMZ75TNWGY5YJWITNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C55RTVVSBMZ75TNWGY5YJWITNF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0a644be57ac43e264417c2d116e059460e02ff39eef77febd7ca04d1b151adce","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-30T04:01:32Z","title_canon_sha256":"fcc1c2d67eee1bebafd412291fb8ae921a8238c9c8d4be8046cb602232b02346"},"schema_version":"1.0","source":{"id":"1907.00316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00316","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00316v1","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00316","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"C55RTVVSBMZ7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C55RTVVSBMZ75TNW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C55RTVVS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:54862809f00060cb86784606d931864c31b07e545a73b85f280b6f53f63161b8","target":"graph","created_at":"2026-05-17T23:41:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Maryam Fazel, Omid Sadeghi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-30T04:01:32Z","title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00316","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02c6e3fc504516838e1d29493ef3fe0a97ca95dfc6a3ea9af836cc726b7fc092","target":"record","created_at":"2026-05-17T23:41:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0a644be57ac43e264417c2d116e059460e02ff39eef77febd7ca04d1b151adce","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-30T04:01:32Z","title_canon_sha256":"fcc1c2d67eee1bebafd412291fb8ae921a8238c9c8d4be8046cb602232b02346"},"schema_version":"1.0","source":{"id":"1907.00316","kind":"arxiv","version":1}},"canonical_sha256":"177b19d6b20b33fecdb6363b84d9136954bcda6d8b9347c37a3c4f81392a8f13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"177b19d6b20b33fecdb6363b84d9136954bcda6d8b9347c37a3c4f81392a8f13","first_computed_at":"2026-05-17T23:41:52.173768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:52.173768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7GLNpaZ+Q1wJ1PJSnRU8bCgDXyqlcobIXL1OnCR/sw/KGForaWs7/q6oe5bL3nIO7KHT5OY+5VYQzhFBA/upAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:52.174408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c6e3fc504516838e1d29493ef3fe0a97ca95dfc6a3ea9af836cc726b7fc092","sha256:54862809f00060cb86784606d931864c31b07e545a73b85f280b6f53f63161b8"],"state_sha256":"8eef784b3cd8a2596e6e5854482ae84557fce840c67ba1b8e5a70a6a6ffcf869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8hkzh2iMVD8dhX4iho7cwHcAylj+rOmMX9zy7W3ob11XuRu5GKiyBVpZS9sQPWpVuzuIVzbjw/QNV2SOUZsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:25:33.121070Z","bundle_sha256":"fdfad275ea675870e306282df66bcdefc168a52f3b9857ef08dcb8229141bbbf"}}