{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XLCAP7ATEO7BPSFJUWVM744FHS","short_pith_number":"pith:XLCAP7AT","schema_version":"1.0","canonical_sha256":"bac407fc1323be17c8a9a5aacff3853cb707c44fe85c2606864871be467b6038","source":{"kind":"arxiv","id":"1704.01652","version":1},"attestation_state":"computed","paper":{"title":"Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Christopher Harshaw, Moran Feldman","submitted_at":"2017-04-05T21:03:53Z","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"},"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":"1704.01652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-05T21:03:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2af572791ea918168cb36e9cdb1f99ab5c710fd6dde650d43028ab8107a60c1b","abstract_canon_sha256":"c69ab8723a940683dd8e7e9cdbf0f526ff2f73ca04f614ca8cc9b13b4298f480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:54.666039Z","signature_b64":"+vWty8Wq0yvwXJix5YThe8s/PCqGh11PFe1ey9scTat1xfMofAsQTtVsFhgXrBVzBUrpapIh7od0aQZISr9TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bac407fc1323be17c8a9a5aacff3853cb707c44fe85c2606864871be467b6038","last_reissued_at":"2026-05-18T00:46:54.665608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:54.665608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Christopher Harshaw, Moran Feldman","submitted_at":"2017-04-05T21:03:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01652","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":"1704.01652","created_at":"2026-05-18T00:46:54.665677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01652v1","created_at":"2026-05-18T00:46:54.665677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01652","created_at":"2026-05-18T00:46:54.665677+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLCAP7ATEO7B","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLCAP7ATEO7BPSFJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLCAP7AT","created_at":"2026-05-18T12:31:56.362134+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/XLCAP7ATEO7BPSFJUWVM744FHS","json":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS.json","graph_json":"https://pith.science/api/pith-number/XLCAP7ATEO7BPSFJUWVM744FHS/graph.json","events_json":"https://pith.science/api/pith-number/XLCAP7ATEO7BPSFJUWVM744FHS/events.json","paper":"https://pith.science/paper/XLCAP7AT"},"agent_actions":{"view_html":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS","download_json":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS.json","view_paper":"https://pith.science/paper/XLCAP7AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01652&json=true","fetch_graph":"https://pith.science/api/pith-number/XLCAP7ATEO7BPSFJUWVM744FHS/graph.json","fetch_events":"https://pith.science/api/pith-number/XLCAP7ATEO7BPSFJUWVM744FHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS/action/storage_attestation","attest_author":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS/action/author_attestation","sign_citation":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS/action/citation_signature","submit_replication":"https://pith.science/pith/XLCAP7ATEO7BPSFJUWVM744FHS/action/replication_record"}},"created_at":"2026-05-18T00:46:54.665677+00:00","updated_at":"2026-05-18T00:46:54.665677+00:00"}