{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XNMDZ7GZEREPX5ACGMO27TQMDK","short_pith_number":"pith:XNMDZ7GZ","schema_version":"1.0","canonical_sha256":"bb583cfcd92448fbf402331dafce0c1ab4c36cf70331d8ba2de2e98af7160d5c","source":{"kind":"arxiv","id":"1507.04645","version":1},"attestation_state":"computed","paper":{"title":"Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Anthony Wirth","submitted_at":"2015-07-16T16:42:09Z","abstract_excerpt":"Set cover, over a universe of size $n$, may be modelled as a data-streaming problem, where the $m$ sets that comprise the instance are to be read one by one. A semi-streaming algorithm is allowed only $O(n\\, \\mathrm{poly}\\{\\log n, \\log m\\})$ space to process this stream. For each $p \\ge 1$, we give a very simple deterministic algorithm that makes $p$ passes over the input stream and returns an appropriately certified $(p+1)n^{1/(p+1)}$-approximation to the optimum set cover. More importantly, we proceed to show that this approximation factor is essentially tight, by showing that a factor bette"},"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":"1507.04645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-16T16:42:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8a8a7459e6496957b857c3f983a227025ede3d3b18c31b5963fad73c0ef5a744","abstract_canon_sha256":"1daa0fc01b5a3daa27b0aa125f84e55312970af4681e4eed9f9db1812a055a2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.590867Z","signature_b64":"5MkRu7kysJZgpKgiBLa2jGqUF3pkqP2QyulXfoRS+XGZj3I42BA0LhOktaEKWR4qzr3fif1mdm6reiV0+VVNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb583cfcd92448fbf402331dafce0c1ab4c36cf70331d8ba2de2e98af7160d5c","last_reissued_at":"2026-05-18T01:35:34.590205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.590205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Anthony Wirth","submitted_at":"2015-07-16T16:42:09Z","abstract_excerpt":"Set cover, over a universe of size $n$, may be modelled as a data-streaming problem, where the $m$ sets that comprise the instance are to be read one by one. A semi-streaming algorithm is allowed only $O(n\\, \\mathrm{poly}\\{\\log n, \\log m\\})$ space to process this stream. For each $p \\ge 1$, we give a very simple deterministic algorithm that makes $p$ passes over the input stream and returns an appropriately certified $(p+1)n^{1/(p+1)}$-approximation to the optimum set cover. More importantly, we proceed to show that this approximation factor is essentially tight, by showing that a factor bette"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04645","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":"1507.04645","created_at":"2026-05-18T01:35:34.590309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04645v1","created_at":"2026-05-18T01:35:34.590309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04645","created_at":"2026-05-18T01:35:34.590309+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNMDZ7GZEREP","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNMDZ7GZEREPX5AC","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNMDZ7GZ","created_at":"2026-05-18T12:29:50.041715+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/XNMDZ7GZEREPX5ACGMO27TQMDK","json":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK.json","graph_json":"https://pith.science/api/pith-number/XNMDZ7GZEREPX5ACGMO27TQMDK/graph.json","events_json":"https://pith.science/api/pith-number/XNMDZ7GZEREPX5ACGMO27TQMDK/events.json","paper":"https://pith.science/paper/XNMDZ7GZ"},"agent_actions":{"view_html":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK","download_json":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK.json","view_paper":"https://pith.science/paper/XNMDZ7GZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04645&json=true","fetch_graph":"https://pith.science/api/pith-number/XNMDZ7GZEREPX5ACGMO27TQMDK/graph.json","fetch_events":"https://pith.science/api/pith-number/XNMDZ7GZEREPX5ACGMO27TQMDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK/action/storage_attestation","attest_author":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK/action/author_attestation","sign_citation":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK/action/citation_signature","submit_replication":"https://pith.science/pith/XNMDZ7GZEREPX5ACGMO27TQMDK/action/replication_record"}},"created_at":"2026-05-18T01:35:34.590309+00:00","updated_at":"2026-05-18T01:35:34.590309+00:00"}