{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XPK5ZE27MKNKHHB2JFJ2OFCROL","short_pith_number":"pith:XPK5ZE27","schema_version":"1.0","canonical_sha256":"bbd5dc935f629aa39c3a4953a7145172fd18efabbba6a777008ecc3b7faf7ec3","source":{"kind":"arxiv","id":"1404.4676","version":1},"attestation_state":"computed","paper":{"title":"Approximability of the Minimum Weighted Doubly Resolving Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Changjun Wang, Xiaodong Hu, Xujin Chen","submitted_at":"2014-04-18T01:45:34Z","abstract_excerpt":"Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models. In this paper, we study source location from a deterministic point of view by modeling it as the minimum weighted doubly resolving set (DRS) problem, which is a strengthening of the well-known metric dimension problem.\n  Let $G$ be a vertex weighted undirected graph on $n$ vertices. A vertex subset $S$ of $G$ is DRS of $G$ if for every pair of vertices $u,v$ in $G$, there exist $x,y\\in S$ such that the difference of distances (in terms of nu"},"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":"1404.4676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-18T01:45:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"26988dbcce3b0f0cf02350cd87b397b8635b9f2d91d146b4bed58f25d1b8fa42","abstract_canon_sha256":"ef5fda30650053f28f15590412886f39eceefa2f519263e063c55ab1c5866740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.450883Z","signature_b64":"1Dw7y5dhHiXkGYkhwi66tKPtywKBnqzacUEJAdWLFl5Cd02m+zKpNmUid1rs5m329sbCMC00Na6RzfkoaOWVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd5dc935f629aa39c3a4953a7145172fd18efabbba6a777008ecc3b7faf7ec3","last_reissued_at":"2026-05-18T02:53:55.450039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.450039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximability of the Minimum Weighted Doubly Resolving Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Changjun Wang, Xiaodong Hu, Xujin Chen","submitted_at":"2014-04-18T01:45:34Z","abstract_excerpt":"Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models. In this paper, we study source location from a deterministic point of view by modeling it as the minimum weighted doubly resolving set (DRS) problem, which is a strengthening of the well-known metric dimension problem.\n  Let $G$ be a vertex weighted undirected graph on $n$ vertices. A vertex subset $S$ of $G$ is DRS of $G$ if for every pair of vertices $u,v$ in $G$, there exist $x,y\\in S$ such that the difference of distances (in terms of nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4676","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":"1404.4676","created_at":"2026-05-18T02:53:55.450167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4676v1","created_at":"2026-05-18T02:53:55.450167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4676","created_at":"2026-05-18T02:53:55.450167+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPK5ZE27MKNK","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPK5ZE27MKNKHHB2","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPK5ZE27","created_at":"2026-05-18T12:28:57.508820+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/XPK5ZE27MKNKHHB2JFJ2OFCROL","json":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL.json","graph_json":"https://pith.science/api/pith-number/XPK5ZE27MKNKHHB2JFJ2OFCROL/graph.json","events_json":"https://pith.science/api/pith-number/XPK5ZE27MKNKHHB2JFJ2OFCROL/events.json","paper":"https://pith.science/paper/XPK5ZE27"},"agent_actions":{"view_html":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL","download_json":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL.json","view_paper":"https://pith.science/paper/XPK5ZE27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4676&json=true","fetch_graph":"https://pith.science/api/pith-number/XPK5ZE27MKNKHHB2JFJ2OFCROL/graph.json","fetch_events":"https://pith.science/api/pith-number/XPK5ZE27MKNKHHB2JFJ2OFCROL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL/action/storage_attestation","attest_author":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL/action/author_attestation","sign_citation":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL/action/citation_signature","submit_replication":"https://pith.science/pith/XPK5ZE27MKNKHHB2JFJ2OFCROL/action/replication_record"}},"created_at":"2026-05-18T02:53:55.450167+00:00","updated_at":"2026-05-18T02:53:55.450167+00:00"}