{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E2ZHGDTY3ISRADUP3E2MG2V7HK","short_pith_number":"pith:E2ZHGDTY","schema_version":"1.0","canonical_sha256":"26b2730e78da25100e8fd934c36abf3a86f8f0a51040878eef6fa78d2a64bbc8","source":{"kind":"arxiv","id":"1712.05101","version":1},"attestation_state":"computed","paper":{"title":"Range Queries in Non-blocking $k$-ary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hillel Avni, Trevor Brown","submitted_at":"2017-12-14T06:09:04Z","abstract_excerpt":"We present a linearizable, non-blocking $k$-ary search tree ($k$-ST) that supports fast searches and range queries. Our algorithm uses single-word compare-and-swap (CAS) operations, and tolerates any number of crash failures. Performance experiments show that, for workloads containing small range queries, our $k$-ST significantly outperforms other algorithms which support these operations, and rivals the performance of a leading concurrent skip-list, which provides range queries that cannot always be linearized."},"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":"1712.05101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-14T06:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"35445937830072643fe618910833be8ec4b9cd9816158f945806348a37ffc0e5","abstract_canon_sha256":"d3aaafd005023b916703691c52a0cdb5d9763f84fa575e3382c9644da820e7a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:01.035595Z","signature_b64":"4lNwVhxTQa8ghQ0bHCJE06nXmfBKAFh/LpQMZANxHCp+Qu6IURfO1my7e/59Y40kKRKLUfmZ9Am7mf/yHbWgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b2730e78da25100e8fd934c36abf3a86f8f0a51040878eef6fa78d2a64bbc8","last_reissued_at":"2026-05-18T00:28:01.034807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:01.034807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Range Queries in Non-blocking $k$-ary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hillel Avni, Trevor Brown","submitted_at":"2017-12-14T06:09:04Z","abstract_excerpt":"We present a linearizable, non-blocking $k$-ary search tree ($k$-ST) that supports fast searches and range queries. Our algorithm uses single-word compare-and-swap (CAS) operations, and tolerates any number of crash failures. Performance experiments show that, for workloads containing small range queries, our $k$-ST significantly outperforms other algorithms which support these operations, and rivals the performance of a leading concurrent skip-list, which provides range queries that cannot always be linearized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05101","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":"1712.05101","created_at":"2026-05-18T00:28:01.034928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05101v1","created_at":"2026-05-18T00:28:01.034928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05101","created_at":"2026-05-18T00:28:01.034928+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2ZHGDTY3ISR","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2ZHGDTY3ISRADUP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2ZHGDTY","created_at":"2026-05-18T12:31:12.930513+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/E2ZHGDTY3ISRADUP3E2MG2V7HK","json":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK.json","graph_json":"https://pith.science/api/pith-number/E2ZHGDTY3ISRADUP3E2MG2V7HK/graph.json","events_json":"https://pith.science/api/pith-number/E2ZHGDTY3ISRADUP3E2MG2V7HK/events.json","paper":"https://pith.science/paper/E2ZHGDTY"},"agent_actions":{"view_html":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK","download_json":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK.json","view_paper":"https://pith.science/paper/E2ZHGDTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05101&json=true","fetch_graph":"https://pith.science/api/pith-number/E2ZHGDTY3ISRADUP3E2MG2V7HK/graph.json","fetch_events":"https://pith.science/api/pith-number/E2ZHGDTY3ISRADUP3E2MG2V7HK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK/action/storage_attestation","attest_author":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK/action/author_attestation","sign_citation":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK/action/citation_signature","submit_replication":"https://pith.science/pith/E2ZHGDTY3ISRADUP3E2MG2V7HK/action/replication_record"}},"created_at":"2026-05-18T00:28:01.034928+00:00","updated_at":"2026-05-18T00:28:01.034928+00:00"}