{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DXRRG5DSAEIGIL446CXA2LE52K","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":"2d5ee00068ebc099e50cc1bb45bd70444ab1135afed54ec847c09f2358060d6c","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-14T06:37:24Z","title_canon_sha256":"19d1ac234b92c6c71f514610715ddb40ebe3b3194e033fda37977fabaf6d858b"},"schema_version":"1.0","source":{"id":"1907.06173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06173","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06173v1","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06173","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"DXRRG5DSAEIG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXRRG5DSAEIGIL44","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXRRG5DS","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:88aecca7edf86ddf3c9797d39efa10660790e1a785878a4483d9007d39c6db2c","target":"graph","created_at":"2026-05-17T23:40:38Z","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 describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is $O(\\log(n) \\log^2(\\log k))$ adaptive, and uses a total of $O(n \\log\\log(k))$ queries. Recent algorithms have comparable guarantees in terms of asymptotic worst case analysis, but their actual number of rounds and query complexity depend on very large constants and polynomials in terms of precision and confidence, making them impractical for large data sets. Our ma","authors_text":"Adam Breuer, Eric Balkanski, Yaron Singer","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-14T06:37:24Z","title":"The FAST Algorithm for Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06173","kind":"arxiv","version":1},"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:959667a52a59cdf083f61c3658a6d9ecb200efcbbf45025514a980865a3ea9ec","target":"record","created_at":"2026-05-17T23:40:38Z","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":"2d5ee00068ebc099e50cc1bb45bd70444ab1135afed54ec847c09f2358060d6c","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-14T06:37:24Z","title_canon_sha256":"19d1ac234b92c6c71f514610715ddb40ebe3b3194e033fda37977fabaf6d858b"},"schema_version":"1.0","source":{"id":"1907.06173","kind":"arxiv","version":1}},"canonical_sha256":"1de31374720110642f9cf0ae0d2c9dd28011ec3241166fba0a30e572c80f085c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de31374720110642f9cf0ae0d2c9dd28011ec3241166fba0a30e572c80f085c","first_computed_at":"2026-05-17T23:40:38.301177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:38.301177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4hLDuNSm/z2VOqkFkwCzFIUU1lNORpQHhX/bwRLnNvqw/ggl+eQJyKFbRwv4WFBIVSxkwEB2UVi51PY9WfHDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:38.301589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:959667a52a59cdf083f61c3658a6d9ecb200efcbbf45025514a980865a3ea9ec","sha256:88aecca7edf86ddf3c9797d39efa10660790e1a785878a4483d9007d39c6db2c"],"state_sha256":"aa7d0357fab7d4afb951433dfd1f6d23e7b1f65e732da61066d5021588953a59"}