{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E4FA2AEUYJGG4QKXY3RHPYF3CJ","short_pith_number":"pith:E4FA2AEU","schema_version":"1.0","canonical_sha256":"270a0d0094c24c6e4157c6e277e0bb1253e1e7c2defd42b0ba89f800d3ac0cc1","source":{"kind":"arxiv","id":"1902.03534","version":1},"attestation_state":"computed","paper":{"title":"Set Cover in Sub-linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Anak Yodpinyanee, Piotr Indyk, Ronitt Rubinfeld, Sepideh Mahabadi","submitted_at":"2019-02-10T04:10:34Z","abstract_excerpt":"We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of $m$ sets over $n$ elements in the query model, we show that sub-linear algorithms derived from existing techniques have almost tight query complexities.\n  On one hand, first we show an adaptation of the streaming algorithm presented in Har-Peled et al. [2016] to the sub-linear query model, that returns an $\\alpha$-approximate cover using $\\tilde{O}(m(n/k)^{1/(\\alpha-1)} + nk)$ queries to the input, where $k$ denotes the value of a minimum set cover. We then complement this uppe"},"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":"1902.03534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T04:10:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1ad5d0dcd41624b023d4b269d38f56d534e81db40aa0c1a403767632257c0925","abstract_canon_sha256":"0dcdc573ad9ac0cac2efb3c765e18e60da65a41805a4169a4b4b00ca57760aed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.514428Z","signature_b64":"Nb8skOonL0YWEkV9iigH9/pNZo+JChzwhBig14VDT+gvkYKsMh0ad0zBnv8/L3QCZOmDUqICIp/+rN4zRwNtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"270a0d0094c24c6e4157c6e277e0bb1253e1e7c2defd42b0ba89f800d3ac0cc1","last_reissued_at":"2026-05-17T23:54:20.513871Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.513871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Cover in Sub-linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Anak Yodpinyanee, Piotr Indyk, Ronitt Rubinfeld, Sepideh Mahabadi","submitted_at":"2019-02-10T04:10:34Z","abstract_excerpt":"We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of $m$ sets over $n$ elements in the query model, we show that sub-linear algorithms derived from existing techniques have almost tight query complexities.\n  On one hand, first we show an adaptation of the streaming algorithm presented in Har-Peled et al. [2016] to the sub-linear query model, that returns an $\\alpha$-approximate cover using $\\tilde{O}(m(n/k)^{1/(\\alpha-1)} + nk)$ queries to the input, where $k$ denotes the value of a minimum set cover. We then complement this uppe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03534","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":"1902.03534","created_at":"2026-05-17T23:54:20.513952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03534v1","created_at":"2026-05-17T23:54:20.513952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03534","created_at":"2026-05-17T23:54:20.513952+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4FA2AEUYJGG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4FA2AEUYJGG4QKX","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4FA2AEU","created_at":"2026-05-18T12:33:15.570797+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/E4FA2AEUYJGG4QKXY3RHPYF3CJ","json":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ.json","graph_json":"https://pith.science/api/pith-number/E4FA2AEUYJGG4QKXY3RHPYF3CJ/graph.json","events_json":"https://pith.science/api/pith-number/E4FA2AEUYJGG4QKXY3RHPYF3CJ/events.json","paper":"https://pith.science/paper/E4FA2AEU"},"agent_actions":{"view_html":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ","download_json":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ.json","view_paper":"https://pith.science/paper/E4FA2AEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03534&json=true","fetch_graph":"https://pith.science/api/pith-number/E4FA2AEUYJGG4QKXY3RHPYF3CJ/graph.json","fetch_events":"https://pith.science/api/pith-number/E4FA2AEUYJGG4QKXY3RHPYF3CJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/action/storage_attestation","attest_author":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/action/author_attestation","sign_citation":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/action/citation_signature","submit_replication":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/action/replication_record"}},"created_at":"2026-05-17T23:54:20.513952+00:00","updated_at":"2026-05-17T23:54:20.513952+00:00"}