{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WM7FPMGRYJQPADKSK4M235HVUD","short_pith_number":"pith:WM7FPMGR","schema_version":"1.0","canonical_sha256":"b33e57b0d1c260f00d525719adf4f5a0d46c80be10c932f08da6a522327bd085","source":{"kind":"arxiv","id":"1812.01591","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Double Greedy Algorithm for Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Alina Ene, Huy L. Nguyen","submitted_at":"2018-12-04T18:47:09Z","abstract_excerpt":"We study parallel algorithms for the problem of maximizing a non-negative submodular function. Our main result is an algorithm that achieves a nearly-optimal $1/2 -\\epsilon$ approximation using $O(\\log(1/\\epsilon) / \\epsilon)$ parallel rounds of function evaluations. Our algorithm is based on a continuous variant of the double greedy algorithm of Buchbinder et al. that achieves the optimal $1/2$ approximation in the sequential setting. Our algorithm applies more generally to the problem of maximizing a continuous diminishing-returns (DR) function."},"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":"1812.01591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-04T18:47:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffda0377f0cfafb87c962da8d12046460758d42c2cbdb533713b4d42d6c47738","abstract_canon_sha256":"4a7cf6a51169c37e7db8b16cf89ca6d6b5d193e702e6c8600f652f6ca1be42b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:10.426260Z","signature_b64":"Ae9O3mtoTzKKYAQwV4jeSEkJeryY9XY4yxuB0i66gO0olfKQWlgHgQaWpsIhZXFJBCp+OiqhQUQTKPwt2Fd5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b33e57b0d1c260f00d525719adf4f5a0d46c80be10c932f08da6a522327bd085","last_reissued_at":"2026-05-17T23:59:10.425536Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:10.425536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Double Greedy Algorithm for Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Alina Ene, Huy L. Nguyen","submitted_at":"2018-12-04T18:47:09Z","abstract_excerpt":"We study parallel algorithms for the problem of maximizing a non-negative submodular function. Our main result is an algorithm that achieves a nearly-optimal $1/2 -\\epsilon$ approximation using $O(\\log(1/\\epsilon) / \\epsilon)$ parallel rounds of function evaluations. Our algorithm is based on a continuous variant of the double greedy algorithm of Buchbinder et al. that achieves the optimal $1/2$ approximation in the sequential setting. Our algorithm applies more generally to the problem of maximizing a continuous diminishing-returns (DR) function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01591","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":"1812.01591","created_at":"2026-05-17T23:59:10.425654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01591v1","created_at":"2026-05-17T23:59:10.425654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01591","created_at":"2026-05-17T23:59:10.425654+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM7FPMGRYJQP","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM7FPMGRYJQPADKS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM7FPMGR","created_at":"2026-05-18T12:33:01.666342+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/WM7FPMGRYJQPADKSK4M235HVUD","json":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD.json","graph_json":"https://pith.science/api/pith-number/WM7FPMGRYJQPADKSK4M235HVUD/graph.json","events_json":"https://pith.science/api/pith-number/WM7FPMGRYJQPADKSK4M235HVUD/events.json","paper":"https://pith.science/paper/WM7FPMGR"},"agent_actions":{"view_html":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD","download_json":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD.json","view_paper":"https://pith.science/paper/WM7FPMGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01591&json=true","fetch_graph":"https://pith.science/api/pith-number/WM7FPMGRYJQPADKSK4M235HVUD/graph.json","fetch_events":"https://pith.science/api/pith-number/WM7FPMGRYJQPADKSK4M235HVUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD/action/storage_attestation","attest_author":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD/action/author_attestation","sign_citation":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD/action/citation_signature","submit_replication":"https://pith.science/pith/WM7FPMGRYJQPADKSK4M235HVUD/action/replication_record"}},"created_at":"2026-05-17T23:59:10.425654+00:00","updated_at":"2026-05-17T23:59:10.425654+00:00"}