{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZHH7UJB4JBPJY4HQDTKFIRINJ4","short_pith_number":"pith:ZHH7UJB4","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"},"canonical_sha256":"c9cffa243c485e9c70f01cd454450d4f033590ec1a845c6c612085a625aca3b1","source":{"kind":"arxiv","id":"1202.1090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1090","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1090v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1090","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZHH7UJB4JBPJ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZHH7UJB4JBPJY4HQ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZHH7UJB4","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZHH7UJB4JBPJY4HQDTKFIRINJ4","target":"record","payload":{"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"},"canonical_sha256":"c9cffa243c485e9c70f01cd454450d4f033590ec1a845c6c612085a625aca3b1","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"},"source_kind":"arxiv","source_id":"1202.1090","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkmD9G5oXDLB1gSLKoEMQHp1yWMCiO8YgthqCfB1Bcwt1COrqu6a2rD494/ihfcP6rjc0wPquQS+/6Wf3j9SAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:50:38.570568Z"},"content_sha256":"a05aa52128a03f91c7b825cdbb57e5570a1a0cd06a9e4fa624e3c529926e002e","schema_version":"1.0","event_id":"sha256:a05aa52128a03f91c7b825cdbb57e5570a1a0cd06a9e4fa624e3c529926e002e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZHH7UJB4JBPJY4HQDTKFIRINJ4","target":"graph","payload":{"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"},"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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAXWyzbI7jTBSEkqgAwqx9ak4XD4XOvx6O9YySqV5PQzn4FV3bBukguAwI+fQI6CdEE8ADOPxUCh6YcTHMqfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:50:38.570907Z"},"content_sha256":"82f87a9c0dca6c483707af34de871aa90c6b7b7aa68f2c7f9a469fda712ca2e6","schema_version":"1.0","event_id":"sha256:82f87a9c0dca6c483707af34de871aa90c6b7b7aa68f2c7f9a469fda712ca2e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/bundle.json","state_url":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/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-03T04:50:38Z","links":{"resolver":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4","bundle":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/bundle.json","state":"https://pith.science/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHH7UJB4JBPJY4HQDTKFIRINJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZHH7UJB4JBPJY4HQDTKFIRINJ4","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":"b5d0584f5454e4849a7b125ac36b159e0d5c6eff3db9a0b8b5e43adc0a01efe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-06T10:14:24Z","title_canon_sha256":"59fc7c3cb9e2e272a18a0b5547ac381efee34d73395c3e96c87058e9dd78bc4d"},"schema_version":"1.0","source":{"id":"1202.1090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1090","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1090v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1090","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZHH7UJB4JBPJ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZHH7UJB4JBPJY4HQ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZHH7UJB4","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:82f87a9c0dca6c483707af34de871aa90c6b7b7aa68f2c7f9a469fda712ca2e6","target":"graph","created_at":"2026-05-18T02:21:18Z","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 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","authors_text":"Sandeep Sen, V. N. Muralidhara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-06T10:14:24Z","title":"The covert set-cover problem with application to Network Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1090","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:a05aa52128a03f91c7b825cdbb57e5570a1a0cd06a9e4fa624e3c529926e002e","target":"record","created_at":"2026-05-18T02:21:18Z","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":"b5d0584f5454e4849a7b125ac36b159e0d5c6eff3db9a0b8b5e43adc0a01efe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-06T10:14:24Z","title_canon_sha256":"59fc7c3cb9e2e272a18a0b5547ac381efee34d73395c3e96c87058e9dd78bc4d"},"schema_version":"1.0","source":{"id":"1202.1090","kind":"arxiv","version":1}},"canonical_sha256":"c9cffa243c485e9c70f01cd454450d4f033590ec1a845c6c612085a625aca3b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9cffa243c485e9c70f01cd454450d4f033590ec1a845c6c612085a625aca3b1","first_computed_at":"2026-05-18T02:21:18.074734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.074734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fhQIy+El4xrzFBUc6zchAKi33GmeKQURAqOVYGxfNVRdQZCgUr8DmEqJmn0gYr0yEk7PrxeXWuyPy/F1bAu6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.075456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a05aa52128a03f91c7b825cdbb57e5570a1a0cd06a9e4fa624e3c529926e002e","sha256:82f87a9c0dca6c483707af34de871aa90c6b7b7aa68f2c7f9a469fda712ca2e6"],"state_sha256":"7ff01cda51f82afe3da8389c199a040bdf0fe4c22c2402adb4a83b0745ab078b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAhkr4qWGMDtrCh6roCqRPnD9u3/IveBpjHsyVGu8kxIGDPFhWkVVoODLnr7179jxKvPmYxktyOOmgrAVcCtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:50:38.572868Z","bundle_sha256":"d38ee49c08eec91abaf6fd249dad45c777bc4df561914af22f7a984d238ecb53"}}