{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JI3RWX32JOKRHFFSYR64JPC33V","short_pith_number":"pith:JI3RWX32","schema_version":"1.0","canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","source":{"kind":"arxiv","id":"1807.11462","version":1},"attestation_state":"computed","paper":{"title":"Non-monotone Submodular Maximization in Exponentially Fewer Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Breuer, Eric Balkanski, Yaron Singer","submitted_at":"2018-07-30T17:44:53Z","abstract_excerpt":"In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily close to $1/2e$ in $O(\\log^2 n)$ adaptive rounds, where $n$ is the size of the ground set. This is an exponential speedup in parallel running time over any previously studied algorithm for constrained non-monotone submodular maximization. Beyond its provable guarantees, the algorithm performs well in practice. Specifically, experiments on traffic monitoring "},"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":"1807.11462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T17:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"ca602d22606773108073cb058ba045c566995b7272650be520b575dd39b626fd","abstract_canon_sha256":"089694f9396810b0bc56de1c2423f22068bd966723cdd75cf35a3991397f46df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:31.856649Z","signature_b64":"ak7jYgd5kNoXC4dPCeiE8a/AcEyJXZYOWWsd+1Q+ISXINn9Tg1RnaxayoOtYmYafzXpj9QtsnzcVuFD//njOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","last_reissued_at":"2026-05-18T00:09:31.855973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:31.855973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-monotone Submodular Maximization in Exponentially Fewer Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Breuer, Eric Balkanski, Yaron Singer","submitted_at":"2018-07-30T17:44:53Z","abstract_excerpt":"In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily close to $1/2e$ in $O(\\log^2 n)$ adaptive rounds, where $n$ is the size of the ground set. This is an exponential speedup in parallel running time over any previously studied algorithm for constrained non-monotone submodular maximization. Beyond its provable guarantees, the algorithm performs well in practice. Specifically, experiments on traffic monitoring "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11462","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":"1807.11462","created_at":"2026-05-18T00:09:31.856085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11462v1","created_at":"2026-05-18T00:09:31.856085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11462","created_at":"2026-05-18T00:09:31.856085+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI3RWX32JOKR","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI3RWX32JOKRHFFS","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI3RWX32","created_at":"2026-05-18T12:32:31.084164+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/JI3RWX32JOKRHFFSYR64JPC33V","json":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V.json","graph_json":"https://pith.science/api/pith-number/JI3RWX32JOKRHFFSYR64JPC33V/graph.json","events_json":"https://pith.science/api/pith-number/JI3RWX32JOKRHFFSYR64JPC33V/events.json","paper":"https://pith.science/paper/JI3RWX32"},"agent_actions":{"view_html":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V","download_json":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V.json","view_paper":"https://pith.science/paper/JI3RWX32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11462&json=true","fetch_graph":"https://pith.science/api/pith-number/JI3RWX32JOKRHFFSYR64JPC33V/graph.json","fetch_events":"https://pith.science/api/pith-number/JI3RWX32JOKRHFFSYR64JPC33V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/action/storage_attestation","attest_author":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/action/author_attestation","sign_citation":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/action/citation_signature","submit_replication":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/action/replication_record"}},"created_at":"2026-05-18T00:09:31.856085+00:00","updated_at":"2026-05-18T00:09:31.856085+00:00"}