{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F24A56VINARQPL4FYCUQKTTNIF","short_pith_number":"pith:F24A56VI","schema_version":"1.0","canonical_sha256":"2eb80efaa8682307af85c0a9054e6d416ad8d3c4e42af89574f0c0df043241ab","source":{"kind":"arxiv","id":"1611.05247","version":1},"attestation_state":"computed","paper":{"title":"A new method to index and store spatio-temporal data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adri\\'an G\\'omez-Brand\\'on, Guillermo De Bernardo, Jos\\'e R. Param\\'a, Ram\\'on Casares","submitted_at":"2016-11-16T12:19:38Z","abstract_excerpt":"We propose a data structure that stores, in a compressed way, object trajectories, which at the same time, allow to efficiently response queries without the need to decompress the data. We use a data structure, called $k^{2}$-tree, to store the full position of all objects at regular time intervals. For storing the positions of objects between two time instants represented with $k^{2}$-trees, we only encode the relative movements. In order to save space, those relative moments are encoded with only one integer, instead of two (x,y)-coordinates. Moreover, the resulting integers are further comp"},"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":"1611.05247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-16T12:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"4bc23406a887a31d0bb84f69913d89d2dc93fd2ef48b95b589fec38ccbfe5add","abstract_canon_sha256":"c0e4baa920e2f2fe62acba0c66e6c91a81f4dd5e6ad2af97b4858f7b821ea366"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:03.512767Z","signature_b64":"wvmJ5i6a2IP9h2Ae5ZMVqUIaQowtgS35gFUO7D7+aHYZbFdg9nFUeLXdeaV/YSAFOfognjZ3o4cGCf/VbTMWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb80efaa8682307af85c0a9054e6d416ad8d3c4e42af89574f0c0df043241ab","last_reissued_at":"2026-05-18T00:58:03.512150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:03.512150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new method to index and store spatio-temporal data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adri\\'an G\\'omez-Brand\\'on, Guillermo De Bernardo, Jos\\'e R. Param\\'a, Ram\\'on Casares","submitted_at":"2016-11-16T12:19:38Z","abstract_excerpt":"We propose a data structure that stores, in a compressed way, object trajectories, which at the same time, allow to efficiently response queries without the need to decompress the data. We use a data structure, called $k^{2}$-tree, to store the full position of all objects at regular time intervals. For storing the positions of objects between two time instants represented with $k^{2}$-trees, we only encode the relative movements. In order to save space, those relative moments are encoded with only one integer, instead of two (x,y)-coordinates. Moreover, the resulting integers are further comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05247","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.05247","created_at":"2026-05-18T00:58:03.512237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05247v1","created_at":"2026-05-18T00:58:03.512237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05247","created_at":"2026-05-18T00:58:03.512237+00:00"},{"alias_kind":"pith_short_12","alias_value":"F24A56VINARQ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F24A56VINARQPL4F","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F24A56VI","created_at":"2026-05-18T12:30:15.759754+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/F24A56VINARQPL4FYCUQKTTNIF","json":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF.json","graph_json":"https://pith.science/api/pith-number/F24A56VINARQPL4FYCUQKTTNIF/graph.json","events_json":"https://pith.science/api/pith-number/F24A56VINARQPL4FYCUQKTTNIF/events.json","paper":"https://pith.science/paper/F24A56VI"},"agent_actions":{"view_html":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF","download_json":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF.json","view_paper":"https://pith.science/paper/F24A56VI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05247&json=true","fetch_graph":"https://pith.science/api/pith-number/F24A56VINARQPL4FYCUQKTTNIF/graph.json","fetch_events":"https://pith.science/api/pith-number/F24A56VINARQPL4FYCUQKTTNIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF/action/storage_attestation","attest_author":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF/action/author_attestation","sign_citation":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF/action/citation_signature","submit_replication":"https://pith.science/pith/F24A56VINARQPL4FYCUQKTTNIF/action/replication_record"}},"created_at":"2026-05-18T00:58:03.512237+00:00","updated_at":"2026-05-18T00:58:03.512237+00:00"}