{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5BZK7ZKYGBJPPM77IXEQ5K67PU","short_pith_number":"pith:5BZK7ZKY","schema_version":"1.0","canonical_sha256":"e872afe5583052f7b3ff45c90eabdf7d3ab9b6b260a83794f85d5d2edaf40db9","source":{"kind":"arxiv","id":"1509.01990","version":2},"attestation_state":"computed","paper":{"title":"Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Moritz von Looz","submitted_at":"2015-09-07T11:31:09Z","abstract_excerpt":"$\\newcommand{\\dist}{\\operatorname{dist}}$ In this paper we define the notion of a probabilistic neighborhood in spatial data: Let a set $P$ of $n$ points in $\\mathbb{R}^d$, a query point $q \\in \\mathbb{R}^d$, a distance metric $\\dist$, and a monotonically decreasing function $f : \\mathbb{R}^+ \\rightarrow [0,1]$ be given. Then a point $p \\in P$ belongs to the probabilistic neighborhood $N(q, f)$ of $q$ with respect to $f$ with probability $f(\\dist(p,q))$. We envision applications in facility location, sensor networks, and other scenarios where a connection between two entities becomes less like"},"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":"1509.01990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-07T11:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"5213fc0f28fe89d59116119c38ed74f2f880c908529a1df1b26f57fa618224f9","abstract_canon_sha256":"c58344fd614e41770a40b88b5ebf5e024a585efbf0d24716e67123e23a9ab34a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:43.399554Z","signature_b64":"2T83qrkVcumFm4W7QHpheostsIfxMc1ry+BkpRJAmB1xgfUhXyY+WxADBIDM3iC4s08fev9TpyrCVnufIH8JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e872afe5583052f7b3ff45c90eabdf7d3ab9b6b260a83794f85d5d2edaf40db9","last_reissued_at":"2026-05-18T01:08:43.399166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:43.399166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Moritz von Looz","submitted_at":"2015-09-07T11:31:09Z","abstract_excerpt":"$\\newcommand{\\dist}{\\operatorname{dist}}$ In this paper we define the notion of a probabilistic neighborhood in spatial data: Let a set $P$ of $n$ points in $\\mathbb{R}^d$, a query point $q \\in \\mathbb{R}^d$, a distance metric $\\dist$, and a monotonically decreasing function $f : \\mathbb{R}^+ \\rightarrow [0,1]$ be given. Then a point $p \\in P$ belongs to the probabilistic neighborhood $N(q, f)$ of $q$ with respect to $f$ with probability $f(\\dist(p,q))$. We envision applications in facility location, sensor networks, and other scenarios where a connection between two entities becomes less like"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01990","kind":"arxiv","version":2},"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":"1509.01990","created_at":"2026-05-18T01:08:43.399226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01990v2","created_at":"2026-05-18T01:08:43.399226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01990","created_at":"2026-05-18T01:08:43.399226+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BZK7ZKYGBJP","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BZK7ZKYGBJPPM77","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BZK7ZKY","created_at":"2026-05-18T12:29:05.191682+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/5BZK7ZKYGBJPPM77IXEQ5K67PU","json":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU.json","graph_json":"https://pith.science/api/pith-number/5BZK7ZKYGBJPPM77IXEQ5K67PU/graph.json","events_json":"https://pith.science/api/pith-number/5BZK7ZKYGBJPPM77IXEQ5K67PU/events.json","paper":"https://pith.science/paper/5BZK7ZKY"},"agent_actions":{"view_html":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU","download_json":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU.json","view_paper":"https://pith.science/paper/5BZK7ZKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01990&json=true","fetch_graph":"https://pith.science/api/pith-number/5BZK7ZKYGBJPPM77IXEQ5K67PU/graph.json","fetch_events":"https://pith.science/api/pith-number/5BZK7ZKYGBJPPM77IXEQ5K67PU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU/action/storage_attestation","attest_author":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU/action/author_attestation","sign_citation":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU/action/citation_signature","submit_replication":"https://pith.science/pith/5BZK7ZKYGBJPPM77IXEQ5K67PU/action/replication_record"}},"created_at":"2026-05-18T01:08:43.399226+00:00","updated_at":"2026-05-18T01:08:43.399226+00:00"}