{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WXT6RGVBTFT4HGOCJJNJTSLV7P","short_pith_number":"pith:WXT6RGVB","schema_version":"1.0","canonical_sha256":"b5e7e89aa19967c399c24a5a99c975fbdef251b30ed4b4d8019abd96f1fd4cdb","source":{"kind":"arxiv","id":"2606.17315","version":1},"attestation_state":"computed","paper":{"title":"Space-Efficient Lock-Free Linear-Probing Hash Table","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hagit Attiya, Noa Schiller, Rotem Oshman","submitted_at":"2026-06-15T21:43:56Z","abstract_excerpt":"Linear probing is one of the simplest and most space-efficient approaches to hash table design, and is widely used in sequential settings due to its compact memory layout. However, designing a concurrent linear-probing hash table with strong liveness guarantees has proved difficult, and only a handful of such algorithms have been proposed, all of which either restrict concurrency or rely on large per-entry metadata, thereby compromising space efficiency.\n  We present a lock-free linear-probing hash table with wait-free lookups that retains the core advantages of sequential linear probing while"},"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":"2606.17315","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-15T21:43:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"664cfc9add70eaf9de73785a5d1dcaf9efd355e45f09ff7dc2f350a2dc8f1aa8","abstract_canon_sha256":"8c473a231b6a27243d8077965e505d5caf3cb5048d9edcc4a2d36ecd61daff9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:08.811090Z","signature_b64":"bK6FIE9E90s/XRz78Szu2CDLVAqwkQt/s8aKwKTDhxXHnIBxSgmM7l2JfY7FW6UvVctq80vynZEYgNY7ppYQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e7e89aa19967c399c24a5a99c975fbdef251b30ed4b4d8019abd96f1fd4cdb","last_reissued_at":"2026-06-19T16:10:08.810742Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:08.810742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Lock-Free Linear-Probing Hash Table","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hagit Attiya, Noa Schiller, Rotem Oshman","submitted_at":"2026-06-15T21:43:56Z","abstract_excerpt":"Linear probing is one of the simplest and most space-efficient approaches to hash table design, and is widely used in sequential settings due to its compact memory layout. However, designing a concurrent linear-probing hash table with strong liveness guarantees has proved difficult, and only a handful of such algorithms have been proposed, all of which either restrict concurrency or rely on large per-entry metadata, thereby compromising space efficiency.\n  We present a lock-free linear-probing hash table with wait-free lookups that retains the core advantages of sequential linear probing while"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17315","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.17315/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.17315","created_at":"2026-06-19T16:10:08.810806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17315v1","created_at":"2026-06-19T16:10:08.810806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17315","created_at":"2026-06-19T16:10:08.810806+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXT6RGVBTFT4","created_at":"2026-06-19T16:10:08.810806+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXT6RGVBTFT4HGOC","created_at":"2026-06-19T16:10:08.810806+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXT6RGVB","created_at":"2026-06-19T16:10:08.810806+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/WXT6RGVBTFT4HGOCJJNJTSLV7P","json":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P.json","graph_json":"https://pith.science/api/pith-number/WXT6RGVBTFT4HGOCJJNJTSLV7P/graph.json","events_json":"https://pith.science/api/pith-number/WXT6RGVBTFT4HGOCJJNJTSLV7P/events.json","paper":"https://pith.science/paper/WXT6RGVB"},"agent_actions":{"view_html":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P","download_json":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P.json","view_paper":"https://pith.science/paper/WXT6RGVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17315&json=true","fetch_graph":"https://pith.science/api/pith-number/WXT6RGVBTFT4HGOCJJNJTSLV7P/graph.json","fetch_events":"https://pith.science/api/pith-number/WXT6RGVBTFT4HGOCJJNJTSLV7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P/action/storage_attestation","attest_author":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P/action/author_attestation","sign_citation":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P/action/citation_signature","submit_replication":"https://pith.science/pith/WXT6RGVBTFT4HGOCJJNJTSLV7P/action/replication_record"}},"created_at":"2026-06-19T16:10:08.810806+00:00","updated_at":"2026-06-19T16:10:08.810806+00:00"}