{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:623H54TUPCGHSRRYIDDXCTWUMU","short_pith_number":"pith:623H54TU","schema_version":"1.0","canonical_sha256":"f6b67ef274788c79463840c7714ed4651ef86fc137b06b845d85048bda44520a","source":{"kind":"arxiv","id":"1712.09636","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandar Prokopec","submitted_at":"2017-12-27T17:25:07Z","abstract_excerpt":"Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable iterators. However, operations on most existing concurrent hash tries run in O(log n) time. In this technical report, we extend the standard concurrent hash-tries with an auxiliary data structure called a cache. The cache is essentially an array that stores pointers to a specific level of the hash trie. We analyze the performance implications of adding a cache, and prove that the running time of the basic operations becomes O(1)."},"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.09636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-27T17:25:07Z","cross_cats_sorted":[],"title_canon_sha256":"9399c817c774c5284dbdcc5b2f0aa02446444ea04d21804e7867fe5aa9b23964","abstract_canon_sha256":"1ea006f80ad0f416caa8c7f43d0cc6b5b8ae1282ecd2c4439c9dc8a7e5f0a4d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:07.754028Z","signature_b64":"I6fgXhIB2HAdnQ1DP/zBdOZMje50o1DDRJlXbS2SJnXP387yZQnhFLAo6Zka9ljoEPIp4MGs51UFRjurn8yoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6b67ef274788c79463840c7714ed4651ef86fc137b06b845d85048bda44520a","last_reissued_at":"2026-05-18T00:27:07.753472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:07.753472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandar Prokopec","submitted_at":"2017-12-27T17:25:07Z","abstract_excerpt":"Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable iterators. However, operations on most existing concurrent hash tries run in O(log n) time. In this technical report, we extend the standard concurrent hash-tries with an auxiliary data structure called a cache. The cache is essentially an array that stores pointers to a specific level of the hash trie. We analyze the performance implications of adding a cache, and prove that the running time of the basic operations becomes O(1)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09636","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.09636","created_at":"2026-05-18T00:27:07.753549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09636v1","created_at":"2026-05-18T00:27:07.753549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09636","created_at":"2026-05-18T00:27:07.753549+00:00"},{"alias_kind":"pith_short_12","alias_value":"623H54TUPCGH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"623H54TUPCGHSRRY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"623H54TU","created_at":"2026-05-18T12:31:03.183658+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/623H54TUPCGHSRRYIDDXCTWUMU","json":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU.json","graph_json":"https://pith.science/api/pith-number/623H54TUPCGHSRRYIDDXCTWUMU/graph.json","events_json":"https://pith.science/api/pith-number/623H54TUPCGHSRRYIDDXCTWUMU/events.json","paper":"https://pith.science/paper/623H54TU"},"agent_actions":{"view_html":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU","download_json":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU.json","view_paper":"https://pith.science/paper/623H54TU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09636&json=true","fetch_graph":"https://pith.science/api/pith-number/623H54TUPCGHSRRYIDDXCTWUMU/graph.json","fetch_events":"https://pith.science/api/pith-number/623H54TUPCGHSRRYIDDXCTWUMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/action/storage_attestation","attest_author":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/action/author_attestation","sign_citation":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/action/citation_signature","submit_replication":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/action/replication_record"}},"created_at":"2026-05-18T00:27:07.753549+00:00","updated_at":"2026-05-18T00:27:07.753549+00:00"}