{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3C5PSIPVJB4JVJ6TQFH7LL2NEX","short_pith_number":"pith:3C5PSIPV","canonical_record":{"source":{"id":"1610.08096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-25T21:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"844766ba30bc4913c4820c480af7a60312bfe72f88e060238fdd46e943c12bea","abstract_canon_sha256":"ed64dd3af4e9697fdbc06fcbf35022efd1bfe734281ef39c8ab72f73210579dc"},"schema_version":"1.0"},"canonical_sha256":"d8baf921f548789aa7d3814ff5af4d25d378f46abf9af47bbd0df6617c386534","source":{"kind":"arxiv","id":"1610.08096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08096","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08096v2","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08096","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"3C5PSIPVJB4J","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3C5PSIPVJB4JVJ6T","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3C5PSIPV","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3C5PSIPVJB4JVJ6TQFH7LL2NEX","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-25T21:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"844766ba30bc4913c4820c480af7a60312bfe72f88e060238fdd46e943c12bea","abstract_canon_sha256":"ed64dd3af4e9697fdbc06fcbf35022efd1bfe734281ef39c8ab72f73210579dc"},"schema_version":"1.0"},"canonical_sha256":"d8baf921f548789aa7d3814ff5af4d25d378f46abf9af47bbd0df6617c386534","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:59.789963Z","signature_b64":"Pfqj4gim2/kevHgsMf717BBjkv5lHvo5DYtdnpzC1r/nUfy1xN5fQogZkqhESIFpNtpRSITbRI6mJ6qeY3fRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8baf921f548789aa7d3814ff5af4d25d378f46abf9af47bbd0df6617c386534","last_reissued_at":"2026-05-18T00:48:59.789126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:59.789126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08096","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-18T00:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdadkOK4XQD2ks0q8wZAF9CVZplpfaNa2qg1F7aBRKsIjYHYi4HzzhfqaLz6fZQ0ghFD5wO6KT06WnoGop8zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:20:52.698733Z"},"content_sha256":"4a4634c9b06e912c3054cdbd24e3618c7748a1fab558d5ca531b6d78712ec54f","schema_version":"1.0","event_id":"sha256:4a4634c9b06e912c3054cdbd24e3618c7748a1fab558d5ca531b6d78712ec54f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3C5PSIPVJB4JVJ6TQFH7LL2NEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Optimal Streaming Algorithms for Coverage Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, MohammadHossein Bateni, Vahab Mirrokni","submitted_at":"2016-10-25T21:12:03Z","abstract_excerpt":"Maximum coverage and minimum set cover problems --collectively called coverage problems-- have been studied extensively in streaming models. However, previous research not only achieve sub-optimal approximation factors and space complexities, but also study a restricted set arrival model which makes an explicit or implicit assumption on oracle access to the sets, ignoring the complexity of reading and storing the whole set at once. In this paper, we address the above shortcomings, and present algorithms with improved approximation factor and improved space complexity, and prove that our result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08096","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-18T00:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4hXEJv/TnWxonFVeYWw6aYnYGvgj3svat+Vi/mQdht0NJLO96Ibk3JfR8zGLv8DzRKw9Q3cBwJQs4MkswXJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:20:52.699078Z"},"content_sha256":"f4492aa6c1b6ff4f5638adab94095c3cfb8c4efcd19e12e623e21cb6b83950d5","schema_version":"1.0","event_id":"sha256:f4492aa6c1b6ff4f5638adab94095c3cfb8c4efcd19e12e623e21cb6b83950d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX/bundle.json","state_url":"https://pith.science/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX/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-20T06:20:52Z","links":{"resolver":"https://pith.science/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX","bundle":"https://pith.science/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX/bundle.json","state":"https://pith.science/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3C5PSIPVJB4JVJ6TQFH7LL2NEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3C5PSIPVJB4JVJ6TQFH7LL2NEX","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":"ed64dd3af4e9697fdbc06fcbf35022efd1bfe734281ef39c8ab72f73210579dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-25T21:12:03Z","title_canon_sha256":"844766ba30bc4913c4820c480af7a60312bfe72f88e060238fdd46e943c12bea"},"schema_version":"1.0","source":{"id":"1610.08096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08096","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08096v2","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08096","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"3C5PSIPVJB4J","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3C5PSIPVJB4JVJ6T","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3C5PSIPV","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f4492aa6c1b6ff4f5638adab94095c3cfb8c4efcd19e12e623e21cb6b83950d5","target":"graph","created_at":"2026-05-18T00:48:59Z","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":"Maximum coverage and minimum set cover problems --collectively called coverage problems-- have been studied extensively in streaming models. However, previous research not only achieve sub-optimal approximation factors and space complexities, but also study a restricted set arrival model which makes an explicit or implicit assumption on oracle access to the sets, ignoring the complexity of reading and storing the whole set at once. In this paper, we address the above shortcomings, and present algorithms with improved approximation factor and improved space complexity, and prove that our result","authors_text":"Hossein Esfandiari, MohammadHossein Bateni, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-25T21:12:03Z","title":"Almost Optimal Streaming Algorithms for Coverage Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08096","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:4a4634c9b06e912c3054cdbd24e3618c7748a1fab558d5ca531b6d78712ec54f","target":"record","created_at":"2026-05-18T00:48:59Z","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":"ed64dd3af4e9697fdbc06fcbf35022efd1bfe734281ef39c8ab72f73210579dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-25T21:12:03Z","title_canon_sha256":"844766ba30bc4913c4820c480af7a60312bfe72f88e060238fdd46e943c12bea"},"schema_version":"1.0","source":{"id":"1610.08096","kind":"arxiv","version":2}},"canonical_sha256":"d8baf921f548789aa7d3814ff5af4d25d378f46abf9af47bbd0df6617c386534","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8baf921f548789aa7d3814ff5af4d25d378f46abf9af47bbd0df6617c386534","first_computed_at":"2026-05-18T00:48:59.789126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:59.789126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pfqj4gim2/kevHgsMf717BBjkv5lHvo5DYtdnpzC1r/nUfy1xN5fQogZkqhESIFpNtpRSITbRI6mJ6qeY3fRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:59.789963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a4634c9b06e912c3054cdbd24e3618c7748a1fab558d5ca531b6d78712ec54f","sha256:f4492aa6c1b6ff4f5638adab94095c3cfb8c4efcd19e12e623e21cb6b83950d5"],"state_sha256":"17a7be3c5a8d3824b3ec6116713daddc776f577d6fa922bc6bd82e0f2d9447b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsWUAfDmLvHD12U+qKV5ma9CBQp/pfzKB+2ROFQ7xElaRzYjRxS9BZaIzlyfO8Nu/bPWUiCXAneALnaLwqjmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:20:52.701057Z","bundle_sha256":"fef43db0fd22bb5985f6273205e89952f151d8c3494aa0d017ad7dfa8efe5a61"}}