{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LAEN6HZP63ZHPLJ4EOLD2L4CQB","short_pith_number":"pith:LAEN6HZP","canonical_record":{"source":{"id":"1509.00118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-01T02:16:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d4ee8874fe401df6a100149ee3ae1ee1b92fdbcae060599016c9c0ca56257ab7","abstract_canon_sha256":"efe1ff6b9f34ea86b5706f6b9a2fdcca5a5b04fe8e242b6df3a012ec5200cb15"},"schema_version":"1.0"},"canonical_sha256":"5808df1f2ff6f277ad3c23963d2f8280688319311eb82cce9f12611210ceceee","source":{"kind":"arxiv","id":"1509.00118","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LAEN6HZP63ZHPLJ4EOLD2L4CQB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-01T02:16:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d4ee8874fe401df6a100149ee3ae1ee1b92fdbcae060599016c9c0ca56257ab7","abstract_canon_sha256":"efe1ff6b9f34ea86b5706f6b9a2fdcca5a5b04fe8e242b6df3a012ec5200cb15"},"schema_version":"1.0"},"canonical_sha256":"5808df1f2ff6f277ad3c23963d2f8280688319311eb82cce9f12611210ceceee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:58.279995Z","signature_b64":"NRFIWtVH06/GFJgG1XVx8tdxNXxBJ9ZcC1eR4VWqwfmBw6UjGjn8M7vPjRK9sz6/vp7Bs5IofYCyhb8JNej9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5808df1f2ff6f277ad3c23963d2f8280688319311eb82cce9f12611210ceceee","last_reissued_at":"2026-05-18T01:15:58.279425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:58.279425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00118","source_version":2,"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-18T01:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uk9XYgp14Vtprtf6/vJLUc2WiOUvHhIKD+x37d30HDUcToMPNTn9BhVVKF+nFHnw6jPhpoaiouFrAMoG1fvmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:49.761887Z"},"content_sha256":"2aab67c2a620cebaf33dcc690d4755bc02f50c4fd647471d726f214e3940b900","schema_version":"1.0","event_id":"sha256:2aab67c2a620cebaf33dcc690d4755bc02f50c4fd647471d726f214e3940b900"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LAEN6HZP63ZHPLJ4EOLD2L4CQB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Tight Bounds for the Streaming Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Piotr Indyk, Sariel Har-Peled, Sepideh Mahabadi","submitted_at":"2015-09-01T02:16:50Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00118","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"},"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-18T01:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SlT37dZQSNbM1TNrEYXpyjNByANa9Jp2eU4afy8cxbArEyo+c7/15Q5toSxBbCAlpkf7TB+Gmg2UtCABIvwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:49.762534Z"},"content_sha256":"a6bd7fd657f6b293b46c94472797c2cff62834448be168f3cdecf36626c25c3c","schema_version":"1.0","event_id":"sha256:a6bd7fd657f6b293b46c94472797c2cff62834448be168f3cdecf36626c25c3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB/bundle.json","state_url":"https://pith.science/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB/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-30T08:38:49Z","links":{"resolver":"https://pith.science/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB","bundle":"https://pith.science/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB/bundle.json","state":"https://pith.science/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAEN6HZP63ZHPLJ4EOLD2L4CQB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsoDE6Hpd0U5fhi4GVX6QnMuUGoSNOTug2obbEEi0LXH3ik1VlwjARmJdaha//BvG5y7ky8s28Vek7/ctWyKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:38:49.765138Z","bundle_sha256":"52b6f605a8a171086bd4844d02244b122b8abc8bab96dad65f53cb37fbd83515"}}