{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7GMF5LXTITL2FW3M33KK6ZG3NF","short_pith_number":"pith:7GMF5LXT","schema_version":"1.0","canonical_sha256":"f9985eaef344d7a2db6cded4af64db694926abe4786d7859db51bb6b87173cdb","source":{"kind":"arxiv","id":"1406.5554","version":2},"attestation_state":"computed","paper":{"title":"Kinetic Reverse $k$-Nearest Neighbor Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sue Whitesides, Valerie King, Zahed Rahmati","submitted_at":"2014-06-20T22:59:17Z","abstract_excerpt":"This paper provides the first solution to the kinetic reverse $k$-nearest neighbor (\\rknn) problem in $\\mathbb{R}^d$, which is defined as follows: Given a set $P$ of $n$ moving points in arbitrary but fixed dimension $d$, an integer $k$, and a query point $q\\notin P$ at any time $t$, report all the points $p\\in P$ for which $q$ is one of the $k$-nearest neighbors of $p$."},"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":"1406.5554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-20T22:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"e99ffad1461950189796bf5c36b542d1047b12b11d4c6f9bd05907b6e6c85712","abstract_canon_sha256":"b8809af7f20c67459c7072acbb2db46b9e97e5bcb4dfd8aa24d4482844217c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:53.023868Z","signature_b64":"ApFAcTeDRcUx7athmlvLq4q+1I3Kxn31FEYcvG89MCkEy9Tzx1bjGZz2/T3FwrOgMHx9dRerqgkzmifhyLBOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9985eaef344d7a2db6cded4af64db694926abe4786d7859db51bb6b87173cdb","last_reissued_at":"2026-05-18T02:41:53.023393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:53.023393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kinetic Reverse $k$-Nearest Neighbor Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sue Whitesides, Valerie King, Zahed Rahmati","submitted_at":"2014-06-20T22:59:17Z","abstract_excerpt":"This paper provides the first solution to the kinetic reverse $k$-nearest neighbor (\\rknn) problem in $\\mathbb{R}^d$, which is defined as follows: Given a set $P$ of $n$ moving points in arbitrary but fixed dimension $d$, an integer $k$, and a query point $q\\notin P$ at any time $t$, report all the points $p\\in P$ for which $q$ is one of the $k$-nearest neighbors of $p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5554","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":"1406.5554","created_at":"2026-05-18T02:41:53.023459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5554v2","created_at":"2026-05-18T02:41:53.023459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5554","created_at":"2026-05-18T02:41:53.023459+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GMF5LXTITL2","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GMF5LXTITL2FW3M","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GMF5LXT","created_at":"2026-05-18T12:28:16.859392+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/7GMF5LXTITL2FW3M33KK6ZG3NF","json":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF.json","graph_json":"https://pith.science/api/pith-number/7GMF5LXTITL2FW3M33KK6ZG3NF/graph.json","events_json":"https://pith.science/api/pith-number/7GMF5LXTITL2FW3M33KK6ZG3NF/events.json","paper":"https://pith.science/paper/7GMF5LXT"},"agent_actions":{"view_html":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF","download_json":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF.json","view_paper":"https://pith.science/paper/7GMF5LXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5554&json=true","fetch_graph":"https://pith.science/api/pith-number/7GMF5LXTITL2FW3M33KK6ZG3NF/graph.json","fetch_events":"https://pith.science/api/pith-number/7GMF5LXTITL2FW3M33KK6ZG3NF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF/action/storage_attestation","attest_author":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF/action/author_attestation","sign_citation":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF/action/citation_signature","submit_replication":"https://pith.science/pith/7GMF5LXTITL2FW3M33KK6ZG3NF/action/replication_record"}},"created_at":"2026-05-18T02:41:53.023459+00:00","updated_at":"2026-05-18T02:41:53.023459+00:00"}