{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ENTASUZUV7C4CYLBDEPXQFDDJC","short_pith_number":"pith:ENTASUZU","canonical_record":{"source":{"id":"1810.06833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-16T06:32:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5c2d33d4872d7dfca2178e0f13952d63edca75767cda4444e2a85c4078f307d6","abstract_canon_sha256":"894c7fc5ffa06c38513aebb32ad8bf28a66cb990af56bc6f3a77ba0bd014bdb6"},"schema_version":"1.0"},"canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","source":{"kind":"arxiv","id":"1810.06833","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06833","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06833v2","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06833","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"ENTASUZUV7C4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENTASUZUV7C4CYLB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENTASUZU","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ENTASUZUV7C4CYLBDEPXQFDDJC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-16T06:32:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5c2d33d4872d7dfca2178e0f13952d63edca75767cda4444e2a85c4078f307d6","abstract_canon_sha256":"894c7fc5ffa06c38513aebb32ad8bf28a66cb990af56bc6f3a77ba0bd014bdb6"},"schema_version":"1.0"},"canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:51.873193Z","signature_b64":"qNwro+wpRQg/nm+pTCwywq0J+o18hM8cmCwsfgx0gSlSXsyVzi25o+lXz8rvQG53PBM7ENNW3sugfqFyY1jiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","last_reissued_at":"2026-05-17T23:52:51.872376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:51.872376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06833","source_version":2,"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:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUouNatVWwucTGhF+n8eOXPNaS6uKknfYy/AYGhniK+6CGiL7iJ4UQurBZkLs2M4wvp5sj0kvhWO6jAaldcJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:22:14.268265Z"},"content_sha256":"4f932b068de4a033d0d17d382ab585642e9b01a8fade3cde46ebcbff0b72cc88","schema_version":"1.0","event_id":"sha256:4f932b068de4a033d0d17d382ab585642e9b01a8fade3cde46ebcbff0b72cc88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ENTASUZUV7C4CYLBDEPXQFDDJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Tang, Yibo Zhang","submitted_at":"2018-10-16T06:32:34Z","abstract_excerpt":"In this paper, we study the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first time. We define $\\beta$ and $\\alpha$ to characterize how close a function is to continuous DR-submodulr and submodular, respectively. Under a convex polytope constraint, we prove that LDGM can achieve a $(1-e^{-\\beta}-\\epsilon)$-approximation guarantee after $O(1/\\epsilon)$ iterations, which is the same as the best previous gradient-based algorithm. Moreover, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06833","kind":"arxiv","version":2},"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:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVY3yPZcEZSjYnwAbPi7yCd1R0RsYHzS9SydSbfScLOG8HmbNag6spTMl5E/oXU/6NNbkqTacNUnR9r6k0skCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:22:14.268902Z"},"content_sha256":"409d47926312d0f9698324fa677b78189e99c45a86d02027bc6a154d7620bff1","schema_version":"1.0","event_id":"sha256:409d47926312d0f9698324fa677b78189e99c45a86d02027bc6a154d7620bff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/bundle.json","state_url":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/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-26T01:22:14Z","links":{"resolver":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC","bundle":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/bundle.json","state":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ENTASUZUV7C4CYLBDEPXQFDDJC","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":"894c7fc5ffa06c38513aebb32ad8bf28a66cb990af56bc6f3a77ba0bd014bdb6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-16T06:32:34Z","title_canon_sha256":"5c2d33d4872d7dfca2178e0f13952d63edca75767cda4444e2a85c4078f307d6"},"schema_version":"1.0","source":{"id":"1810.06833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06833","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06833v2","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06833","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"ENTASUZUV7C4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ENTASUZUV7C4CYLB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ENTASUZU","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:409d47926312d0f9698324fa677b78189e99c45a86d02027bc6a154d7620bff1","target":"graph","created_at":"2026-05-17T23:52:51Z","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 the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first time. We define $\\beta$ and $\\alpha$ to characterize how close a function is to continuous DR-submodulr and submodular, respectively. Under a convex polytope constraint, we prove that LDGM can achieve a $(1-e^{-\\beta}-\\epsilon)$-approximation guarantee after $O(1/\\epsilon)$ iterations, which is the same as the best previous gradient-based algorithm. Moreover, i","authors_text":"Chao Qian, Ke Tang, Yibo Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-16T06:32:34Z","title":"Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06833","kind":"arxiv","version":2},"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:4f932b068de4a033d0d17d382ab585642e9b01a8fade3cde46ebcbff0b72cc88","target":"record","created_at":"2026-05-17T23:52:51Z","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":"894c7fc5ffa06c38513aebb32ad8bf28a66cb990af56bc6f3a77ba0bd014bdb6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-16T06:32:34Z","title_canon_sha256":"5c2d33d4872d7dfca2178e0f13952d63edca75767cda4444e2a85c4078f307d6"},"schema_version":"1.0","source":{"id":"1810.06833","kind":"arxiv","version":2}},"canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","first_computed_at":"2026-05-17T23:52:51.872376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:51.872376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qNwro+wpRQg/nm+pTCwywq0J+o18hM8cmCwsfgx0gSlSXsyVzi25o+lXz8rvQG53PBM7ENNW3sugfqFyY1jiBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:51.873193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f932b068de4a033d0d17d382ab585642e9b01a8fade3cde46ebcbff0b72cc88","sha256:409d47926312d0f9698324fa677b78189e99c45a86d02027bc6a154d7620bff1"],"state_sha256":"114ef2af9de8aab496586271662fdb985cb4a21e3f7e6f60b7048597394a0dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YtEiCl4OGG021qH0MQk/7gtwspCYMY297a9AKJzA5YnL5uBk/PwQzkhCUzGJPwDHm4qTmXAaZ7wzTl3hwkYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:22:14.272405Z","bundle_sha256":"325838f25e8368dc188ae7fb15ca9e3af647b161801b8a9e9004f1352ee3d86d"}}