{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DIYASSGTBXLJE27RUQJOARD5XP","short_pith_number":"pith:DIYASSGT","canonical_record":{"source":{"id":"2206.01905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-06-04T04:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"60939871c8088f8228f8d887dd8a9a102c99b3f4de2e4a00f47e8e9f9b12deb7","abstract_canon_sha256":"f23c828268d14792cc55b0b3edac67b418ecadb87c4d5131952e8a3ccd2cb4e3"},"schema_version":"1.0"},"canonical_sha256":"1a300948d30dd6926bf1a412e0447dbbf51dae126deb527914e0e658965dd4f6","source":{"kind":"arxiv","id":"2206.01905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.01905","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"2206.01905v1","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01905","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"DIYASSGTBXLJ","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"DIYASSGTBXLJE27R","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"DIYASSGT","created_at":"2026-07-05T04:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DIYASSGTBXLJE27RUQJOARD5XP","target":"record","payload":{"canonical_record":{"source":{"id":"2206.01905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-06-04T04:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"60939871c8088f8228f8d887dd8a9a102c99b3f4de2e4a00f47e8e9f9b12deb7","abstract_canon_sha256":"f23c828268d14792cc55b0b3edac67b418ecadb87c4d5131952e8a3ccd2cb4e3"},"schema_version":"1.0"},"canonical_sha256":"1a300948d30dd6926bf1a412e0447dbbf51dae126deb527914e0e658965dd4f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:57.542989Z","signature_b64":"yxkWoDLB/xfFte3rXdZK1NuUpFyV9Gq6AvSIA1/MMbC8Q/ohzQ8RI7+//s3iAj6ywI1pythVDXMmkSkjbC2yCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a300948d30dd6926bf1a412e0447dbbf51dae126deb527914e0e658965dd4f6","last_reissued_at":"2026-07-05T04:28:57.542475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:57.542475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.01905","source_version":1,"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-07-05T04:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEJYfHb/YOiGLZyHW7rYiI9YKfr8Ckyn0bN0zkVIhxlYFD+Q6SpdYWUO4iYfBT5pOIQNOWY6vO/3W/zTOg/EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T03:24:13.574435Z"},"content_sha256":"05de98a8d0f182e2528eb2a0084d0481c70cb314d27287ec6c47f3b6213545c7","schema_version":"1.0","event_id":"sha256:05de98a8d0f182e2528eb2a0084d0481c70cb314d27287ec6c47f3b6213545c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DIYASSGTBXLJE27RUQJOARD5XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed processing of continuous range queries over moving objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hui Zhu, Ziqiang Yu","submitted_at":"2022-06-04T04:14:06Z","abstract_excerpt":"Monitoring range queries over moving objects is essential to extensive location-based services. The challenge faced with these location-based services is having to process numerous concurrent range queries over a large volume of moving objects. However, the existing range query processing algorithms are almost centralized based on one single machine, which are hard to address the challenge due to the limited memory and computing resources. To address this issue, we propose a distributed search solution for processing concurrent range queries over moving objects in this work. Firstly, a Distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01905","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.01905/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhL7mnpEgFz0gQHA0kLxTTG0qImuwsLDHJLvUtsFeqflwW9Ty1UJw5355/HEz3ljvAaSxTT2qLoxfBiblAwGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T03:24:13.574818Z"},"content_sha256":"c92464e1cce68565eb9d22dab468d003f680bd38fd5abbe095df66cb5b37d3ca","schema_version":"1.0","event_id":"sha256:c92464e1cce68565eb9d22dab468d003f680bd38fd5abbe095df66cb5b37d3ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIYASSGTBXLJE27RUQJOARD5XP/bundle.json","state_url":"https://pith.science/pith/DIYASSGTBXLJE27RUQJOARD5XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIYASSGTBXLJE27RUQJOARD5XP/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-07-17T03:24:13Z","links":{"resolver":"https://pith.science/pith/DIYASSGTBXLJE27RUQJOARD5XP","bundle":"https://pith.science/pith/DIYASSGTBXLJE27RUQJOARD5XP/bundle.json","state":"https://pith.science/pith/DIYASSGTBXLJE27RUQJOARD5XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIYASSGTBXLJE27RUQJOARD5XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DIYASSGTBXLJE27RUQJOARD5XP","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":"f23c828268d14792cc55b0b3edac67b418ecadb87c4d5131952e8a3ccd2cb4e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-06-04T04:14:06Z","title_canon_sha256":"60939871c8088f8228f8d887dd8a9a102c99b3f4de2e4a00f47e8e9f9b12deb7"},"schema_version":"1.0","source":{"id":"2206.01905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.01905","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"2206.01905v1","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01905","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"DIYASSGTBXLJ","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"DIYASSGTBXLJE27R","created_at":"2026-07-05T04:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"DIYASSGT","created_at":"2026-07-05T04:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:c92464e1cce68565eb9d22dab468d003f680bd38fd5abbe095df66cb5b37d3ca","target":"graph","created_at":"2026-07-05T04:28:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.01905/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Monitoring range queries over moving objects is essential to extensive location-based services. The challenge faced with these location-based services is having to process numerous concurrent range queries over a large volume of moving objects. However, the existing range query processing algorithms are almost centralized based on one single machine, which are hard to address the challenge due to the limited memory and computing resources. To address this issue, we propose a distributed search solution for processing concurrent range queries over moving objects in this work. Firstly, a Distrib","authors_text":"Hui Zhu, Ziqiang Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-06-04T04:14:06Z","title":"Distributed processing of continuous range queries over moving objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01905","kind":"arxiv","version":1},"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:05de98a8d0f182e2528eb2a0084d0481c70cb314d27287ec6c47f3b6213545c7","target":"record","created_at":"2026-07-05T04:28:57Z","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":"f23c828268d14792cc55b0b3edac67b418ecadb87c4d5131952e8a3ccd2cb4e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-06-04T04:14:06Z","title_canon_sha256":"60939871c8088f8228f8d887dd8a9a102c99b3f4de2e4a00f47e8e9f9b12deb7"},"schema_version":"1.0","source":{"id":"2206.01905","kind":"arxiv","version":1}},"canonical_sha256":"1a300948d30dd6926bf1a412e0447dbbf51dae126deb527914e0e658965dd4f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a300948d30dd6926bf1a412e0447dbbf51dae126deb527914e0e658965dd4f6","first_computed_at":"2026-07-05T04:28:57.542475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:28:57.542475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yxkWoDLB/xfFte3rXdZK1NuUpFyV9Gq6AvSIA1/MMbC8Q/ohzQ8RI7+//s3iAj6ywI1pythVDXMmkSkjbC2yCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:28:57.542989Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.01905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05de98a8d0f182e2528eb2a0084d0481c70cb314d27287ec6c47f3b6213545c7","sha256:c92464e1cce68565eb9d22dab468d003f680bd38fd5abbe095df66cb5b37d3ca"],"state_sha256":"399aa8cb72fd20238cea97ea15b9e9a8b2526a3d52d3ebd5b45a582ca99d8cf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhEcmaER0b5bQ1zfuqDvAtCzXAaM5Q3hnaYF0p/KMbX3xNhAWEuACvI2vMoMc1cCHdPvZKxzqyxc+w4HDdjGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T03:24:13.577101Z","bundle_sha256":"228b757c1051c257f9c9b72afb75d4f95f042c1fc3c4091433e797cfb5259633"}}