{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LQDBLIQEKEBW6HQ7NE4557FOSN","short_pith_number":"pith:LQDBLIQE","schema_version":"1.0","canonical_sha256":"5c0615a20451036f1e1f6939defcae9364ba33a5b18b29b3613f6fea6c6d7217","source":{"kind":"arxiv","id":"1409.7938","version":3},"attestation_state":"computed","paper":{"title":"Lazier Than Lazy Greedy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Andreas Krause, Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Jan Vondrak","submitted_at":"2014-09-28T18:06:23Z","abstract_excerpt":"Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice? In this paper, we develop the first linear-time algorithm for maximizing a general monotone submodular function subject to a cardinality constraint. We show that our randomized algorithm, STOCHASTIC-GREEDY, can achieve a $(1-1/e-\\varepsilon)$ approximation guarantee, in expectation, to the optimum solution in time linear in the size of the data and independent of the cardinality constraint. We empirically demonstrate the ef"},"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":"1409.7938","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-28T18:06:23Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"ddb9a1702a725d08c38326cfb2723f86e2799cdcca0f207e640730bea1f2611d","abstract_canon_sha256":"3af67c40cd1613d64e04e7a2dcab17f50567cdd2533a28ed40466c0b05c6924e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.369885Z","signature_b64":"9DJ8tBvPSQJ3huWTsmqzbBqkFmdr6s74VGUjyQMFFl9rBZC/nWyaV7qmCesd0TtF9YOo0N8wHFBOqZepo8mqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c0615a20451036f1e1f6939defcae9364ba33a5b18b29b3613f6fea6c6d7217","last_reissued_at":"2026-05-18T02:32:38.369427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.369427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazier Than Lazy Greedy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Andreas Krause, Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Jan Vondrak","submitted_at":"2014-09-28T18:06:23Z","abstract_excerpt":"Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice? In this paper, we develop the first linear-time algorithm for maximizing a general monotone submodular function subject to a cardinality constraint. We show that our randomized algorithm, STOCHASTIC-GREEDY, can achieve a $(1-1/e-\\varepsilon)$ approximation guarantee, in expectation, to the optimum solution in time linear in the size of the data and independent of the cardinality constraint. We empirically demonstrate the ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7938","kind":"arxiv","version":3},"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":"1409.7938","created_at":"2026-05-18T02:32:38.369497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7938v3","created_at":"2026-05-18T02:32:38.369497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7938","created_at":"2026-05-18T02:32:38.369497+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQDBLIQEKEBW","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQDBLIQEKEBW6HQ7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQDBLIQE","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04428","citing_title":"Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN","json":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN.json","graph_json":"https://pith.science/api/pith-number/LQDBLIQEKEBW6HQ7NE4557FOSN/graph.json","events_json":"https://pith.science/api/pith-number/LQDBLIQEKEBW6HQ7NE4557FOSN/events.json","paper":"https://pith.science/paper/LQDBLIQE"},"agent_actions":{"view_html":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN","download_json":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN.json","view_paper":"https://pith.science/paper/LQDBLIQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7938&json=true","fetch_graph":"https://pith.science/api/pith-number/LQDBLIQEKEBW6HQ7NE4557FOSN/graph.json","fetch_events":"https://pith.science/api/pith-number/LQDBLIQEKEBW6HQ7NE4557FOSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/action/storage_attestation","attest_author":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/action/author_attestation","sign_citation":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/action/citation_signature","submit_replication":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/action/replication_record"}},"created_at":"2026-05-18T02:32:38.369497+00:00","updated_at":"2026-05-18T02:32:38.369497+00:00"}