{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:USWBOTH2GYQFIUYN6XOTFMS6NN","short_pith_number":"pith:USWBOTH2","canonical_record":{"source":{"id":"1412.6170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-18T22:43:28Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"fd186c5e14edec5b530fa3320fd3349c0fdcf2ae622b8e3084300298cb0a8e1c","abstract_canon_sha256":"0b6625d390878f0afa571646554738d3714f7e414270b3e89257e8e42dca0198"},"schema_version":"1.0"},"canonical_sha256":"a4ac174cfa362054530df5dd32b25e6b483b489d4bc4057ea1cf815bce80fee0","source":{"kind":"arxiv","id":"1412.6170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6170","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6170v1","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6170","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"USWBOTH2GYQF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"USWBOTH2GYQFIUYN","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"USWBOTH2","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:USWBOTH2GYQFIUYN6XOTFMS6NN","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-18T22:43:28Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"fd186c5e14edec5b530fa3320fd3349c0fdcf2ae622b8e3084300298cb0a8e1c","abstract_canon_sha256":"0b6625d390878f0afa571646554738d3714f7e414270b3e89257e8e42dca0198"},"schema_version":"1.0"},"canonical_sha256":"a4ac174cfa362054530df5dd32b25e6b483b489d4bc4057ea1cf815bce80fee0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.181669Z","signature_b64":"W5eiVT0pP9bcbr1juxuFncOOYhHIEHG+cUl2XIO3PojErSCwQuiK+FhyF0EU3BMUg94W9GPCYej6g2loUVHAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ac174cfa362054530df5dd32b25e6b483b489d4bc4057ea1cf815bce80fee0","last_reissued_at":"2026-05-18T02:30:54.181029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.181029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6170","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-05-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gss8rbJd62BpMW16bGNASCAVhFmp0ZjOWyZ8V7+jEB3vYOud4RdliW0iCUCwGJMX+1SrLorCi+TYo+gqU7kRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:15:07.132717Z"},"content_sha256":"8f3b1da07491f297e81820cca98be99deff8142dab177acda9aaa082459d3174","schema_version":"1.0","event_id":"sha256:8f3b1da07491f297e81820cca98be99deff8142dab177acda9aaa082459d3174"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:USWBOTH2GYQFIUYN6XOTFMS6NN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Manycore processing of repeated k-NN queries over massive moving objects observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.DC","authors_text":"Claudio Silvestri, Francesco Lettich, Salvatore Orlando","submitted_at":"2014-12-18T22:43:28Z","abstract_excerpt":"The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. In this paper we focus on a specific data-intensive problem concerning the repeated processing of huge amounts of k nearest neighbours (k-NN) queries over massive sets of moving objects, where the spatial extents of queries and the position of objects are continuously modified over time. In particular, we propose a novel hybrid CPU/GPU pipeline that significantly accelerate query processing thanks to a combination of ad-hoc data structures and non-trivia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6170","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":""},"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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLaR9VEXljrXXwzgfABNQFiNdJA80Ic73/OKE6C79MyLDwgfh0QlArSRMoFH2/oIpkz9G+Z/PRSEpMYM08blBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:15:07.133060Z"},"content_sha256":"13ff1dc1b7beef4a061f8a905465701a242057531cd0d3b66a91af0d4421420d","schema_version":"1.0","event_id":"sha256:13ff1dc1b7beef4a061f8a905465701a242057531cd0d3b66a91af0d4421420d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USWBOTH2GYQFIUYN6XOTFMS6NN/bundle.json","state_url":"https://pith.science/pith/USWBOTH2GYQFIUYN6XOTFMS6NN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USWBOTH2GYQFIUYN6XOTFMS6NN/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-05-30T06:15:07Z","links":{"resolver":"https://pith.science/pith/USWBOTH2GYQFIUYN6XOTFMS6NN","bundle":"https://pith.science/pith/USWBOTH2GYQFIUYN6XOTFMS6NN/bundle.json","state":"https://pith.science/pith/USWBOTH2GYQFIUYN6XOTFMS6NN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USWBOTH2GYQFIUYN6XOTFMS6NN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:USWBOTH2GYQFIUYN6XOTFMS6NN","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":"0b6625d390878f0afa571646554738d3714f7e414270b3e89257e8e42dca0198","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-18T22:43:28Z","title_canon_sha256":"fd186c5e14edec5b530fa3320fd3349c0fdcf2ae622b8e3084300298cb0a8e1c"},"schema_version":"1.0","source":{"id":"1412.6170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6170","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6170v1","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6170","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"USWBOTH2GYQF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"USWBOTH2GYQFIUYN","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"USWBOTH2","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:13ff1dc1b7beef4a061f8a905465701a242057531cd0d3b66a91af0d4421420d","target":"graph","created_at":"2026-05-18T02:30:54Z","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":"The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. In this paper we focus on a specific data-intensive problem concerning the repeated processing of huge amounts of k nearest neighbours (k-NN) queries over massive sets of moving objects, where the spatial extents of queries and the position of objects are continuously modified over time. In particular, we propose a novel hybrid CPU/GPU pipeline that significantly accelerate query processing thanks to a combination of ad-hoc data structures and non-trivia","authors_text":"Claudio Silvestri, Francesco Lettich, Salvatore Orlando","cross_cats":["cs.DB","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-18T22:43:28Z","title":"Manycore processing of repeated k-NN queries over massive moving objects observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6170","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:8f3b1da07491f297e81820cca98be99deff8142dab177acda9aaa082459d3174","target":"record","created_at":"2026-05-18T02:30:54Z","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":"0b6625d390878f0afa571646554738d3714f7e414270b3e89257e8e42dca0198","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-18T22:43:28Z","title_canon_sha256":"fd186c5e14edec5b530fa3320fd3349c0fdcf2ae622b8e3084300298cb0a8e1c"},"schema_version":"1.0","source":{"id":"1412.6170","kind":"arxiv","version":1}},"canonical_sha256":"a4ac174cfa362054530df5dd32b25e6b483b489d4bc4057ea1cf815bce80fee0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4ac174cfa362054530df5dd32b25e6b483b489d4bc4057ea1cf815bce80fee0","first_computed_at":"2026-05-18T02:30:54.181029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:54.181029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W5eiVT0pP9bcbr1juxuFncOOYhHIEHG+cUl2XIO3PojErSCwQuiK+FhyF0EU3BMUg94W9GPCYej6g2loUVHAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:54.181669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f3b1da07491f297e81820cca98be99deff8142dab177acda9aaa082459d3174","sha256:13ff1dc1b7beef4a061f8a905465701a242057531cd0d3b66a91af0d4421420d"],"state_sha256":"8f9cd63bbb7d43751540b40a7b30382565d39fc00f3c95ec38199ab1a247a9e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yzXdIbnwJYWrQoybONZXH3DdxLeEbc3UjpUAOx/iayThl3O3U9ht9WdUVqWtth0g6sFmombEiXWgXsytOYaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:15:07.135019Z","bundle_sha256":"092ee8929cab11a262e397c52536553b4415797fd3e5e768d1b9ea6daca0dec3"}}