{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q55XWSWCE6VS6HSBEJ3LXQ3M2U","short_pith_number":"pith:Q55XWSWC","canonical_record":{"source":{"id":"1809.04339","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-09-12T10:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"94bbfc5cced3423a49c661d92976572567a01ef7e04249813ebf6f7729c0775e","abstract_canon_sha256":"743c415dd132affc925c522c32092a59a116a4baf86634c95337c6c01f350fea"},"schema_version":"1.0"},"canonical_sha256":"877b7b4ac227ab2f1e412276bbc36cd5004d8bb09130938c524d328adf29c967","source":{"kind":"arxiv","id":"1809.04339","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04339","created_at":"2026-05-18T00:00:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04339v2","created_at":"2026-05-18T00:00:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04339","created_at":"2026-05-18T00:00:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q55XWSWCE6VS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q55XWSWCE6VS6HSB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q55XWSWC","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q55XWSWCE6VS6HSBEJ3LXQ3M2U","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04339","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-09-12T10:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"94bbfc5cced3423a49c661d92976572567a01ef7e04249813ebf6f7729c0775e","abstract_canon_sha256":"743c415dd132affc925c522c32092a59a116a4baf86634c95337c6c01f350fea"},"schema_version":"1.0"},"canonical_sha256":"877b7b4ac227ab2f1e412276bbc36cd5004d8bb09130938c524d328adf29c967","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:43.054511Z","signature_b64":"1BAUHfsU9W9mX1Qgfv5VeT15QM3KYJUEGR/PJrZqw2JUDjadzomalJ7QQHbB1na4yOM4F4UWtv+0QvZRq9klAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"877b7b4ac227ab2f1e412276bbc36cd5004d8bb09130938c524d328adf29c967","last_reissued_at":"2026-05-18T00:00:43.054093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:43.054093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04339","source_version":2,"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:00:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFCRND7YMSu/C28ZyY8hOH4pEOc8s/wzmIkqIqsx6PUGbG2dTcht+VOsm3vl09rc8qPrgAW3Pytc4EvenyzjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:51:47.197454Z"},"content_sha256":"bb0c90d04193b977d1e9ab7c51068a137ee501dbbba86eaf86a09edaa412b17e","schema_version":"1.0","event_id":"sha256:bb0c90d04193b977d1e9ab7c51068a137ee501dbbba86eaf86a09edaa412b17e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q55XWSWCE6VS6HSBEJ3LXQ3M2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concurrent Robin Hood Hashing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Barak A. Pearlmutter, Phil Maguire, Robert Kelly","submitted_at":"2018-09-12T10:06:41Z","abstract_excerpt":"In this paper we examine the issues involved in adding concurrency to the Robin Hood hash table algorithm. We present a non-blocking obstruction-free K-CAS Robin Hood algorithm which requires only a single word compare-and-swap primitive, thus making it highly portable. The implementation maintains the attractive properties of the original Robin Hood structure, such as a low expected probe length, capability to operate effectively under a high load factor and good cache locality, all of which are essential for high performance on modern computer architectures. We compare our data-structures to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04339","kind":"arxiv","version":2},"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:00:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LuI4z2BKef62VQiE5B9jjZrudYW6WIzwwet6fPk99wFGT+QpAknk5dYj0AbDcqWacWiEza2QjGFsWxfN3pigAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:51:47.197805Z"},"content_sha256":"c7aed9cedcf8617c461af87e12859f85e6b4715d4cd2c74d66348c89f296f0f2","schema_version":"1.0","event_id":"sha256:c7aed9cedcf8617c461af87e12859f85e6b4715d4cd2c74d66348c89f296f0f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U/bundle.json","state_url":"https://pith.science/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U/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-03T16:51:47Z","links":{"resolver":"https://pith.science/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U","bundle":"https://pith.science/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U/bundle.json","state":"https://pith.science/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q55XWSWCE6VS6HSBEJ3LXQ3M2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q55XWSWCE6VS6HSBEJ3LXQ3M2U","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":"743c415dd132affc925c522c32092a59a116a4baf86634c95337c6c01f350fea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-09-12T10:06:41Z","title_canon_sha256":"94bbfc5cced3423a49c661d92976572567a01ef7e04249813ebf6f7729c0775e"},"schema_version":"1.0","source":{"id":"1809.04339","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04339","created_at":"2026-05-18T00:00:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04339v2","created_at":"2026-05-18T00:00:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04339","created_at":"2026-05-18T00:00:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q55XWSWCE6VS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q55XWSWCE6VS6HSB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q55XWSWC","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:c7aed9cedcf8617c461af87e12859f85e6b4715d4cd2c74d66348c89f296f0f2","target":"graph","created_at":"2026-05-18T00:00:43Z","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":"In this paper we examine the issues involved in adding concurrency to the Robin Hood hash table algorithm. We present a non-blocking obstruction-free K-CAS Robin Hood algorithm which requires only a single word compare-and-swap primitive, thus making it highly portable. The implementation maintains the attractive properties of the original Robin Hood structure, such as a low expected probe length, capability to operate effectively under a high load factor and good cache locality, all of which are essential for high performance on modern computer architectures. We compare our data-structures to","authors_text":"Barak A. Pearlmutter, Phil Maguire, Robert Kelly","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-09-12T10:06:41Z","title":"Concurrent Robin Hood Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04339","kind":"arxiv","version":2},"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:bb0c90d04193b977d1e9ab7c51068a137ee501dbbba86eaf86a09edaa412b17e","target":"record","created_at":"2026-05-18T00:00:43Z","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":"743c415dd132affc925c522c32092a59a116a4baf86634c95337c6c01f350fea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-09-12T10:06:41Z","title_canon_sha256":"94bbfc5cced3423a49c661d92976572567a01ef7e04249813ebf6f7729c0775e"},"schema_version":"1.0","source":{"id":"1809.04339","kind":"arxiv","version":2}},"canonical_sha256":"877b7b4ac227ab2f1e412276bbc36cd5004d8bb09130938c524d328adf29c967","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"877b7b4ac227ab2f1e412276bbc36cd5004d8bb09130938c524d328adf29c967","first_computed_at":"2026-05-18T00:00:43.054093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:43.054093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1BAUHfsU9W9mX1Qgfv5VeT15QM3KYJUEGR/PJrZqw2JUDjadzomalJ7QQHbB1na4yOM4F4UWtv+0QvZRq9klAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:43.054511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04339","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb0c90d04193b977d1e9ab7c51068a137ee501dbbba86eaf86a09edaa412b17e","sha256:c7aed9cedcf8617c461af87e12859f85e6b4715d4cd2c74d66348c89f296f0f2"],"state_sha256":"167c6a78107d1b6c948bdb319e91f3094ce4d671c02b0bbd1acf80db9e30c946"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"48BjeXAECZ2BCdZQkqMQ9V6mLa0WqHtUtyJ/Syram76ulNciJessqRv9mMeuOM1O1Q5GKCvzbS7r9OJvOdaCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:51:47.199811Z","bundle_sha256":"42eb74a35c7c08b1a526c09d7140c40df541818604c9aa8ea0801c26c0918b10"}}