{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LQDBLIQEKEBW6HQ7NE4557FOSN","short_pith_number":"pith:LQDBLIQE","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"},"canonical_sha256":"5c0615a20451036f1e1f6939defcae9364ba33a5b18b29b3613f6fea6c6d7217","source":{"kind":"arxiv","id":"1409.7938","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7938","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7938v3","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7938","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"LQDBLIQEKEBW","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQDBLIQEKEBW6HQ7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQDBLIQE","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LQDBLIQEKEBW6HQ7NE4557FOSN","target":"record","payload":{"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"},"canonical_sha256":"5c0615a20451036f1e1f6939defcae9364ba33a5b18b29b3613f6fea6c6d7217","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"},"source_kind":"arxiv","source_id":"1409.7938","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XItPRUGQU3JWcLSfhEvQrZoA5HfZXBrnSxAkrquaeUKhp8dxMF88GKIvxPml+0bOuFAVxdu0IIX0I3LablNZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:51:13.837304Z"},"content_sha256":"96f30db41311d3861d5d67099b9198d6671ff431ad40984555737233afe20a79","schema_version":"1.0","event_id":"sha256:96f30db41311d3861d5d67099b9198d6671ff431ad40984555737233afe20a79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LQDBLIQEKEBW6HQ7NE4557FOSN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXoRlUVoXIQ3AanFZl8z1GKcKzh7DdA98kv4bmfUg9HrkvZMaUkRasJqFvGRPv2bpGSEC67F5jGs9mi+0VAOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:51:13.837671Z"},"content_sha256":"e8f9aa24411694832b47a036b068823fa07042c41edeba957241e8b3b35514c6","schema_version":"1.0","event_id":"sha256:e8f9aa24411694832b47a036b068823fa07042c41edeba957241e8b3b35514c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/bundle.json","state_url":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T02:51:13Z","links":{"resolver":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN","bundle":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/bundle.json","state":"https://pith.science/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQDBLIQEKEBW6HQ7NE4557FOSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LQDBLIQEKEBW6HQ7NE4557FOSN","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":"3af67c40cd1613d64e04e7a2dcab17f50567cdd2533a28ed40466c0b05c6924e","cross_cats_sorted":["cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-28T18:06:23Z","title_canon_sha256":"ddb9a1702a725d08c38326cfb2723f86e2799cdcca0f207e640730bea1f2611d"},"schema_version":"1.0","source":{"id":"1409.7938","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7938","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7938v3","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7938","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"LQDBLIQEKEBW","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQDBLIQEKEBW6HQ7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQDBLIQE","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:e8f9aa24411694832b47a036b068823fa07042c41edeba957241e8b3b35514c6","target":"graph","created_at":"2026-05-18T02:32: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":"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","authors_text":"Amin Karbasi, Andreas Krause, Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Jan Vondrak","cross_cats":["cs.DS","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-28T18:06:23Z","title":"Lazier Than Lazy Greedy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7938","kind":"arxiv","version":3},"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:96f30db41311d3861d5d67099b9198d6671ff431ad40984555737233afe20a79","target":"record","created_at":"2026-05-18T02:32: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":"3af67c40cd1613d64e04e7a2dcab17f50567cdd2533a28ed40466c0b05c6924e","cross_cats_sorted":["cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-28T18:06:23Z","title_canon_sha256":"ddb9a1702a725d08c38326cfb2723f86e2799cdcca0f207e640730bea1f2611d"},"schema_version":"1.0","source":{"id":"1409.7938","kind":"arxiv","version":3}},"canonical_sha256":"5c0615a20451036f1e1f6939defcae9364ba33a5b18b29b3613f6fea6c6d7217","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c0615a20451036f1e1f6939defcae9364ba33a5b18b29b3613f6fea6c6d7217","first_computed_at":"2026-05-18T02:32:38.369427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:38.369427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9DJ8tBvPSQJ3huWTsmqzbBqkFmdr6s74VGUjyQMFFl9rBZC/nWyaV7qmCesd0TtF9YOo0N8wHFBOqZepo8mqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:38.369885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7938","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96f30db41311d3861d5d67099b9198d6671ff431ad40984555737233afe20a79","sha256:e8f9aa24411694832b47a036b068823fa07042c41edeba957241e8b3b35514c6"],"state_sha256":"fbf732d434203e690eba11d4b727df038350036543c1783e25d83c68bac3f070"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDdetFueJsiuTYK4rjcditQjlNLZemYWgj37nnofoUA7EDp00URiZZQh2qxdEPiFQVYmEZ/Yf/nM/M9GzCDPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:51:13.839615Z","bundle_sha256":"f097ea1567bce97077aa888ce91ce00aa322e8a72f4143265ea124b7542d4919"}}