{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZHH7UJB4JBPJY4HQDTKFIRINJ4","short_pith_number":"pith:ZHH7UJB4","schema_version":"1.0","canonical_sha256":"c9cffa243c485e9c70f01cd454450d4f033590ec1a845c6c612085a625aca3b1","source":{"kind":"arxiv","id":"1202.1090","version":1},"attestation_state":"computed","paper":{"title":"The covert set-cover problem with application to Network Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sandeep Sen, V. N. Muralidhara","submitted_at":"2012-02-06T10:14:24Z","abstract_excerpt":"We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. We present a Monte Carlo randomized algorithm that approximates an optimal set-cover of size $OPT$ within $O(\\log N)$ factor with high probability using $O(OPT \\cdot \\log^2 N)$ queries where $N$ is the input size.\n  We apply this technique to the network discovery problem that involves ce"},"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":"1202.1090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-06T10:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"59fc7c3cb9e2e272a18a0b5547ac381efee34d73395c3e96c87058e9dd78bc4d","abstract_canon_sha256":"b5d0584f5454e4849a7b125ac36b159e0d5c6eff3db9a0b8b5e43adc0a01efe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.075456Z","signature_b64":"fhQIy+El4xrzFBUc6zchAKi33GmeKQURAqOVYGxfNVRdQZCgUr8DmEqJmn0gYr0yEk7PrxeXWuyPy/F1bAu6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9cffa243c485e9c70f01cd454450d4f033590ec1a845c6c612085a625aca3b1","last_reissued_at":"2026-05-18T02:21:18.074734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.074734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The covert set-cover problem with application to Network Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sandeep Sen, V. N. Muralidhara","submitted_at":"2012-02-06T10:14:24Z","abstract_excerpt":"We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. We present a Monte Carlo randomized algorithm that approximates an optimal set-cover of size $OPT$ within $O(\\log N)$ factor with high probability using $O(OPT \\cdot \\log^2 N)$ queries where $N$ is the input size.\n  We apply this technique to the network discovery problem that involves ce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1090","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":"1202.1090","created_at":"2026-05-18T02:21:18.074833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1090v1","created_at":"2026-05-18T02:21:18.074833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1090","created_at":"2026-05-18T02:21:18.074833+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHH7UJB4JBPJ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHH7UJB4JBPJY4HQ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHH7UJB4","created_at":"2026-05-18T12:27:30.460161+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/ZHH7UJB4JBPJY4HQDTKFIRINJ4","json":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4.json","graph_json":"https://pith.science/api/pith-number/ZHH7UJB4JBPJY4HQDTKFIRINJ4/graph.json","events_json":"https://pith.science/api/pith-number/ZHH7UJB4JBPJY4HQDTKFIRINJ4/events.json","paper":"https://pith.science/paper/ZHH7UJB4"},"agent_actions":{"view_html":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4","download_json":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4.json","view_paper":"https://pith.science/paper/ZHH7UJB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1090&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHH7UJB4JBPJY4HQDTKFIRINJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHH7UJB4JBPJY4HQDTKFIRINJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/action/storage_attestation","attest_author":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/action/author_attestation","sign_citation":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/action/citation_signature","submit_replication":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/action/replication_record"}},"created_at":"2026-05-18T02:21:18.074833+00:00","updated_at":"2026-05-18T02:21:18.074833+00:00"}