{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XT4S3KCNZEVCSMXFXB73YKACYM","short_pith_number":"pith:XT4S3KCN","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"},"canonical_sha256":"bcf92da84dc92a2932e5b87fbc2802c30e07a2b0654cc59bddfe05f5139d3dd9","source":{"kind":"arxiv","id":"1805.02200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02200","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02200v2","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02200","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"XT4S3KCNZEVC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XT4S3KCNZEVCSMXF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XT4S3KCN","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XT4S3KCNZEVCSMXFXB73YKACYM","target":"record","payload":{"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"},"canonical_sha256":"bcf92da84dc92a2932e5b87fbc2802c30e07a2b0654cc59bddfe05f5139d3dd9","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"},"source_kind":"arxiv","source_id":"1805.02200","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-17T23:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9IFBm8PXoLUO04kB2Kmm+pvxQou6APZV9Ui9jd57jzZqDURwSOmNGqci6fUJChxZhHJZcdfsjGOE8otxoNeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:10:53.427392Z"},"content_sha256":"59d0fe0da60e45e57e3ef79f36b1b8f0fa09d9d1399a0ac462c13e9873a430be","schema_version":"1.0","event_id":"sha256:59d0fe0da60e45e57e3ef79f36b1b8f0fa09d9d1399a0ac462c13e9873a430be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XT4S3KCNZEVCSMXFXB73YKACYM","target":"graph","payload":{"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"},"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-17T23:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olHi6HVqrM0k7Ksj+1M957zg6CYcxfQELGQxao2colvm/tcC7OzkMrY+UHUeQwfku5xzVjUn5xudtioaI8gLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:10:53.427748Z"},"content_sha256":"bb31d83d72cf1ed53daee3f2925e1e483c7cc9c748bde708cbfb0d46dee927b5","schema_version":"1.0","event_id":"sha256:bb31d83d72cf1ed53daee3f2925e1e483c7cc9c748bde708cbfb0d46dee927b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/bundle.json","state_url":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XT4S3KCNZEVCSMXFXB73YKACYM/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-07-08T22:10:53Z","links":{"resolver":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM","bundle":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/bundle.json","state":"https://pith.science/pith/XT4S3KCNZEVCSMXFXB73YKACYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XT4S3KCNZEVCSMXFXB73YKACYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XT4S3KCNZEVCSMXFXB73YKACYM","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":"01bcb0eadb54b1ac56b96db0804eb380a5389ca1d0ff921d2629a4a2757e8d9f","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-06T12:31:28Z","title_canon_sha256":"794322b603756efd4b6a6ae07ca4e7f5c0beb704af0af77126ef174ea11b6d2b"},"schema_version":"1.0","source":{"id":"1805.02200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02200","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02200v2","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02200","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"XT4S3KCNZEVC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XT4S3KCNZEVCSMXF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XT4S3KCN","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bb31d83d72cf1ed53daee3f2925e1e483c7cc9c748bde708cbfb0d46dee927b5","target":"graph","created_at":"2026-05-17T23:53:51Z","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-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","authors_text":"Fan Ni, Song Jiang, Xingbo Wu","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-06T12:31:28Z","title":"Wormhole: A Fast Ordered Index for In-memory Data Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02200","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:59d0fe0da60e45e57e3ef79f36b1b8f0fa09d9d1399a0ac462c13e9873a430be","target":"record","created_at":"2026-05-17T23:53:51Z","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":"01bcb0eadb54b1ac56b96db0804eb380a5389ca1d0ff921d2629a4a2757e8d9f","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-06T12:31:28Z","title_canon_sha256":"794322b603756efd4b6a6ae07ca4e7f5c0beb704af0af77126ef174ea11b6d2b"},"schema_version":"1.0","source":{"id":"1805.02200","kind":"arxiv","version":2}},"canonical_sha256":"bcf92da84dc92a2932e5b87fbc2802c30e07a2b0654cc59bddfe05f5139d3dd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcf92da84dc92a2932e5b87fbc2802c30e07a2b0654cc59bddfe05f5139d3dd9","first_computed_at":"2026-05-17T23:53:51.414924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:51.414924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GXfG5tm/EnjDrI2ogg5MGXRq1Y96MlMaxepkNhNe+4JSdXdWUrDKoWY6ODHBSTkwzMVfuqVg2pjI9xtTFEqZDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:51.415721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59d0fe0da60e45e57e3ef79f36b1b8f0fa09d9d1399a0ac462c13e9873a430be","sha256:bb31d83d72cf1ed53daee3f2925e1e483c7cc9c748bde708cbfb0d46dee927b5"],"state_sha256":"320fdabc458c3ba651cb04cd5cb388e93f9a9e0f10231d6b31188e29b2fef859"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucS4mZCxV0/+BmRXmZv5gE15HqZiixEPv0/1ElVjq9C2mwp26qYnevVwFvMsn2DWcsuoFu8sGHUxIsui321CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:10:53.429655Z","bundle_sha256":"26906541b62ad5f4e0a99503dc0f18116fe3868d4b7f37f0d14aa373a556652c"}}