{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5ME5BUDGNWOGWIEMCAXLRECMAX","short_pith_number":"pith:5ME5BUDG","schema_version":"1.0","canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","source":{"kind":"arxiv","id":"1905.00948","version":2},"attestation_state":"computed","paper":{"title":"Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi","submitted_at":"2019-05-02T19:58:57Z","abstract_excerpt":"Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a monotone submodular function in the streaming setting with a cardinality constraint $k$. We first propose Sieve-Streaming++, which requires just one pass over the data, keeps only $O(k)$ elements and achieves the tight $(1/2)$-approximation guarantee. The best previously known streaming algorithms either achieve a suboptimal $(1/4)$-approximation with $\\Theta(k)$ memory or the optimal $(1/2)$-approximation with $O(k\\log "},"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":"1905.00948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T19:58:57Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"8d903ee67db4a45671fc74d756c6eb931c3a3fdd0b7dc2396859fc69c97f67d5","abstract_canon_sha256":"9adb73c03daefa1e87fc13424ad4374890c0b91d919359ae2d955aeedd1eb27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:25.589502Z","signature_b64":"I+52D56rpRn4HuD3KeIaXuGculK/wbag+ZT6CKmat7NS7bToP8Bql9d37o292vuaHxEH/S6YnCQN9JM3N55jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","last_reissued_at":"2026-05-17T23:46:25.588728Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:25.588728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi","submitted_at":"2019-05-02T19:58:57Z","abstract_excerpt":"Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a monotone submodular function in the streaming setting with a cardinality constraint $k$. We first propose Sieve-Streaming++, which requires just one pass over the data, keeps only $O(k)$ elements and achieves the tight $(1/2)$-approximation guarantee. The best previously known streaming algorithms either achieve a suboptimal $(1/4)$-approximation with $\\Theta(k)$ memory or the optimal $(1/2)$-approximation with $O(k\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00948","kind":"arxiv","version":2},"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":"1905.00948","created_at":"2026-05-17T23:46:25.588858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00948v2","created_at":"2026-05-17T23:46:25.588858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00948","created_at":"2026-05-17T23:46:25.588858+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ME5BUDGNWOG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ME5BUDGNWOGWIEM","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ME5BUDG","created_at":"2026-05-18T12:33:10.108867+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/5ME5BUDGNWOGWIEMCAXLRECMAX","json":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX.json","graph_json":"https://pith.science/api/pith-number/5ME5BUDGNWOGWIEMCAXLRECMAX/graph.json","events_json":"https://pith.science/api/pith-number/5ME5BUDGNWOGWIEMCAXLRECMAX/events.json","paper":"https://pith.science/paper/5ME5BUDG"},"agent_actions":{"view_html":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX","download_json":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX.json","view_paper":"https://pith.science/paper/5ME5BUDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00948&json=true","fetch_graph":"https://pith.science/api/pith-number/5ME5BUDGNWOGWIEMCAXLRECMAX/graph.json","fetch_events":"https://pith.science/api/pith-number/5ME5BUDGNWOGWIEMCAXLRECMAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/action/storage_attestation","attest_author":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/action/author_attestation","sign_citation":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/action/citation_signature","submit_replication":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/action/replication_record"}},"created_at":"2026-05-17T23:46:25.588858+00:00","updated_at":"2026-05-17T23:46:25.588858+00:00"}