{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N3BIRGQ5B3XKYVQQRRTNY2XQWK","short_pith_number":"pith:N3BIRGQ5","schema_version":"1.0","canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","source":{"kind":"arxiv","id":"1805.09480","version":1},"attestation_state":"computed","paper":{"title":"Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.DS","authors_text":"Joshua R. Wang, Rad Niazadeh, Tim Roughgarden","submitted_at":"2018-05-24T02:08:14Z","abstract_excerpt":"In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications in machine learning, economics, and communication systems. Our main result is the first $\\frac{1}{2}$-approximation algorithm for continuous submodular function maximization; this approximation factor of $\\frac{1}{2}$ is the best possible for algorithms that only query the objective function at polynomially many points. For the special case of DR-submodular m"},"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":"1805.09480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T02:08:14Z","cross_cats_sorted":["cs.GT","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"a56bb20a3b055bbfe0fbd90dd2b1ec7d0f87cc29e782809ee4edaca6291df34a","abstract_canon_sha256":"1263ef46fc2885aa04682a157817bc8ad2ec059190f3f3c454ffb501b5aae7d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.783789Z","signature_b64":"X4Ta9bI3vD3wgiYf5SJc1cBIDsq+mswAnk5xUEWVON8kXWfoX67YbuRbgzLAiFLVTefuZ0K/jmyXNqi1fQ8LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","last_reissued_at":"2026-05-18T00:15:03.783021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.783021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.DS","authors_text":"Joshua R. Wang, Rad Niazadeh, Tim Roughgarden","submitted_at":"2018-05-24T02:08:14Z","abstract_excerpt":"In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications in machine learning, economics, and communication systems. Our main result is the first $\\frac{1}{2}$-approximation algorithm for continuous submodular function maximization; this approximation factor of $\\frac{1}{2}$ is the best possible for algorithms that only query the objective function at polynomially many points. For the special case of DR-submodular m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09480","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":"1805.09480","created_at":"2026-05-18T00:15:03.783138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09480v1","created_at":"2026-05-18T00:15:03.783138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09480","created_at":"2026-05-18T00:15:03.783138+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3BIRGQ5B3XK","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3BIRGQ5B3XKYVQQ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3BIRGQ5","created_at":"2026-05-18T12:32:40.477152+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/N3BIRGQ5B3XKYVQQRRTNY2XQWK","json":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK.json","graph_json":"https://pith.science/api/pith-number/N3BIRGQ5B3XKYVQQRRTNY2XQWK/graph.json","events_json":"https://pith.science/api/pith-number/N3BIRGQ5B3XKYVQQRRTNY2XQWK/events.json","paper":"https://pith.science/paper/N3BIRGQ5"},"agent_actions":{"view_html":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK","download_json":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK.json","view_paper":"https://pith.science/paper/N3BIRGQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09480&json=true","fetch_graph":"https://pith.science/api/pith-number/N3BIRGQ5B3XKYVQQRRTNY2XQWK/graph.json","fetch_events":"https://pith.science/api/pith-number/N3BIRGQ5B3XKYVQQRRTNY2XQWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/action/storage_attestation","attest_author":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/action/author_attestation","sign_citation":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/action/citation_signature","submit_replication":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/action/replication_record"}},"created_at":"2026-05-18T00:15:03.783138+00:00","updated_at":"2026-05-18T00:15:03.783138+00:00"}