{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JEJO6DR4CXKAV4GXM2OMRU55YJ","short_pith_number":"pith:JEJO6DR4","canonical_record":{"source":{"id":"1905.09595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T11:38:52Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"cb04fceee068bc73e9439e3ea85b2bf1dc56c2e18b246d2a20c0cadcbad5d936","abstract_canon_sha256":"1cafe8a62ea8cf6dcbdd0d869c77ae05bc07853fe2eff03b1e4c3ffa4690b22b"},"schema_version":"1.0"},"canonical_sha256":"4912ef0e3c15d40af0d7669cc8d3bdc25782dc5883e48374bca99491b5aa9085","source":{"kind":"arxiv","id":"1905.09595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09595","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09595v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09595","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"JEJO6DR4CXKA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JEJO6DR4CXKAV4GX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JEJO6DR4","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JEJO6DR4CXKAV4GXM2OMRU55YJ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T11:38:52Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"cb04fceee068bc73e9439e3ea85b2bf1dc56c2e18b246d2a20c0cadcbad5d936","abstract_canon_sha256":"1cafe8a62ea8cf6dcbdd0d869c77ae05bc07853fe2eff03b1e4c3ffa4690b22b"},"schema_version":"1.0"},"canonical_sha256":"4912ef0e3c15d40af0d7669cc8d3bdc25782dc5883e48374bca99491b5aa9085","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:16.603714Z","signature_b64":"Dk851Rcl3UKK6yEf68gO56daffmmjrooeecnHXMShLXGLkvYsuCPPvLoZSjcJjCFngdfN4MXF13nGnYPf8wFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4912ef0e3c15d40af0d7669cc8d3bdc25782dc5883e48374bca99491b5aa9085","last_reissued_at":"2026-05-17T23:45:16.603081Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:16.603081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09595","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:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVr0d8i/t44WrOazmVQiqSpOlap0REbLQpYppsbbFjKEFyPode6i9KouZ/Pa1x9nVsWQYdJlk7KRkmcle4ZcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:19:28.834212Z"},"content_sha256":"698c99aaf3d0faf2b175578861e81970467c35eee5980c393ad94b8a0b2df4b1","schema_version":"1.0","event_id":"sha256:698c99aaf3d0faf2b175578861e81970467c35eee5980c393ad94b8a0b2df4b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JEJO6DR4CXKAV4GXM2OMRU55YJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhinav Srivastav, Christoph D\\\"urr, L\\'eo Tible, Nguyen Kim Thang","submitted_at":"2019-05-23T11:38:52Z","abstract_excerpt":"Diminishing-returns (DR) submodular optimization is an important field with many real-world applications in machine learning, economics and communication systems. It captures a subclass of non-convex optimization that provides both practical and theoretical guarantees. In this paper, we study the fundamental problem of maximizing non-monotone DR-submodular functions over down-closed and general convex sets in both offline and online settings. First, we show that for offline maximizing non-monotone DR-submodular functions over a general convex set, the Frank-Wolfe algorithm achieves an approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09595","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:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckEHO9TLVwfD02pNHmHQPoki1UDUr6nZy+l5P9eRrCixIT7RXlr0FU3GmV9lI85HTGL9iL/T/BpIHw+lCAn3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:19:28.834948Z"},"content_sha256":"fa951b10d712f242f5d2d76ef629319497ec1ad58169f2203be5a2488fc7817e","schema_version":"1.0","event_id":"sha256:fa951b10d712f242f5d2d76ef629319497ec1ad58169f2203be5a2488fc7817e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ/bundle.json","state_url":"https://pith.science/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ/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-06-08T21:19:28Z","links":{"resolver":"https://pith.science/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ","bundle":"https://pith.science/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ/bundle.json","state":"https://pith.science/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEJO6DR4CXKAV4GXM2OMRU55YJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JEJO6DR4CXKAV4GXM2OMRU55YJ","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":"1cafe8a62ea8cf6dcbdd0d869c77ae05bc07853fe2eff03b1e4c3ffa4690b22b","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T11:38:52Z","title_canon_sha256":"cb04fceee068bc73e9439e3ea85b2bf1dc56c2e18b246d2a20c0cadcbad5d936"},"schema_version":"1.0","source":{"id":"1905.09595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09595","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09595v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09595","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"JEJO6DR4CXKA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JEJO6DR4CXKAV4GX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JEJO6DR4","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:fa951b10d712f242f5d2d76ef629319497ec1ad58169f2203be5a2488fc7817e","target":"graph","created_at":"2026-05-17T23:45:16Z","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":"Diminishing-returns (DR) submodular optimization is an important field with many real-world applications in machine learning, economics and communication systems. It captures a subclass of non-convex optimization that provides both practical and theoretical guarantees. In this paper, we study the fundamental problem of maximizing non-monotone DR-submodular functions over down-closed and general convex sets in both offline and online settings. First, we show that for offline maximizing non-monotone DR-submodular functions over a general convex set, the Frank-Wolfe algorithm achieves an approxim","authors_text":"Abhinav Srivastav, Christoph D\\\"urr, L\\'eo Tible, Nguyen Kim Thang","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T11:38:52Z","title":"Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09595","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:698c99aaf3d0faf2b175578861e81970467c35eee5980c393ad94b8a0b2df4b1","target":"record","created_at":"2026-05-17T23:45:16Z","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":"1cafe8a62ea8cf6dcbdd0d869c77ae05bc07853fe2eff03b1e4c3ffa4690b22b","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T11:38:52Z","title_canon_sha256":"cb04fceee068bc73e9439e3ea85b2bf1dc56c2e18b246d2a20c0cadcbad5d936"},"schema_version":"1.0","source":{"id":"1905.09595","kind":"arxiv","version":1}},"canonical_sha256":"4912ef0e3c15d40af0d7669cc8d3bdc25782dc5883e48374bca99491b5aa9085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4912ef0e3c15d40af0d7669cc8d3bdc25782dc5883e48374bca99491b5aa9085","first_computed_at":"2026-05-17T23:45:16.603081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:16.603081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dk851Rcl3UKK6yEf68gO56daffmmjrooeecnHXMShLXGLkvYsuCPPvLoZSjcJjCFngdfN4MXF13nGnYPf8wFBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:16.603714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:698c99aaf3d0faf2b175578861e81970467c35eee5980c393ad94b8a0b2df4b1","sha256:fa951b10d712f242f5d2d76ef629319497ec1ad58169f2203be5a2488fc7817e"],"state_sha256":"504a2164749cee40cdbcb7092ee42834453b204dae4c23661da75ee9cfb9ef36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAfQWn8Ium+OVh0dsXK4oAMyW1jJ3Rl+Zf2dwaTF82irESk7MoVxuoN7DTqkUsIqrOdl4ScLywpfQ9PKlPi7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:19:28.839242Z","bundle_sha256":"5473955e64312644640ec89ae0584b1f4cdf73124468e4753aec07cbb837be56"}}