{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DW7PGQCY47BPI7V5JLLHXLFFYX","short_pith_number":"pith:DW7PGQCY","canonical_record":{"source":{"id":"1802.07098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T13:11:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d7a0b64a031d1663910a72093e8be06fbde98a0fda741a2a169c6776c89a93fe","abstract_canon_sha256":"8e4cf98259fd455f1fe50e82328c236ae3a1fe1e16b65013b55bf80fa5f0835c"},"schema_version":"1.0"},"canonical_sha256":"1dbef34058e7c2f47ebd4ad67baca5c5f80047bd12e9377876d054b7b70c8000","source":{"kind":"arxiv","id":"1802.07098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07098","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07098v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07098","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"DW7PGQCY47BP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DW7PGQCY47BPI7V5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DW7PGQCY","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DW7PGQCY47BPI7V5JLLHXLFFYX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T13:11:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d7a0b64a031d1663910a72093e8be06fbde98a0fda741a2a169c6776c89a93fe","abstract_canon_sha256":"8e4cf98259fd455f1fe50e82328c236ae3a1fe1e16b65013b55bf80fa5f0835c"},"schema_version":"1.0"},"canonical_sha256":"1dbef34058e7c2f47ebd4ad67baca5c5f80047bd12e9377876d054b7b70c8000","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.553991Z","signature_b64":"HFuBKlSpsbErPVrmoaNNETkS+Sf8C5Caw7GMDALy8YBt9NdV097ST3DSncrx1wrJO0tZPi3KmxMHHfxSLocSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dbef34058e7c2f47ebd4ad67baca5c5f80047bd12e9377876d054b7b70c8000","last_reissued_at":"2026-05-18T00:22:53.553522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.553522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07098","source_version":1,"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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSXUEP3wnv+Fr09dzWvPoeZQjhYJ2tR8QHZRkFgekCrTwiDgLJ+ocoBmOWYnxPyCPphutWBB390ZQBlEeBhsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:01:19.733329Z"},"content_sha256":"a5b19ec280a39fa80a3bb3a43c498553a808b8f414c77fd2244359366464939a","schema_version":"1.0","event_id":"sha256:a5b19ec280a39fa80a3bb3a43c498553a808b8f414c77fd2244359366464939a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DW7PGQCY47BPI7V5JLLHXLFFYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Do Less, Get More: Streaming Submodular Maximization with Subsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Ehsan Kazemi, Moran Feldman","submitted_at":"2018-02-20T13:11:48Z","abstract_excerpt":"In this paper, we develop the first one-pass streaming algorithm for submodular maximization that does not evaluate the entire stream even once. By carefully subsampling each element of data stream, our algorithm enjoys the tightest approximation guarantees in various settings while having the smallest memory footprint and requiring the lowest number of function evaluations. More specifically, for a monotone submodular function and a $p$-matchoid constraint, our randomized algorithm achieves a $4p$ approximation ratio (in expectation) with $O(k)$ memory and $O(km/p)$ queries per element ($k$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07098","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"},"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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnZURq7iNMgMu3E0lmXmHzHBje1cFwqYbU6eHRgXE95kCm+ukwQhXOOpNsGClGXFEHBMIVcm3YQxI2GNljMDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:01:19.734154Z"},"content_sha256":"bd442c70de59631fa47503d0e1b717aba2587b72ece0f6125adc2b92a20846eb","schema_version":"1.0","event_id":"sha256:bd442c70de59631fa47503d0e1b717aba2587b72ece0f6125adc2b92a20846eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW7PGQCY47BPI7V5JLLHXLFFYX/bundle.json","state_url":"https://pith.science/pith/DW7PGQCY47BPI7V5JLLHXLFFYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW7PGQCY47BPI7V5JLLHXLFFYX/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-05-26T20:01:19Z","links":{"resolver":"https://pith.science/pith/DW7PGQCY47BPI7V5JLLHXLFFYX","bundle":"https://pith.science/pith/DW7PGQCY47BPI7V5JLLHXLFFYX/bundle.json","state":"https://pith.science/pith/DW7PGQCY47BPI7V5JLLHXLFFYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW7PGQCY47BPI7V5JLLHXLFFYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DW7PGQCY47BPI7V5JLLHXLFFYX","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":"8e4cf98259fd455f1fe50e82328c236ae3a1fe1e16b65013b55bf80fa5f0835c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T13:11:48Z","title_canon_sha256":"d7a0b64a031d1663910a72093e8be06fbde98a0fda741a2a169c6776c89a93fe"},"schema_version":"1.0","source":{"id":"1802.07098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07098","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07098v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07098","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"DW7PGQCY47BP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DW7PGQCY47BPI7V5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DW7PGQCY","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:bd442c70de59631fa47503d0e1b717aba2587b72ece0f6125adc2b92a20846eb","target":"graph","created_at":"2026-05-18T00:22:53Z","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 develop the first one-pass streaming algorithm for submodular maximization that does not evaluate the entire stream even once. By carefully subsampling each element of data stream, our algorithm enjoys the tightest approximation guarantees in various settings while having the smallest memory footprint and requiring the lowest number of function evaluations. More specifically, for a monotone submodular function and a $p$-matchoid constraint, our randomized algorithm achieves a $4p$ approximation ratio (in expectation) with $O(k)$ memory and $O(km/p)$ queries per element ($k$ i","authors_text":"Amin Karbasi, Ehsan Kazemi, Moran Feldman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T13:11:48Z","title":"Do Less, Get More: Streaming Submodular Maximization with Subsampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07098","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:a5b19ec280a39fa80a3bb3a43c498553a808b8f414c77fd2244359366464939a","target":"record","created_at":"2026-05-18T00:22:53Z","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":"8e4cf98259fd455f1fe50e82328c236ae3a1fe1e16b65013b55bf80fa5f0835c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T13:11:48Z","title_canon_sha256":"d7a0b64a031d1663910a72093e8be06fbde98a0fda741a2a169c6776c89a93fe"},"schema_version":"1.0","source":{"id":"1802.07098","kind":"arxiv","version":1}},"canonical_sha256":"1dbef34058e7c2f47ebd4ad67baca5c5f80047bd12e9377876d054b7b70c8000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dbef34058e7c2f47ebd4ad67baca5c5f80047bd12e9377876d054b7b70c8000","first_computed_at":"2026-05-18T00:22:53.553522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:53.553522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HFuBKlSpsbErPVrmoaNNETkS+Sf8C5Caw7GMDALy8YBt9NdV097ST3DSncrx1wrJO0tZPi3KmxMHHfxSLocSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:53.553991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5b19ec280a39fa80a3bb3a43c498553a808b8f414c77fd2244359366464939a","sha256:bd442c70de59631fa47503d0e1b717aba2587b72ece0f6125adc2b92a20846eb"],"state_sha256":"d83370539ca915aae8a93149dd37f877c0b8071f769d2d4a23f5f23a400157cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NS1wlSRAiFgH+Wj3rjD7k0yG6GQ8lR1/JelDxAeByS6+1boKtVkEqIa1Kn/m62FDlGaF2UAROysupr2KHDmcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:01:19.738712Z","bundle_sha256":"ed6f96536754cf75eb069d4b6df41504a4c8989224e6d017303aaf94202f5d72"}}