{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7UYUUJOCYWKVOE6X363N4CSFWW","short_pith_number":"pith:7UYUUJOC","schema_version":"1.0","canonical_sha256":"fd314a25c2c5955713d7dfb6de0a45b5a56b7bcc980bdd24c283d10b84c31146","source":{"kind":"arxiv","id":"1504.01497","version":2},"attestation_state":"computed","paper":{"title":"ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandros Efentakis, Dieter Pfoser","submitted_at":"2015-04-07T07:07:18Z","abstract_excerpt":"Quite recently, the algorithmic community has focused on solving multiple shortest-path query problems beyond simple vertex-to-vertex queries, especially in the context of road networks. Unfortunately, this research cannot be generalized for large-scale graphs, e.g., social or collaboration networks, or to efficiently answer Reverse k-Nearest Neighbor (RkNN) queries, which are of practical relevance to a wide range of applications. To remedy this, we propose ReHub, a novel main-memory algorithm that extends the Hub Labeling technique to efficiently answer RkNN queries on large-scale networks. "},"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":"1504.01497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-07T07:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"4441e99de2c554360682f08707522da142b91190c50f8b8afe08f6c7ce8922c0","abstract_canon_sha256":"226674c530bffda8b6f9048c011ed3bf1431e92f1a5c0d97b8cde7cc42393f6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.692616Z","signature_b64":"7HUiSidA5I/Yi/UCwBmW8wjYTY9XRwaxnp0cvjxKPYkMkZJBzjArlJSnWbrfSKuRYhSaUM1yK3wPQrRMou+KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd314a25c2c5955713d7dfb6de0a45b5a56b7bcc980bdd24c283d10b84c31146","last_reissued_at":"2026-05-18T01:37:03.692059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.692059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandros Efentakis, Dieter Pfoser","submitted_at":"2015-04-07T07:07:18Z","abstract_excerpt":"Quite recently, the algorithmic community has focused on solving multiple shortest-path query problems beyond simple vertex-to-vertex queries, especially in the context of road networks. Unfortunately, this research cannot be generalized for large-scale graphs, e.g., social or collaboration networks, or to efficiently answer Reverse k-Nearest Neighbor (RkNN) queries, which are of practical relevance to a wide range of applications. To remedy this, we propose ReHub, a novel main-memory algorithm that extends the Hub Labeling technique to efficiently answer RkNN queries on large-scale networks. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01497","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":"1504.01497","created_at":"2026-05-18T01:37:03.692157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01497v2","created_at":"2026-05-18T01:37:03.692157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01497","created_at":"2026-05-18T01:37:03.692157+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UYUUJOCYWKV","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UYUUJOCYWKVOE6X","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UYUUJOC","created_at":"2026-05-18T12:29:10.953037+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/7UYUUJOCYWKVOE6X363N4CSFWW","json":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW.json","graph_json":"https://pith.science/api/pith-number/7UYUUJOCYWKVOE6X363N4CSFWW/graph.json","events_json":"https://pith.science/api/pith-number/7UYUUJOCYWKVOE6X363N4CSFWW/events.json","paper":"https://pith.science/paper/7UYUUJOC"},"agent_actions":{"view_html":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW","download_json":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW.json","view_paper":"https://pith.science/paper/7UYUUJOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01497&json=true","fetch_graph":"https://pith.science/api/pith-number/7UYUUJOCYWKVOE6X363N4CSFWW/graph.json","fetch_events":"https://pith.science/api/pith-number/7UYUUJOCYWKVOE6X363N4CSFWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/action/storage_attestation","attest_author":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/action/author_attestation","sign_citation":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/action/citation_signature","submit_replication":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/action/replication_record"}},"created_at":"2026-05-18T01:37:03.692157+00:00","updated_at":"2026-05-18T01:37:03.692157+00:00"}