{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7FO63MGNCZFK3TEDMNRLA3QXWY","short_pith_number":"pith:7FO63MGN","schema_version":"1.0","canonical_sha256":"f95dedb0cd164aadcc836362b06e17b6171237df70a7cbab294a4c35b9025b38","source":{"kind":"arxiv","id":"2606.13321","version":1},"attestation_state":"computed","paper":{"title":"Skiplists with Foresight: Skipping Cache Misses","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Erez Petrank, Niv Sulimany, Tomer Cory","submitted_at":"2026-06-11T13:14:46Z","abstract_excerpt":"A skiplist is a fundamental data structure widely used in systems and applications for indexing data stores. In this work, we introduce Foresight, a cache-friendly skiplist optimization. Extending Foresight to concurrent settings introduces significant synchronization challenges that we identify and address. Foresight is a surgical optimization, easy to integrate into a wide variety of skiplist designs. We apply it to one sequential and three concurrent skiplist designs and observe throughput improvements of up to 45% in microbenchmarks. When applied to a skiplist-based index in the DBx1000 in"},"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.13321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-11T13:14:46Z","cross_cats_sorted":[],"title_canon_sha256":"4293a370e19b962aa436839264f6dca97c71080c546eafc6ed239f7d2e894c6a","abstract_canon_sha256":"c6cf6fafba750293852c38f80d29ab03852bdcd37b13d0cdced370e37815a204"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:52.355596Z","signature_b64":"Df5hinmUA0+V9fslpVanvJd9gAieBcaQXoc+GHtu/Db8c30+4FLyWJs05ZipjebRPGsQZJLunddR59ZS1XbNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95dedb0cd164aadcc836362b06e17b6171237df70a7cbab294a4c35b9025b38","last_reissued_at":"2026-06-12T01:09:52.354677Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:52.354677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skiplists with Foresight: Skipping Cache Misses","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Erez Petrank, Niv Sulimany, Tomer Cory","submitted_at":"2026-06-11T13:14:46Z","abstract_excerpt":"A skiplist is a fundamental data structure widely used in systems and applications for indexing data stores. In this work, we introduce Foresight, a cache-friendly skiplist optimization. Extending Foresight to concurrent settings introduces significant synchronization challenges that we identify and address. Foresight is a surgical optimization, easy to integrate into a wide variety of skiplist designs. We apply it to one sequential and three concurrent skiplist designs and observe throughput improvements of up to 45% in microbenchmarks. When applied to a skiplist-based index in the DBx1000 in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13321","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.13321/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.13321","created_at":"2026-06-12T01:09:52.354822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13321v1","created_at":"2026-06-12T01:09:52.354822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13321","created_at":"2026-06-12T01:09:52.354822+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FO63MGNCZFK","created_at":"2026-06-12T01:09:52.354822+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FO63MGNCZFK3TED","created_at":"2026-06-12T01:09:52.354822+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FO63MGN","created_at":"2026-06-12T01:09:52.354822+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/7FO63MGNCZFK3TEDMNRLA3QXWY","json":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY.json","graph_json":"https://pith.science/api/pith-number/7FO63MGNCZFK3TEDMNRLA3QXWY/graph.json","events_json":"https://pith.science/api/pith-number/7FO63MGNCZFK3TEDMNRLA3QXWY/events.json","paper":"https://pith.science/paper/7FO63MGN"},"agent_actions":{"view_html":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY","download_json":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY.json","view_paper":"https://pith.science/paper/7FO63MGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13321&json=true","fetch_graph":"https://pith.science/api/pith-number/7FO63MGNCZFK3TEDMNRLA3QXWY/graph.json","fetch_events":"https://pith.science/api/pith-number/7FO63MGNCZFK3TEDMNRLA3QXWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY/action/storage_attestation","attest_author":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY/action/author_attestation","sign_citation":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY/action/citation_signature","submit_replication":"https://pith.science/pith/7FO63MGNCZFK3TEDMNRLA3QXWY/action/replication_record"}},"created_at":"2026-06-12T01:09:52.354822+00:00","updated_at":"2026-06-12T01:09:52.354822+00:00"}