{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KJJOCPHPVCDHLCC243CTKIBYEN","short_pith_number":"pith:KJJOCPHP","schema_version":"1.0","canonical_sha256":"5252e13cefa88675885ae6c5352038235fc6674dd0e0e45bfee43ab07aaa1488","source":{"kind":"arxiv","id":"2004.02335","version":1},"attestation_state":"computed","paper":{"title":"The n-dimensional k-vector and its application to orthogonal range searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Leake, Daniele Mortari, David Arnas","submitted_at":"2020-04-05T22:26:05Z","abstract_excerpt":"This work focuses on the definition and study of the n-dimensional k-vector, an algorithm devised to perform orthogonal range searching in static databases with multiple dimensions. The methodology first finds the order in which to search the dimensions, and then, performs the search using a modified projection method. In order to determine the dimension order, the algorithm uses the k-vector, a range searching technique for one dimension that identifies the number of elements contained in the searching range. Then, using this information, the algorithm predicts and selects the best approach t"},"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":"2004.02335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-05T22:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"43bdfc99d2cd8eb9bd87e8427524a9154a85144bf09243d32942bd3af5354254","abstract_canon_sha256":"faa72d98665ba8dfe6e46528c9bc01613ba17d6e4479a5da9883e375e4232642"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:57.967707Z","signature_b64":"7P1N/f1N+vtQxu6M1dQBaiFZXcwNnzNOIG0kRzgnStvNXZdSO9B9HAQrLFtEBDj1zs70lj19h3KltXMyiUZRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5252e13cefa88675885ae6c5352038235fc6674dd0e0e45bfee43ab07aaa1488","last_reissued_at":"2026-07-05T00:52:57.967234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:57.967234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The n-dimensional k-vector and its application to orthogonal range searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Leake, Daniele Mortari, David Arnas","submitted_at":"2020-04-05T22:26:05Z","abstract_excerpt":"This work focuses on the definition and study of the n-dimensional k-vector, an algorithm devised to perform orthogonal range searching in static databases with multiple dimensions. The methodology first finds the order in which to search the dimensions, and then, performs the search using a modified projection method. In order to determine the dimension order, the algorithm uses the k-vector, a range searching technique for one dimension that identifies the number of elements contained in the searching range. Then, using this information, the algorithm predicts and selects the best approach t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02335","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/2004.02335/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.02335","created_at":"2026-07-05T00:52:57.967286+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.02335v1","created_at":"2026-07-05T00:52:57.967286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02335","created_at":"2026-07-05T00:52:57.967286+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJJOCPHPVCDH","created_at":"2026-07-05T00:52:57.967286+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJJOCPHPVCDHLCC2","created_at":"2026-07-05T00:52:57.967286+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJJOCPHP","created_at":"2026-07-05T00:52:57.967286+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/KJJOCPHPVCDHLCC243CTKIBYEN","json":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN.json","graph_json":"https://pith.science/api/pith-number/KJJOCPHPVCDHLCC243CTKIBYEN/graph.json","events_json":"https://pith.science/api/pith-number/KJJOCPHPVCDHLCC243CTKIBYEN/events.json","paper":"https://pith.science/paper/KJJOCPHP"},"agent_actions":{"view_html":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN","download_json":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN.json","view_paper":"https://pith.science/paper/KJJOCPHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.02335&json=true","fetch_graph":"https://pith.science/api/pith-number/KJJOCPHPVCDHLCC243CTKIBYEN/graph.json","fetch_events":"https://pith.science/api/pith-number/KJJOCPHPVCDHLCC243CTKIBYEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN/action/storage_attestation","attest_author":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN/action/author_attestation","sign_citation":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN/action/citation_signature","submit_replication":"https://pith.science/pith/KJJOCPHPVCDHLCC243CTKIBYEN/action/replication_record"}},"created_at":"2026-07-05T00:52:57.967286+00:00","updated_at":"2026-07-05T00:52:57.967286+00:00"}