{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:623H54TUPCGHSRRYIDDXCTWUMU","short_pith_number":"pith:623H54TU","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"},"canonical_sha256":"f6b67ef274788c79463840c7714ed4651ef86fc137b06b845d85048bda44520a","source":{"kind":"arxiv","id":"1712.09636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09636","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09636v1","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09636","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"623H54TUPCGH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"623H54TUPCGHSRRY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"623H54TU","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:623H54TUPCGHSRRYIDDXCTWUMU","target":"record","payload":{"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"},"canonical_sha256":"f6b67ef274788c79463840c7714ed4651ef86fc137b06b845d85048bda44520a","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"},"source_kind":"arxiv","source_id":"1712.09636","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-18T00:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eE9EvoPoBOD5MwQLUg527YIGUvmbLJifBx2UF4Vf1DJfYB4RnkJRsYSJPuLm/JSssuLZvS3JECk7pRG/bwyKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:12:16.638468Z"},"content_sha256":"12292c2e3c689dec9e8f0f27df050483392a68204f74e9835dda3c8f55f49cef","schema_version":"1.0","event_id":"sha256:12292c2e3c689dec9e8f0f27df050483392a68204f74e9835dda3c8f55f49cef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:623H54TUPCGHSRRYIDDXCTWUMU","target":"graph","payload":{"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"},"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-18T00:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xDsge5aKOy7MoqwDazBcUUZtunXj0W6hOCFHg9o9031NRaLStzpXh1GXhs9ys4OfmG4PpDShhlaHA3V+cT2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:12:16.638812Z"},"content_sha256":"21b835b3dce7f8810f14333786fa5f81793747555eb5b544e0cb8b5e637bd08f","schema_version":"1.0","event_id":"sha256:21b835b3dce7f8810f14333786fa5f81793747555eb5b544e0cb8b5e637bd08f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/bundle.json","state_url":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/623H54TUPCGHSRRYIDDXCTWUMU/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-06-27T20:12:16Z","links":{"resolver":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU","bundle":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/bundle.json","state":"https://pith.science/pith/623H54TUPCGHSRRYIDDXCTWUMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/623H54TUPCGHSRRYIDDXCTWUMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:623H54TUPCGHSRRYIDDXCTWUMU","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":"1ea006f80ad0f416caa8c7f43d0cc6b5b8ae1282ecd2c4439c9dc8a7e5f0a4d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-27T17:25:07Z","title_canon_sha256":"9399c817c774c5284dbdcc5b2f0aa02446444ea04d21804e7867fe5aa9b23964"},"schema_version":"1.0","source":{"id":"1712.09636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09636","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09636v1","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09636","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"623H54TUPCGH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"623H54TUPCGHSRRY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"623H54TU","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:21b835b3dce7f8810f14333786fa5f81793747555eb5b544e0cb8b5e637bd08f","target":"graph","created_at":"2026-05-18T00:27:07Z","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":"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).","authors_text":"Aleksandar Prokopec","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-27T17:25:07Z","title":"Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09636","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:12292c2e3c689dec9e8f0f27df050483392a68204f74e9835dda3c8f55f49cef","target":"record","created_at":"2026-05-18T00:27:07Z","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":"1ea006f80ad0f416caa8c7f43d0cc6b5b8ae1282ecd2c4439c9dc8a7e5f0a4d5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-27T17:25:07Z","title_canon_sha256":"9399c817c774c5284dbdcc5b2f0aa02446444ea04d21804e7867fe5aa9b23964"},"schema_version":"1.0","source":{"id":"1712.09636","kind":"arxiv","version":1}},"canonical_sha256":"f6b67ef274788c79463840c7714ed4651ef86fc137b06b845d85048bda44520a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6b67ef274788c79463840c7714ed4651ef86fc137b06b845d85048bda44520a","first_computed_at":"2026-05-18T00:27:07.753472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:07.753472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I6fgXhIB2HAdnQ1DP/zBdOZMje50o1DDRJlXbS2SJnXP387yZQnhFLAo6Zka9ljoEPIp4MGs51UFRjurn8yoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:07.754028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12292c2e3c689dec9e8f0f27df050483392a68204f74e9835dda3c8f55f49cef","sha256:21b835b3dce7f8810f14333786fa5f81793747555eb5b544e0cb8b5e637bd08f"],"state_sha256":"34ef4016c0faf4c455059c10f8567e05b8b120e85ab3c95f05e0a6ef4cc5e214"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Rf162UXbN9yKdu059ZjY4yFCOvl2ETe8s4h/vMxaRyNtdPvLcVmUzKWUvIakP0Mpzv+800Vp0J+JTNLYfsWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:12:16.640778Z","bundle_sha256":"4b40245cb54d10e1e9d8265b8999aa458ab8828e87e22693876a1ea76d58efdf"}}