{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BELIWF2D3A4MGUBZUF6BZLZTZF","short_pith_number":"pith:BELIWF2D","canonical_record":{"source":{"id":"1305.3407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-15T09:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"c8bb5d4181a6ea3f591cdaf7482dad632e17a2f5ca3f654c63ec54a499384f22","abstract_canon_sha256":"1aa2bf773a275bcf7a19e23b1d7cb2d93c0a6b1bc7e64c023f0178145e8ae876"},"schema_version":"1.0"},"canonical_sha256":"09168b1743d838c35039a17c1caf33c950e3cb2ca8c742c12e462b079d1f5053","source":{"kind":"arxiv","id":"1305.3407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3407","created_at":"2026-05-18T03:01:46Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3407v2","created_at":"2026-05-18T03:01:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3407","created_at":"2026-05-18T03:01:46Z"},{"alias_kind":"pith_short_12","alias_value":"BELIWF2D3A4M","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BELIWF2D3A4MGUBZ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BELIWF2D","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BELIWF2D3A4MGUBZUF6BZLZTZF","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-15T09:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"c8bb5d4181a6ea3f591cdaf7482dad632e17a2f5ca3f654c63ec54a499384f22","abstract_canon_sha256":"1aa2bf773a275bcf7a19e23b1d7cb2d93c0a6b1bc7e64c023f0178145e8ae876"},"schema_version":"1.0"},"canonical_sha256":"09168b1743d838c35039a17c1caf33c950e3cb2ca8c742c12e462b079d1f5053","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:46.538808Z","signature_b64":"19tle9avVMXC7lcI5lSZTVV/dzEb1ZV1dQA2bWIqMi/usj9ruGtw9Wo4DFE1BBsCApzUNTuneRmD0ZpKjCOpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09168b1743d838c35039a17c1caf33c950e3cb2ca8c742c12e462b079d1f5053","last_reissued_at":"2026-05-18T03:01:46.538389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:46.538389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3407","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-18T03:01:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewS6ZZM3ceAMBQC3kBOu0NPKL6FswmR7S+erVKk67l/WQNcdErkS8UgEkUmMBWvQHIjKbQKb7YPQVUtrsPxGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:08:10.046225Z"},"content_sha256":"abeaf406f772686fc1733f0d74c79925c99f76bee1e8e50988ed8bc5c6e6dbff","schema_version":"1.0","event_id":"sha256:abeaf406f772686fc1733f0d74c79925c99f76bee1e8e50988ed8bc5c6e6dbff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BELIWF2D3A4MGUBZUF6BZLZTZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Z\\\"ufle, Hans-Peter Kriegel, Johannes Niedermayer, Lei Chen, Matthias Renz, Nikos Mamoulis, Tobias Emrich","submitted_at":"2013-05-15T09:54:58Z","abstract_excerpt":"Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their application in spatio-temporal data analysis. Recent work has considered the realistic case where the trajectories are uncertain; however, only simple uncertainty models have been proposed, which do not allow for accurate probabilistic search. In this paper, we fill this gap by addressing probabilistic nearest neighbor queries in databases with uncertain trajectories modeled by stochastic processes, specifically the Markov chain model. We study three nearest neighbor query semant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3407","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-18T03:01:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtyLdvlh/uMYkZBHJ2AYO0e1yfso71c1YItF51kY6UdZ0NMUs7i1tNlGAo4WonbQubquzXLoC77mHz1f9YFRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:08:10.046663Z"},"content_sha256":"b4a72fceee933b383bb853b94856c6f1686311829c6d80b99e8e3115da2cf673","schema_version":"1.0","event_id":"sha256:b4a72fceee933b383bb853b94856c6f1686311829c6d80b99e8e3115da2cf673"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BELIWF2D3A4MGUBZUF6BZLZTZF/bundle.json","state_url":"https://pith.science/pith/BELIWF2D3A4MGUBZUF6BZLZTZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BELIWF2D3A4MGUBZUF6BZLZTZF/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-02T19:08:10Z","links":{"resolver":"https://pith.science/pith/BELIWF2D3A4MGUBZUF6BZLZTZF","bundle":"https://pith.science/pith/BELIWF2D3A4MGUBZUF6BZLZTZF/bundle.json","state":"https://pith.science/pith/BELIWF2D3A4MGUBZUF6BZLZTZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BELIWF2D3A4MGUBZUF6BZLZTZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BELIWF2D3A4MGUBZUF6BZLZTZF","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":"1aa2bf773a275bcf7a19e23b1d7cb2d93c0a6b1bc7e64c023f0178145e8ae876","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-15T09:54:58Z","title_canon_sha256":"c8bb5d4181a6ea3f591cdaf7482dad632e17a2f5ca3f654c63ec54a499384f22"},"schema_version":"1.0","source":{"id":"1305.3407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3407","created_at":"2026-05-18T03:01:46Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3407v2","created_at":"2026-05-18T03:01:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3407","created_at":"2026-05-18T03:01:46Z"},{"alias_kind":"pith_short_12","alias_value":"BELIWF2D3A4M","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BELIWF2D3A4MGUBZ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BELIWF2D","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:b4a72fceee933b383bb853b94856c6f1686311829c6d80b99e8e3115da2cf673","target":"graph","created_at":"2026-05-18T03:01:46Z","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":"Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their application in spatio-temporal data analysis. Recent work has considered the realistic case where the trajectories are uncertain; however, only simple uncertainty models have been proposed, which do not allow for accurate probabilistic search. In this paper, we fill this gap by addressing probabilistic nearest neighbor queries in databases with uncertain trajectories modeled by stochastic processes, specifically the Markov chain model. We study three nearest neighbor query semant","authors_text":"Andreas Z\\\"ufle, Hans-Peter Kriegel, Johannes Niedermayer, Lei Chen, Matthias Renz, Nikos Mamoulis, Tobias Emrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-15T09:54:58Z","title":"Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3407","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:abeaf406f772686fc1733f0d74c79925c99f76bee1e8e50988ed8bc5c6e6dbff","target":"record","created_at":"2026-05-18T03:01:46Z","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":"1aa2bf773a275bcf7a19e23b1d7cb2d93c0a6b1bc7e64c023f0178145e8ae876","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-15T09:54:58Z","title_canon_sha256":"c8bb5d4181a6ea3f591cdaf7482dad632e17a2f5ca3f654c63ec54a499384f22"},"schema_version":"1.0","source":{"id":"1305.3407","kind":"arxiv","version":2}},"canonical_sha256":"09168b1743d838c35039a17c1caf33c950e3cb2ca8c742c12e462b079d1f5053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09168b1743d838c35039a17c1caf33c950e3cb2ca8c742c12e462b079d1f5053","first_computed_at":"2026-05-18T03:01:46.538389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:46.538389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"19tle9avVMXC7lcI5lSZTVV/dzEb1ZV1dQA2bWIqMi/usj9ruGtw9Wo4DFE1BBsCApzUNTuneRmD0ZpKjCOpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:46.538808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abeaf406f772686fc1733f0d74c79925c99f76bee1e8e50988ed8bc5c6e6dbff","sha256:b4a72fceee933b383bb853b94856c6f1686311829c6d80b99e8e3115da2cf673"],"state_sha256":"96b76ee1e76ed7832d9cd7f2b9209253bbf9eadd8a5d95b89c8697b1b2ac4216"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Uvp6Y31bf8JE18mr2KM8MmWY8kFezJaHG8YkkulVGW26yaXrkXozlewGMsDfCELiwZZynFSznVzy4o64UVGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:08:10.049391Z","bundle_sha256":"9e4cf83441c7fd15718953fd7d025038db1ea7ef32c879180d97467c40893d92"}}