{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HENW3R7ELK3MX6II7HDBXPJTN4","short_pith_number":"pith:HENW3R7E","canonical_record":{"source":{"id":"1405.5461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-21T15:57:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a4dc3ed4ec84498e0735fd9ee49a20268c453766a8edb35e5e0da49fe4dc5deb","abstract_canon_sha256":"ff713a5c4836c933dd89abca294702ae3bf1923f86906cbb4629ec9f00bf3054"},"schema_version":"1.0"},"canonical_sha256":"391b6dc7e45ab6cbf908f9c61bbd336f1efd78d743f43c17a87a8544d245891e","source":{"kind":"arxiv","id":"1405.5461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5461","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5461v1","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5461","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"HENW3R7ELK3M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HENW3R7ELK3MX6II","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HENW3R7E","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HENW3R7ELK3MX6II7HDBXPJTN4","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-21T15:57:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a4dc3ed4ec84498e0735fd9ee49a20268c453766a8edb35e5e0da49fe4dc5deb","abstract_canon_sha256":"ff713a5c4836c933dd89abca294702ae3bf1923f86906cbb4629ec9f00bf3054"},"schema_version":"1.0"},"canonical_sha256":"391b6dc7e45ab6cbf908f9c61bbd336f1efd78d743f43c17a87a8544d245891e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:23.930076Z","signature_b64":"Os0KpdSZ2Sm5pzh7A/wT0C3sVcfZKrQDWn4djqRh6rDADKEiARLeycRpJvBv6qDVUMb9hAneIN7TNnm/FTzCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"391b6dc7e45ab6cbf908f9c61bbd336f1efd78d743f43c17a87a8544d245891e","last_reissued_at":"2026-05-18T02:51:23.929587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:23.929587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5461","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-18T02:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6bykvFjjI4FPrh5AVkPDNu4+G4C04Ilvnu+xyiaWNcG94QxkxX5UWjqras2LSpL+CQzDIkGAp0LOuReWXCsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:33:35.228961Z"},"content_sha256":"238b7d6ee0bdbba5b4a9eb05add02329528c10ecd1ded6daaaaf3fd0c33e2a47","schema_version":"1.0","event_id":"sha256:238b7d6ee0bdbba5b4a9eb05add02329528c10ecd1ded6daaaaf3fd0c33e2a47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HENW3R7ELK3MX6II7HDBXPJTN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexander Matveev, Dan Alistarh, Justin Kopinsky, Nir Shavit","submitted_at":"2014-05-21T15:57:58Z","abstract_excerpt":"The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations scan the set of currently registered threads. Instances of this problem show up in concurrent implementations of transactional memory, flat combining, thread barriers, and memory reclamation schemes for lock-free data structures. In this paper, we analyze a randomized solution for long-lived renaming. The algorithmic technique we consider, called the LevelArray, has previously been used for hashing and one-shot (sin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5461","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-18T02:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wn0asQBOacrWtbU5oAMZgv79x/Gj5xU6RHffRzNtqMQLeGoKs9VoDTRAF17NaptU4Tx7ZD+8WFgsKvH03Kf5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:33:35.229309Z"},"content_sha256":"c8e8f63c95585be9665e6fef080259ab42b6fc2002f884eee9562ba75c1ca7da","schema_version":"1.0","event_id":"sha256:c8e8f63c95585be9665e6fef080259ab42b6fc2002f884eee9562ba75c1ca7da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HENW3R7ELK3MX6II7HDBXPJTN4/bundle.json","state_url":"https://pith.science/pith/HENW3R7ELK3MX6II7HDBXPJTN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HENW3R7ELK3MX6II7HDBXPJTN4/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-03T22:33:35Z","links":{"resolver":"https://pith.science/pith/HENW3R7ELK3MX6II7HDBXPJTN4","bundle":"https://pith.science/pith/HENW3R7ELK3MX6II7HDBXPJTN4/bundle.json","state":"https://pith.science/pith/HENW3R7ELK3MX6II7HDBXPJTN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HENW3R7ELK3MX6II7HDBXPJTN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HENW3R7ELK3MX6II7HDBXPJTN4","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":"ff713a5c4836c933dd89abca294702ae3bf1923f86906cbb4629ec9f00bf3054","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-21T15:57:58Z","title_canon_sha256":"a4dc3ed4ec84498e0735fd9ee49a20268c453766a8edb35e5e0da49fe4dc5deb"},"schema_version":"1.0","source":{"id":"1405.5461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5461","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5461v1","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5461","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"HENW3R7ELK3M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HENW3R7ELK3MX6II","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HENW3R7E","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:c8e8f63c95585be9665e6fef080259ab42b6fc2002f884eee9562ba75c1ca7da","target":"graph","created_at":"2026-05-18T02:51:23Z","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":"The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations scan the set of currently registered threads. Instances of this problem show up in concurrent implementations of transactional memory, flat combining, thread barriers, and memory reclamation schemes for lock-free data structures. In this paper, we analyze a randomized solution for long-lived renaming. The algorithmic technique we consider, called the LevelArray, has previously been used for hashing and one-shot (sin","authors_text":"Alexander Matveev, Dan Alistarh, Justin Kopinsky, Nir Shavit","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-21T15:57:58Z","title":"The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5461","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:238b7d6ee0bdbba5b4a9eb05add02329528c10ecd1ded6daaaaf3fd0c33e2a47","target":"record","created_at":"2026-05-18T02:51:23Z","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":"ff713a5c4836c933dd89abca294702ae3bf1923f86906cbb4629ec9f00bf3054","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-21T15:57:58Z","title_canon_sha256":"a4dc3ed4ec84498e0735fd9ee49a20268c453766a8edb35e5e0da49fe4dc5deb"},"schema_version":"1.0","source":{"id":"1405.5461","kind":"arxiv","version":1}},"canonical_sha256":"391b6dc7e45ab6cbf908f9c61bbd336f1efd78d743f43c17a87a8544d245891e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"391b6dc7e45ab6cbf908f9c61bbd336f1efd78d743f43c17a87a8544d245891e","first_computed_at":"2026-05-18T02:51:23.929587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:23.929587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Os0KpdSZ2Sm5pzh7A/wT0C3sVcfZKrQDWn4djqRh6rDADKEiARLeycRpJvBv6qDVUMb9hAneIN7TNnm/FTzCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:23.930076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:238b7d6ee0bdbba5b4a9eb05add02329528c10ecd1ded6daaaaf3fd0c33e2a47","sha256:c8e8f63c95585be9665e6fef080259ab42b6fc2002f884eee9562ba75c1ca7da"],"state_sha256":"502cb3548f91577a258f554aa8d2e9f457ce81d294c740996a0260a41e5d86ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6OaGUvfEPDgHcfypZxLKwAbU+ahP2qTXwrruAn6VvXssWCurEcExbtqkFE5y3WcyUUzTlMBrHzBAGeMwv+QDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:33:35.231324Z","bundle_sha256":"b6d7d805b19d5f7e3e5c1872733934df5c87f513bb1d1d5f66515d7cf2da53c9"}}