{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3XBWUJUGZFA6BTWGN7IB5QIUEK","short_pith_number":"pith:3XBWUJUG","schema_version":"1.0","canonical_sha256":"ddc36a2686c941e0cec66fd01ec11422962f636d39bd12cff7b38cdb761bd45d","source":{"kind":"arxiv","id":"1612.04890","version":1},"attestation_state":"computed","paper":{"title":"Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue, Yuan Li","submitted_at":"2016-12-15T00:17:43Z","abstract_excerpt":"Let $T$ be a tree space (or tree network) represented by a weighted tree with $t$ vertices, and $S$ be a set of $n$ stochastic points in $T$, each of which has a fixed location with an independent existence probability. We investigate two fundamental problems under such a stochastic setting, the closest-pair problem and the nearest-neighbor search. For the former, we study the computation of the $\\ell$-threshold probability and the expectation of the closest-pair distance of a realization of $S$. We propose the first algorithm to compute the $\\ell$-threshold probability in $O(t+n\\log n+ \\min\\{"},"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":"1612.04890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-15T00:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"8d5debc8dcb23bdbdd506dee059f2e95e401163438319f20b46565309f7bb5c6","abstract_canon_sha256":"aff9f9603a7fcf67e70b7b36f3eb3a3be8d928385108205315758c7ffa044aca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:57.458274Z","signature_b64":"ZDTPQLDOeZLweO9Q+tt+IaKUNoAaEYzgD1SAbhM1+4Zz86wiiObImY9skIXZUKsj+YpLUW3js3h5a1/n+DH4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc36a2686c941e0cec66fd01ec11422962f636d39bd12cff7b38cdb761bd45d","last_reissued_at":"2026-05-18T00:54:57.457752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:57.457752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue, Yuan Li","submitted_at":"2016-12-15T00:17:43Z","abstract_excerpt":"Let $T$ be a tree space (or tree network) represented by a weighted tree with $t$ vertices, and $S$ be a set of $n$ stochastic points in $T$, each of which has a fixed location with an independent existence probability. We investigate two fundamental problems under such a stochastic setting, the closest-pair problem and the nearest-neighbor search. For the former, we study the computation of the $\\ell$-threshold probability and the expectation of the closest-pair distance of a realization of $S$. We propose the first algorithm to compute the $\\ell$-threshold probability in $O(t+n\\log n+ \\min\\{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04890","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":"1612.04890","created_at":"2026-05-18T00:54:57.457854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04890v1","created_at":"2026-05-18T00:54:57.457854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04890","created_at":"2026-05-18T00:54:57.457854+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XBWUJUGZFA6","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XBWUJUGZFA6BTWG","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XBWUJUG","created_at":"2026-05-18T12:29:58.707656+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/3XBWUJUGZFA6BTWGN7IB5QIUEK","json":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK.json","graph_json":"https://pith.science/api/pith-number/3XBWUJUGZFA6BTWGN7IB5QIUEK/graph.json","events_json":"https://pith.science/api/pith-number/3XBWUJUGZFA6BTWGN7IB5QIUEK/events.json","paper":"https://pith.science/paper/3XBWUJUG"},"agent_actions":{"view_html":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK","download_json":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK.json","view_paper":"https://pith.science/paper/3XBWUJUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04890&json=true","fetch_graph":"https://pith.science/api/pith-number/3XBWUJUGZFA6BTWGN7IB5QIUEK/graph.json","fetch_events":"https://pith.science/api/pith-number/3XBWUJUGZFA6BTWGN7IB5QIUEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK/action/storage_attestation","attest_author":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK/action/author_attestation","sign_citation":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK/action/citation_signature","submit_replication":"https://pith.science/pith/3XBWUJUGZFA6BTWGN7IB5QIUEK/action/replication_record"}},"created_at":"2026-05-18T00:54:57.457854+00:00","updated_at":"2026-05-18T00:54:57.457854+00:00"}