{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LAEN6HZP63ZHPLJ4EOLD2L4CQB","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":"efe1ff6b9f34ea86b5706f6b9a2fdcca5a5b04fe8e242b6df3a012ec5200cb15","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-01T02:16:50Z","title_canon_sha256":"d4ee8874fe401df6a100149ee3ae1ee1b92fdbcae060599016c9c0ca56257ab7"},"schema_version":"1.0","source":{"id":"1509.00118","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00118","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00118v2","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00118","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"LAEN6HZP63ZH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAEN6HZP63ZHPLJ4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAEN6HZP","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:a6bd7fd657f6b293b46c94472797c2cff62834448be168f3cdecf36626c25c3c","target":"graph","created_at":"2026-05-18T01:15:58Z","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":"We consider the classic Set Cover problem in the data stream model. For $n$ elements and $m$ sets ($m\\geq n$) we give a $O(1/\\delta)$-pass algorithm with a strongly sub-linear $\\tilde{O}(mn^{\\delta})$ space and logarithmic approximation factor. This yields a significant improvement over the earlier algorithm of Demaine et al. [DIMV14] that uses exponentially larger number of passes. We complement this result by showing that the tradeoff between the number of passes and space exhibited by our algorithm is tight, at least when the approximation factor is equal to $1$. Specifically, we show that ","authors_text":"Ali Vakilian, Piotr Indyk, Sariel Har-Peled, Sepideh Mahabadi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-01T02:16:50Z","title":"Towards Tight Bounds for the Streaming Set Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00118","kind":"arxiv","version":2},"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:2aab67c2a620cebaf33dcc690d4755bc02f50c4fd647471d726f214e3940b900","target":"record","created_at":"2026-05-18T01:15:58Z","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":"efe1ff6b9f34ea86b5706f6b9a2fdcca5a5b04fe8e242b6df3a012ec5200cb15","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-01T02:16:50Z","title_canon_sha256":"d4ee8874fe401df6a100149ee3ae1ee1b92fdbcae060599016c9c0ca56257ab7"},"schema_version":"1.0","source":{"id":"1509.00118","kind":"arxiv","version":2}},"canonical_sha256":"5808df1f2ff6f277ad3c23963d2f8280688319311eb82cce9f12611210ceceee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5808df1f2ff6f277ad3c23963d2f8280688319311eb82cce9f12611210ceceee","first_computed_at":"2026-05-18T01:15:58.279425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:58.279425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NRFIWtVH06/GFJgG1XVx8tdxNXxBJ9ZcC1eR4VWqwfmBw6UjGjn8M7vPjRK9sz6/vp7Bs5IofYCyhb8JNej9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:58.279995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00118","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aab67c2a620cebaf33dcc690d4755bc02f50c4fd647471d726f214e3940b900","sha256:a6bd7fd657f6b293b46c94472797c2cff62834448be168f3cdecf36626c25c3c"],"state_sha256":"7aa4b9b5354a565e63519eed273816cc7c654facc2c4bf4e235d4374a373592d"}