{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XLCAP7ATEO7BPSFJUWVM744FHS","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":"c69ab8723a940683dd8e7e9cdbf0f526ff2f73ca04f614ca8cc9b13b4298f480","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-05T21:03:53Z","title_canon_sha256":"2af572791ea918168cb36e9cdb1f99ab5c710fd6dde650d43028ab8107a60c1b"},"schema_version":"1.0","source":{"id":"1704.01652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01652","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01652v1","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01652","created_at":"2026-05-18T00:46:54Z"},{"alias_kind":"pith_short_12","alias_value":"XLCAP7ATEO7B","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLCAP7ATEO7BPSFJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLCAP7AT","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:9ad3e34d7832a60354b3e86f62ca22559688c25395f9a82fe0d8c839fd6aec0d","target":"graph","created_at":"2026-05-18T00:46:54Z","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":"It is known that greedy methods perform well for maximizing monotone submodular functions. At the same time, such methods perform poorly in the face of non-monotonicity. In this paper, we show - arguably, surprisingly - that invoking the classical greedy algorithm $O(\\sqrt{k})$-times leads to the (currently) fastest deterministic algorithm, called Repeated Greedy, for maximizing a general submodular function subject to $k$-independent system constraints. Repeated Greedy achieves $(1 + O(1/\\sqrt{k}))k$ approximation using $O(nr\\sqrt{k})$ function evaluations (here, $n$ and $r$ denote the size o","authors_text":"Amin Karbasi, Christopher Harshaw, Moran Feldman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-05T21:03:53Z","title":"Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01652","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:6c8276d8377b25b7b43b61785228250fdbd8b0897a7388d3138f22d2e8209839","target":"record","created_at":"2026-05-18T00:46:54Z","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":"c69ab8723a940683dd8e7e9cdbf0f526ff2f73ca04f614ca8cc9b13b4298f480","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-05T21:03:53Z","title_canon_sha256":"2af572791ea918168cb36e9cdb1f99ab5c710fd6dde650d43028ab8107a60c1b"},"schema_version":"1.0","source":{"id":"1704.01652","kind":"arxiv","version":1}},"canonical_sha256":"bac407fc1323be17c8a9a5aacff3853cb707c44fe85c2606864871be467b6038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bac407fc1323be17c8a9a5aacff3853cb707c44fe85c2606864871be467b6038","first_computed_at":"2026-05-18T00:46:54.665608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:54.665608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+vWty8Wq0yvwXJix5YThe8s/PCqGh11PFe1ey9scTat1xfMofAsQTtVsFhgXrBVzBUrpapIh7od0aQZISr9TBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:54.666039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c8276d8377b25b7b43b61785228250fdbd8b0897a7388d3138f22d2e8209839","sha256:9ad3e34d7832a60354b3e86f62ca22559688c25395f9a82fe0d8c839fd6aec0d"],"state_sha256":"290e88fcefdcf0c4b1f38bf947c559322c4d27d31ae082f2bcd6f80eecfa4cd1"}