{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2STDLITKZI346CZMXNFD7BTQD7","short_pith_number":"pith:2STDLITK","schema_version":"1.0","canonical_sha256":"d4a635a26aca37cf0b2cbb4a3f86701fdf6d5148f088a25fae1e7e8178306b7c","source":{"kind":"arxiv","id":"1704.07497","version":1},"attestation_state":"computed","paper":{"title":"Covering Uncertain Points in a Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jingru Zhang","submitted_at":"2017-04-24T23:58:10Z","abstract_excerpt":"In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree containing a set P of n (weighted) demand points, and the location of each demand point P_i\\in P is uncertain but is known to appear in one of m_i points on T each associated with a probability. Given a covering range \\lambda, the problem is to find a minimum number of points (called centers) on T to build facilities for serving (or covering) these demand points in the sense that for each uncertain point P_i\\in P, the expected distance from P_i to at least one center is no more than $\\lambda$. The pro"},"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":"1704.07497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-24T23:58:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bc2dd174c3d3c3eb4ed8fab3791cb5da2931c338cde3e0ef6233a9b4856f2760","abstract_canon_sha256":"5591bebba517557cd9abf326939492422cada8351d238bc4754d2848c1a68ef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:37.877752Z","signature_b64":"IZ5ySZY4FZk/v0GPWq1zdnaFdSFyY/OFVEqZBnDdoUk7gpFvkjyiiwZaFijn/RHsz1Q0a1YJwQVLUJSJnLRnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4a635a26aca37cf0b2cbb4a3f86701fdf6d5148f088a25fae1e7e8178306b7c","last_reissued_at":"2026-05-18T00:45:37.877164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:37.877164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Uncertain Points in a Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jingru Zhang","submitted_at":"2017-04-24T23:58:10Z","abstract_excerpt":"In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree containing a set P of n (weighted) demand points, and the location of each demand point P_i\\in P is uncertain but is known to appear in one of m_i points on T each associated with a probability. Given a covering range \\lambda, the problem is to find a minimum number of points (called centers) on T to build facilities for serving (or covering) these demand points in the sense that for each uncertain point P_i\\in P, the expected distance from P_i to at least one center is no more than $\\lambda$. The pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07497","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":"1704.07497","created_at":"2026-05-18T00:45:37.877247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07497v1","created_at":"2026-05-18T00:45:37.877247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07497","created_at":"2026-05-18T00:45:37.877247+00:00"},{"alias_kind":"pith_short_12","alias_value":"2STDLITKZI34","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2STDLITKZI346CZM","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2STDLITK","created_at":"2026-05-18T12:30:55.937587+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/2STDLITKZI346CZMXNFD7BTQD7","json":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7.json","graph_json":"https://pith.science/api/pith-number/2STDLITKZI346CZMXNFD7BTQD7/graph.json","events_json":"https://pith.science/api/pith-number/2STDLITKZI346CZMXNFD7BTQD7/events.json","paper":"https://pith.science/paper/2STDLITK"},"agent_actions":{"view_html":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7","download_json":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7.json","view_paper":"https://pith.science/paper/2STDLITK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07497&json=true","fetch_graph":"https://pith.science/api/pith-number/2STDLITKZI346CZMXNFD7BTQD7/graph.json","fetch_events":"https://pith.science/api/pith-number/2STDLITKZI346CZMXNFD7BTQD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7/action/storage_attestation","attest_author":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7/action/author_attestation","sign_citation":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7/action/citation_signature","submit_replication":"https://pith.science/pith/2STDLITKZI346CZMXNFD7BTQD7/action/replication_record"}},"created_at":"2026-05-18T00:45:37.877247+00:00","updated_at":"2026-05-18T00:45:37.877247+00:00"}