{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LDVX2YALEPUA7ZRIQKQ4ZFQOIT","short_pith_number":"pith:LDVX2YAL","schema_version":"1.0","canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","source":{"kind":"arxiv","id":"1905.13272","version":1},"attestation_state":"computed","paper":{"title":"Parallel Algorithm for Non-Monotone DR-Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2019-05-30T19:35:18Z","abstract_excerpt":"In this work, we give a new parallel algorithm for the problem of maximizing a non-monotone diminishing returns submodular function subject to a cardinality constraint. For any desired accuracy $\\epsilon$, our algorithm achieves a $1/e - \\epsilon$ approximation using $O(\\log{n} \\log(1/\\epsilon) / \\epsilon^3)$ parallel rounds of function evaluations. The approximation guarantee nearly matches the best approximation guarantee known for the problem in the sequential setting and the number of parallel rounds is nearly-optimal for any constant $\\epsilon$. Previous algorithms achieve worse approxima"},"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":"1905.13272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-30T19:35:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"86d65e684e97056af46ebd20bde272fb2c373e02fdc746dc314e942e2db03151","abstract_canon_sha256":"4c6a2ce8db21e357df3a0882c83568dd5a5b77c2c35307945addc3074644bb4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.450638Z","signature_b64":"3w93F+qOwqIpOJQ6UMQUgj4lm2xXgUEIEjtv8sfdYsiRBE9fWIJbj2YL6qwTXBvvgIXm6uUADe3KOw5wkFvUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","last_reissued_at":"2026-05-17T23:44:35.450186Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.450186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Algorithm for Non-Monotone DR-Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2019-05-30T19:35:18Z","abstract_excerpt":"In this work, we give a new parallel algorithm for the problem of maximizing a non-monotone diminishing returns submodular function subject to a cardinality constraint. For any desired accuracy $\\epsilon$, our algorithm achieves a $1/e - \\epsilon$ approximation using $O(\\log{n} \\log(1/\\epsilon) / \\epsilon^3)$ parallel rounds of function evaluations. The approximation guarantee nearly matches the best approximation guarantee known for the problem in the sequential setting and the number of parallel rounds is nearly-optimal for any constant $\\epsilon$. Previous algorithms achieve worse approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13272","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":"1905.13272","created_at":"2026-05-17T23:44:35.450256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13272v1","created_at":"2026-05-17T23:44:35.450256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13272","created_at":"2026-05-17T23:44:35.450256+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDVX2YALEPUA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDVX2YALEPUA7ZRI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDVX2YAL","created_at":"2026-05-18T12:33:21.387695+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/LDVX2YALEPUA7ZRIQKQ4ZFQOIT","json":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT.json","graph_json":"https://pith.science/api/pith-number/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/graph.json","events_json":"https://pith.science/api/pith-number/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/events.json","paper":"https://pith.science/paper/LDVX2YAL"},"agent_actions":{"view_html":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT","download_json":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT.json","view_paper":"https://pith.science/paper/LDVX2YAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13272&json=true","fetch_graph":"https://pith.science/api/pith-number/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/graph.json","fetch_events":"https://pith.science/api/pith-number/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/action/storage_attestation","attest_author":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/action/author_attestation","sign_citation":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/action/citation_signature","submit_replication":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/action/replication_record"}},"created_at":"2026-05-17T23:44:35.450256+00:00","updated_at":"2026-05-17T23:44:35.450256+00:00"}