{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E4FA2AEUYJGG4QKXY3RHPYF3CJ","short_pith_number":"pith:E4FA2AEU","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"},"canonical_sha256":"270a0d0094c24c6e4157c6e277e0bb1253e1e7c2defd42b0ba89f800d3ac0cc1","source":{"kind":"arxiv","id":"1902.03534","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03534","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03534v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03534","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"E4FA2AEUYJGG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4FA2AEUYJGG4QKX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4FA2AEU","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E4FA2AEUYJGG4QKXY3RHPYF3CJ","target":"record","payload":{"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"},"canonical_sha256":"270a0d0094c24c6e4157c6e277e0bb1253e1e7c2defd42b0ba89f800d3ac0cc1","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"},"source_kind":"arxiv","source_id":"1902.03534","source_version":1,"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-17T23:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnJkPgoxG3KjtiKj1FgDw3VGYjiTWLt29oxGkSUdRowEDRkJDlVoh/nKoARPQD2aqXaPTZPg4oijF7iv6BJvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:53:32.010252Z"},"content_sha256":"5d256e7577ba6418efa179c5200b2de9b6528686519ee5cc0d8465652bb4dfeb","schema_version":"1.0","event_id":"sha256:5d256e7577ba6418efa179c5200b2de9b6528686519ee5cc0d8465652bb4dfeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E4FA2AEUYJGG4QKXY3RHPYF3CJ","target":"graph","payload":{"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"},"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-17T23:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yq5lw1vP2HraZA+dpc66E8ld0WeHGIcBFlDmpMT5qPWGb1f569nIuxIeQd/dTtFdN5cnkhCyKz0iDnlMTQVBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:53:32.010602Z"},"content_sha256":"1218c831731e0eb55e19d4899c86e322fdeb5b442eaccef3977bfb5da813aa26","schema_version":"1.0","event_id":"sha256:1218c831731e0eb55e19d4899c86e322fdeb5b442eaccef3977bfb5da813aa26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/bundle.json","state_url":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/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-06-22T07:53:32Z","links":{"resolver":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ","bundle":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/bundle.json","state":"https://pith.science/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4FA2AEUYJGG4QKXY3RHPYF3CJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E4FA2AEUYJGG4QKXY3RHPYF3CJ","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":"0dcdc573ad9ac0cac2efb3c765e18e60da65a41805a4169a4b4b00ca57760aed","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T04:10:34Z","title_canon_sha256":"1ad5d0dcd41624b023d4b269d38f56d534e81db40aa0c1a403767632257c0925"},"schema_version":"1.0","source":{"id":"1902.03534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03534","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03534v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03534","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"E4FA2AEUYJGG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4FA2AEUYJGG4QKX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4FA2AEU","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:1218c831731e0eb55e19d4899c86e322fdeb5b442eaccef3977bfb5da813aa26","target":"graph","created_at":"2026-05-17T23:54:20Z","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 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","authors_text":"Ali Vakilian, Anak Yodpinyanee, Piotr Indyk, Ronitt Rubinfeld, Sepideh Mahabadi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T04:10:34Z","title":"Set Cover in Sub-linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03534","kind":"arxiv","version":1},"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:5d256e7577ba6418efa179c5200b2de9b6528686519ee5cc0d8465652bb4dfeb","target":"record","created_at":"2026-05-17T23:54:20Z","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":"0dcdc573ad9ac0cac2efb3c765e18e60da65a41805a4169a4b4b00ca57760aed","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-10T04:10:34Z","title_canon_sha256":"1ad5d0dcd41624b023d4b269d38f56d534e81db40aa0c1a403767632257c0925"},"schema_version":"1.0","source":{"id":"1902.03534","kind":"arxiv","version":1}},"canonical_sha256":"270a0d0094c24c6e4157c6e277e0bb1253e1e7c2defd42b0ba89f800d3ac0cc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"270a0d0094c24c6e4157c6e277e0bb1253e1e7c2defd42b0ba89f800d3ac0cc1","first_computed_at":"2026-05-17T23:54:20.513871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:20.513871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nb8skOonL0YWEkV9iigH9/pNZo+JChzwhBig14VDT+gvkYKsMh0ad0zBnv8/L3QCZOmDUqICIp/+rN4zRwNtBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:20.514428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d256e7577ba6418efa179c5200b2de9b6528686519ee5cc0d8465652bb4dfeb","sha256:1218c831731e0eb55e19d4899c86e322fdeb5b442eaccef3977bfb5da813aa26"],"state_sha256":"d19bb56c1bdc1f5f40cd0f2e486b3764b0bf8be6465ed44874399ce16b3a2866"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWwOAROMen79C61aW1+ylnmEtAOQTrmjVxIW2vcpFLAvZzpNuS6386s8240spzjm23T35ebBXOsYkLBq37BNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:53:32.012493Z","bundle_sha256":"2826a538a6b125ad880301c38bdc0c256625dc27f1f1d17574d179dc1a0ce3db"}}