{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7UYUUJOCYWKVOE6X363N4CSFWW","short_pith_number":"pith:7UYUUJOC","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"},"canonical_sha256":"fd314a25c2c5955713d7dfb6de0a45b5a56b7bcc980bdd24c283d10b84c31146","source":{"kind":"arxiv","id":"1504.01497","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01497","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01497v2","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01497","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"7UYUUJOCYWKV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UYUUJOCYWKVOE6X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UYUUJOC","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7UYUUJOCYWKVOE6X363N4CSFWW","target":"record","payload":{"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"},"canonical_sha256":"fd314a25c2c5955713d7dfb6de0a45b5a56b7bcc980bdd24c283d10b84c31146","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"},"source_kind":"arxiv","source_id":"1504.01497","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9cfL0HWwCVwOyaySG205ugR6MISDGgYTZdZ0JYr4YbX9Le7YFt3NvV91RzpHsyc75NdxbKA9U0+rYT4CuuJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:00:37.824211Z"},"content_sha256":"70ef70365c9483f88abb89bd4c3a873534fa4b72a66365c8faebae48370f2c4e","schema_version":"1.0","event_id":"sha256:70ef70365c9483f88abb89bd4c3a873534fa4b72a66365c8faebae48370f2c4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7UYUUJOCYWKVOE6X363N4CSFWW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LlETQW9dpecEa71VQknHZ9LILWjDW6P5QomPyxN3YaL/3zVNyWRS/3dACkn6bzOniNlUazdtGHgYavqsvvvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:00:37.824564Z"},"content_sha256":"49a44f62ef21036b3d40b7ce339283f9b804a51d58ca7796e8c6e3f2763acc28","schema_version":"1.0","event_id":"sha256:49a44f62ef21036b3d40b7ce339283f9b804a51d58ca7796e8c6e3f2763acc28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/bundle.json","state_url":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UYUUJOCYWKVOE6X363N4CSFWW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T13:00:37Z","links":{"resolver":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW","bundle":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/bundle.json","state":"https://pith.science/pith/7UYUUJOCYWKVOE6X363N4CSFWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UYUUJOCYWKVOE6X363N4CSFWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7UYUUJOCYWKVOE6X363N4CSFWW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"226674c530bffda8b6f9048c011ed3bf1431e92f1a5c0d97b8cde7cc42393f6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-07T07:07:18Z","title_canon_sha256":"4441e99de2c554360682f08707522da142b91190c50f8b8afe08f6c7ce8922c0"},"schema_version":"1.0","source":{"id":"1504.01497","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01497","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01497v2","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01497","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"7UYUUJOCYWKV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UYUUJOCYWKVOE6X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UYUUJOC","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:49a44f62ef21036b3d40b7ce339283f9b804a51d58ca7796e8c6e3f2763acc28","target":"graph","created_at":"2026-05-18T01:37:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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. ","authors_text":"Alexandros Efentakis, Dieter Pfoser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-07T07:07:18Z","title":"ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01497","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70ef70365c9483f88abb89bd4c3a873534fa4b72a66365c8faebae48370f2c4e","target":"record","created_at":"2026-05-18T01:37:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"226674c530bffda8b6f9048c011ed3bf1431e92f1a5c0d97b8cde7cc42393f6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-07T07:07:18Z","title_canon_sha256":"4441e99de2c554360682f08707522da142b91190c50f8b8afe08f6c7ce8922c0"},"schema_version":"1.0","source":{"id":"1504.01497","kind":"arxiv","version":2}},"canonical_sha256":"fd314a25c2c5955713d7dfb6de0a45b5a56b7bcc980bdd24c283d10b84c31146","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd314a25c2c5955713d7dfb6de0a45b5a56b7bcc980bdd24c283d10b84c31146","first_computed_at":"2026-05-18T01:37:03.692059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:03.692059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7HUiSidA5I/Yi/UCwBmW8wjYTY9XRwaxnp0cvjxKPYkMkZJBzjArlJSnWbrfSKuRYhSaUM1yK3wPQrRMou+KBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:03.692616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01497","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70ef70365c9483f88abb89bd4c3a873534fa4b72a66365c8faebae48370f2c4e","sha256:49a44f62ef21036b3d40b7ce339283f9b804a51d58ca7796e8c6e3f2763acc28"],"state_sha256":"201f827d092c3f5336ed68327ebc49f75e5f1d0f587c57713457efa02546cf8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Cyk1r5wRC9nYaIcNsuFJ1scLgQtesEvhWMVt7I1JIK68J/pj9H+zEA6gu8060G0gQmGPgKAqYMvuLDb5q1ABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:00:37.826470Z","bundle_sha256":"96181722064ff9aadaf51edda420de1eb26b2ece1fc1e017bba7b80b6844323c"}}