{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X7CEYDXW4C6LQABFBONIOHFZSO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"584dd5c4979c73d5c31c19aafeadf087739e632c30779e72ac4917bfc566ae5b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T21:56:33Z","title_canon_sha256":"af102b2f65831a0c31c93712dd714273050935481b4dc99e23b41dae3b302480"},"schema_version":"1.0","source":{"id":"1811.06603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06603","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06603v2","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06603","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"pith_short_12","alias_value":"X7CEYDXW4C6L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X7CEYDXW4C6LQABF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X7CEYDXW","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:e30556744fe81c3335a1b3fff3e28e22b1584fcb210ef788c84d571da583c7b3","target":"graph","created_at":"2026-05-18T00:00:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we consider the unconstrained submodular maximization problem. We propose the first algorithm for this problem that achieves a tight $(1/2-\\varepsilon)$-approximation guarantee using $\\tilde{O}(\\varepsilon^{-1})$ adaptive rounds and a linear number of function evaluations. No previously known algorithm for this problem achieves an approximation ratio better than $1/3$ using less than $\\Omega(n)$ rounds of adaptivity, where $n$ is the size of the ground set. Moreover, our algorithm easily extends to the maximization of a non-negative continuous DR-submodular function subject to a","authors_text":"Amin Karbasi, Lin Chen, Moran Feldman","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T21:56:33Z","title":"Unconstrained Submodular Maximization with Constant Adaptive Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06603","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e4a82b3e35fe64d25f04d35f2fdde753a5b1bef956ab2d6f1625b262dd2e185f","target":"record","created_at":"2026-05-18T00:00:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"584dd5c4979c73d5c31c19aafeadf087739e632c30779e72ac4917bfc566ae5b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T21:56:33Z","title_canon_sha256":"af102b2f65831a0c31c93712dd714273050935481b4dc99e23b41dae3b302480"},"schema_version":"1.0","source":{"id":"1811.06603","kind":"arxiv","version":2}},"canonical_sha256":"bfc44c0ef6e0bcb800250b9a871cb993a5f7e82a47fe864bc26ca2246a39dd47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfc44c0ef6e0bcb800250b9a871cb993a5f7e82a47fe864bc26ca2246a39dd47","first_computed_at":"2026-05-18T00:00:29.318491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:29.318491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1oZq+Xxrbin1A9xpnCaUR1CogLIab3BPpQvrEk9L36Zs5vGiPzndBfKh/Rk2WVYfncDKSQNfkx7bBXNDZP0wBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:29.319077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a82b3e35fe64d25f04d35f2fdde753a5b1bef956ab2d6f1625b262dd2e185f","sha256:e30556744fe81c3335a1b3fff3e28e22b1584fcb210ef788c84d571da583c7b3"],"state_sha256":"3c193277ddfa1f47e1f97f34d91eb1c81e1ee0f2c3ca2cbd22d807e376b6063e"}