{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3TJC2PXWKHGKB6E7DFEQTKLZ4R","short_pith_number":"pith:3TJC2PXW","schema_version":"1.0","canonical_sha256":"dcd22d3ef651cca0f89f194909a979e4498c614271be793764275b99d2adcd9d","source":{"kind":"arxiv","id":"1606.05615","version":5},"attestation_state":"computed","paper":{"title":"Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann","submitted_at":"2016-06-17T18:15:52Z","abstract_excerpt":"Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation guarantees. Specifically, i) We introduce the weak DR property that gives a unified characterization of submodularity for all set, integer-lattice and continuous functions; ii) for maximizing monotone DR-submodular continuous functions under general down-closed convex constraints, we propose a Frank-Wolfe variant with $(1-1/e)$ approximation guarantee, and su"},"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":"1606.05615","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-17T18:15:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9af7bea4b9303f5f2cd1ee4ebd7b9a7fb8a5d91e5c8ed6340a6c2c5c6747a9ec","abstract_canon_sha256":"548b7ba7b772fbcab2ac5df5011dc30b82615727a0a49d6007f501cc5f4006e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.113835Z","signature_b64":"nzk95zsXTilb2aQgiUDGyllf4vJnZ2939pBAjhRm3ggamQ17ESJd+2hwJVXcOqixpH2e8t5PiIF/aU/IRgRmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcd22d3ef651cca0f89f194909a979e4498c614271be793764275b99d2adcd9d","last_reissued_at":"2026-05-17T23:47:06.113014Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.113014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann","submitted_at":"2016-06-17T18:15:52Z","abstract_excerpt":"Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation guarantees. Specifically, i) We introduce the weak DR property that gives a unified characterization of submodularity for all set, integer-lattice and continuous functions; ii) for maximizing monotone DR-submodular continuous functions under general down-closed convex constraints, we propose a Frank-Wolfe variant with $(1-1/e)$ approximation guarantee, and su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05615","kind":"arxiv","version":5},"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":"1606.05615","created_at":"2026-05-17T23:47:06.113151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05615v5","created_at":"2026-05-17T23:47:06.113151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05615","created_at":"2026-05-17T23:47:06.113151+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TJC2PXWKHGK","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TJC2PXWKHGKB6E7","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TJC2PXW","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.00312","citing_title":"Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"1907.00316","citing_title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R","json":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R.json","graph_json":"https://pith.science/api/pith-number/3TJC2PXWKHGKB6E7DFEQTKLZ4R/graph.json","events_json":"https://pith.science/api/pith-number/3TJC2PXWKHGKB6E7DFEQTKLZ4R/events.json","paper":"https://pith.science/paper/3TJC2PXW"},"agent_actions":{"view_html":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R","download_json":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R.json","view_paper":"https://pith.science/paper/3TJC2PXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05615&json=true","fetch_graph":"https://pith.science/api/pith-number/3TJC2PXWKHGKB6E7DFEQTKLZ4R/graph.json","fetch_events":"https://pith.science/api/pith-number/3TJC2PXWKHGKB6E7DFEQTKLZ4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R/action/storage_attestation","attest_author":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R/action/author_attestation","sign_citation":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R/action/citation_signature","submit_replication":"https://pith.science/pith/3TJC2PXWKHGKB6E7DFEQTKLZ4R/action/replication_record"}},"created_at":"2026-05-17T23:47:06.113151+00:00","updated_at":"2026-05-17T23:47:06.113151+00:00"}