{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XT4S3KCNZEVCSMXFXB73YKACYM","short_pith_number":"pith:XT4S3KCN","schema_version":"1.0","canonical_sha256":"bcf92da84dc92a2932e5b87fbc2802c30e07a2b0654cc59bddfe05f5139d3dd9","source":{"kind":"arxiv","id":"1805.02200","version":2},"attestation_state":"computed","paper":{"title":"Wormhole: A Fast Ordered Index for In-memory Data Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DB","authors_text":"Fan Ni, Song Jiang, Xingbo Wu","submitted_at":"2018-05-06T12:31:28Z","abstract_excerpt":"In-memory data management systems, such as key-value stores, have become an essential infrastructure in today's big-data processing and cloud computing. They rely on efficient index structures to access data. While unordered indexes, such as hash tables, can perform point search with O(1) time, they cannot be used in many scenarios where range queries must be supported. Many ordered indexes, such as B+ tree and skip list, have a O(log N) lookup cost, where N is number of keys in an index. For an ordered index hosting billions of keys, it may take more than 30 key-comparisons in a lookup, which"},"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":"1805.02200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-06T12:31:28Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"794322b603756efd4b6a6ae07ca4e7f5c0beb704af0af77126ef174ea11b6d2b","abstract_canon_sha256":"01bcb0eadb54b1ac56b96db0804eb380a5389ca1d0ff921d2629a4a2757e8d9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.415721Z","signature_b64":"GXfG5tm/EnjDrI2ogg5MGXRq1Y96MlMaxepkNhNe+4JSdXdWUrDKoWY6ODHBSTkwzMVfuqVg2pjI9xtTFEqZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf92da84dc92a2932e5b87fbc2802c30e07a2b0654cc59bddfe05f5139d3dd9","last_reissued_at":"2026-05-17T23:53:51.414924Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.414924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wormhole: A Fast Ordered Index for In-memory Data Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DB","authors_text":"Fan Ni, Song Jiang, Xingbo Wu","submitted_at":"2018-05-06T12:31:28Z","abstract_excerpt":"In-memory data management systems, such as key-value stores, have become an essential infrastructure in today's big-data processing and cloud computing. They rely on efficient index structures to access data. While unordered indexes, such as hash tables, can perform point search with O(1) time, they cannot be used in many scenarios where range queries must be supported. Many ordered indexes, such as B+ tree and skip list, have a O(log N) lookup cost, where N is number of keys in an index. For an ordered index hosting billions of keys, it may take more than 30 key-comparisons in a lookup, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02200","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.02200","created_at":"2026-05-17T23:53:51.415072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02200v2","created_at":"2026-05-17T23:53:51.415072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02200","created_at":"2026-05-17T23:53:51.415072+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT4S3KCNZEVC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT4S3KCNZEVCSMXF","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT4S3KCN","created_at":"2026-05-18T12:33:01.666342+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/XT4S3KCNZEVCSMXFXB73YKACYM","json":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM.json","graph_json":"https://pith.science/api/pith-number/XT4S3KCNZEVCSMXFXB73YKACYM/graph.json","events_json":"https://pith.science/api/pith-number/XT4S3KCNZEVCSMXFXB73YKACYM/events.json","paper":"https://pith.science/paper/XT4S3KCN"},"agent_actions":{"view_html":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM","download_json":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM.json","view_paper":"https://pith.science/paper/XT4S3KCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02200&json=true","fetch_graph":"https://pith.science/api/pith-number/XT4S3KCNZEVCSMXFXB73YKACYM/graph.json","fetch_events":"https://pith.science/api/pith-number/XT4S3KCNZEVCSMXFXB73YKACYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/action/storage_attestation","attest_author":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/action/author_attestation","sign_citation":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/action/citation_signature","submit_replication":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/action/replication_record"}},"created_at":"2026-05-17T23:53:51.415072+00:00","updated_at":"2026-05-17T23:53:51.415072+00:00"}