{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SEKSHEITXFWZIHB6KDDOR3LTDS","short_pith_number":"pith:SEKSHEIT","canonical_record":{"source":{"id":"2010.12734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-24T01:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"f0db6e9c394a4fad88f2dd6f930ad48d46d5b3e124e36050c9ff8b3c33eeb28c","abstract_canon_sha256":"22686f17ad8cdfebf93704d1c52b0a1e3f40fd7e3526819038f95b1e39e16bfb"},"schema_version":"1.0"},"canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","source":{"kind":"arxiv","id":"2010.12734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12734","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12734v2","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12734","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"SEKSHEITXFWZ","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"SEKSHEITXFWZIHB6","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"SEKSHEIT","created_at":"2026-07-05T02:09:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SEKSHEITXFWZIHB6KDDOR3LTDS","target":"record","payload":{"canonical_record":{"source":{"id":"2010.12734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-24T01:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"f0db6e9c394a4fad88f2dd6f930ad48d46d5b3e124e36050c9ff8b3c33eeb28c","abstract_canon_sha256":"22686f17ad8cdfebf93704d1c52b0a1e3f40fd7e3526819038f95b1e39e16bfb"},"schema_version":"1.0"},"canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:49.223726Z","signature_b64":"MKl2urAr/5lJBwzZRPZsJsV5EbH2ZXE/L1nbVNQO7gALuW9X96XDTjV4O30bQ/r1eQDpSZj9oUQczSGj1CM0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","last_reissued_at":"2026-07-05T02:09:49.223243Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:49.223243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.12734","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-07-05T02:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+2E5BboffZJfKg4xJxHo96mdhiwJld4MYxJhvUjQ+PdCNPamHEzgZvZnxALlIgHbLyKmfNjRigIpIdDTksXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T14:04:51.495101Z"},"content_sha256":"d1736e49dd9f89859635a742c82ed440f9bfe8c402af41ee7adf931a82085793","schema_version":"1.0","event_id":"sha256:d1736e49dd9f89859635a742c82ed440f9bfe8c402af41ee7adf931a82085793"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SEKSHEITXFWZIHB6KDDOR3LTDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"REMIX: Efficient Range Query for LSM-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Chen, Song Jiang, Wenshao Zhong, Xingbo Wu","submitted_at":"2020-10-24T01:21:21Z","abstract_excerpt":"LSM-tree based key-value (KV) stores organize data in a multi-level structure for high-speed writes. Range queries on traditional LSM-trees must seek and sort-merge data from multiple table files on the fly, which is expensive and often leads to mediocre read performance. To improve range query efficiency on LSM-trees, we introduce a space-efficient KV index data structure, named REMIX, that records a globally sorted view of KV data spanning multiple table files. A range query on multiple REMIX-indexed data files can quickly locate the target key using a binary search, and retrieve subsequent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12734","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.12734/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"},"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-07-05T02:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwat41EqcbtuLOTQRVF4zGc5XDGcqiQ2CKVZGyfP0He9VfSHtlfLJe4pByveRZg+SBy+jeTiTdmP0tHxoRlhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T14:04:51.495501Z"},"content_sha256":"3f512660abf54e6228b783c38e20da2c3ed11d7899400f9125cefe669e965521","schema_version":"1.0","event_id":"sha256:3f512660abf54e6228b783c38e20da2c3ed11d7899400f9125cefe669e965521"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/bundle.json","state_url":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/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-13T14:04:51Z","links":{"resolver":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS","bundle":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/bundle.json","state":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SEKSHEITXFWZIHB6KDDOR3LTDS","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":"22686f17ad8cdfebf93704d1c52b0a1e3f40fd7e3526819038f95b1e39e16bfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-24T01:21:21Z","title_canon_sha256":"f0db6e9c394a4fad88f2dd6f930ad48d46d5b3e124e36050c9ff8b3c33eeb28c"},"schema_version":"1.0","source":{"id":"2010.12734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12734","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12734v2","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12734","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"SEKSHEITXFWZ","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"SEKSHEITXFWZIHB6","created_at":"2026-07-05T02:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"SEKSHEIT","created_at":"2026-07-05T02:09:49Z"}],"graph_snapshots":[{"event_id":"sha256:3f512660abf54e6228b783c38e20da2c3ed11d7899400f9125cefe669e965521","target":"graph","created_at":"2026-07-05T02:09:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.12734/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"LSM-tree based key-value (KV) stores organize data in a multi-level structure for high-speed writes. Range queries on traditional LSM-trees must seek and sort-merge data from multiple table files on the fly, which is expensive and often leads to mediocre read performance. To improve range query efficiency on LSM-trees, we introduce a space-efficient KV index data structure, named REMIX, that records a globally sorted view of KV data spanning multiple table files. A range query on multiple REMIX-indexed data files can quickly locate the target key using a binary search, and retrieve subsequent ","authors_text":"Chen Chen, Song Jiang, Wenshao Zhong, Xingbo Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-24T01:21:21Z","title":"REMIX: Efficient Range Query for LSM-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12734","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:d1736e49dd9f89859635a742c82ed440f9bfe8c402af41ee7adf931a82085793","target":"record","created_at":"2026-07-05T02:09:49Z","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":"22686f17ad8cdfebf93704d1c52b0a1e3f40fd7e3526819038f95b1e39e16bfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-24T01:21:21Z","title_canon_sha256":"f0db6e9c394a4fad88f2dd6f930ad48d46d5b3e124e36050c9ff8b3c33eeb28c"},"schema_version":"1.0","source":{"id":"2010.12734","kind":"arxiv","version":2}},"canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","first_computed_at":"2026-07-05T02:09:49.223243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:09:49.223243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKl2urAr/5lJBwzZRPZsJsV5EbH2ZXE/L1nbVNQO7gALuW9X96XDTjV4O30bQ/r1eQDpSZj9oUQczSGj1CM0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:09:49.223726Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1736e49dd9f89859635a742c82ed440f9bfe8c402af41ee7adf931a82085793","sha256:3f512660abf54e6228b783c38e20da2c3ed11d7899400f9125cefe669e965521"],"state_sha256":"3c93982252b3c7167c4f029dece9fc88fbfd6a714a0c47f7aa0b0235c4a86afc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKi6bY6AXFiJCpG8e3ciocznT0SGM+EGANf6+9ZKaZhD3OjIxxdLJSjlY97+Ms5utMiQOUKEEAW9zxXbn+TEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T14:04:51.497515Z","bundle_sha256":"13111bd963a8f047ed1f5d77514dca1064224fb5adf4a38b95551062b881983a"}}