{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PRL7523K6ZV5PL7GXSZ7M2RCLZ","short_pith_number":"pith:PRL7523K","schema_version":"1.0","canonical_sha256":"7c57feeb6af66bd7afe6bcb3f66a225e772c903e29362c422ebf7d174314bc7c","source":{"kind":"arxiv","id":"1906.11237","version":1},"attestation_state":"computed","paper":{"title":"Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Naor Alaluf","submitted_at":"2019-06-26T17:59:15Z","abstract_excerpt":"In this paper we consider the problem of maximizing a non-negative submodular function subject to a cardinality constraint in the data stream model. Previously, the best known algorithm for this problem was a $5.828$-approximation semi-streaming algorithm based on a local search technique (Feldman et al., 2018). For the special case of this problem in which the objective function is also monotone, the state-of-the-art semi-streaming algorithm is an algorithm known as Sieve-Streaming, which is based on a different technique (Badanidiyuru, 2014). Adapting the technique of Sieve-Streaming to non-"},"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":"1906.11237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T17:59:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"063b318bcee516e7f9fffbf402bf2bbeaa136af4ab55e010b5bc2e2f4b71b22e","abstract_canon_sha256":"4f881bb1ed8494dcdb2d36c0b0bfe1573780ef3b1c341d1d37f63ddbe14ce5c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:09.297169Z","signature_b64":"3w/27D4q+nditH3gC/Y8uGzMZs4eS2B4Qndig9bXb8YZysusjoNIyj+5p6e4a/5fHxH20j4oC/r9o7N8Y0FRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c57feeb6af66bd7afe6bcb3f66a225e772c903e29362c422ebf7d174314bc7c","last_reissued_at":"2026-05-17T23:42:09.296501Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:09.296501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Naor Alaluf","submitted_at":"2019-06-26T17:59:15Z","abstract_excerpt":"In this paper we consider the problem of maximizing a non-negative submodular function subject to a cardinality constraint in the data stream model. Previously, the best known algorithm for this problem was a $5.828$-approximation semi-streaming algorithm based on a local search technique (Feldman et al., 2018). For the special case of this problem in which the objective function is also monotone, the state-of-the-art semi-streaming algorithm is an algorithm known as Sieve-Streaming, which is based on a different technique (Badanidiyuru, 2014). Adapting the technique of Sieve-Streaming to non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11237","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":"1906.11237","created_at":"2026-05-17T23:42:09.296598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11237v1","created_at":"2026-05-17T23:42:09.296598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11237","created_at":"2026-05-17T23:42:09.296598+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRL7523K6ZV5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRL7523K6ZV5PL7G","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRL7523K","created_at":"2026-05-18T12:33:24.271573+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/PRL7523K6ZV5PL7GXSZ7M2RCLZ","json":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ.json","graph_json":"https://pith.science/api/pith-number/PRL7523K6ZV5PL7GXSZ7M2RCLZ/graph.json","events_json":"https://pith.science/api/pith-number/PRL7523K6ZV5PL7GXSZ7M2RCLZ/events.json","paper":"https://pith.science/paper/PRL7523K"},"agent_actions":{"view_html":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ","download_json":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ.json","view_paper":"https://pith.science/paper/PRL7523K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11237&json=true","fetch_graph":"https://pith.science/api/pith-number/PRL7523K6ZV5PL7GXSZ7M2RCLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/PRL7523K6ZV5PL7GXSZ7M2RCLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ/action/storage_attestation","attest_author":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ/action/author_attestation","sign_citation":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ/action/citation_signature","submit_replication":"https://pith.science/pith/PRL7523K6ZV5PL7GXSZ7M2RCLZ/action/replication_record"}},"created_at":"2026-05-17T23:42:09.296598+00:00","updated_at":"2026-05-17T23:42:09.296598+00:00"}