{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IT7YBQCC75QY74CYEJULRFA7OV","short_pith_number":"pith:IT7YBQCC","canonical_record":{"source":{"id":"2606.28889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-27T12:27:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"91aac64c62216011ed0cde0aeb261cb2dda4324a756437a4673726a38612b1d6","abstract_canon_sha256":"456f84a7a44994d2b6a869054bc5fd6ab1af78536088f5c8a3c01f8d18041aeb"},"schema_version":"1.0"},"canonical_sha256":"44ff80c042ff618ff0582268b8941f7540d318c42f634f1add145c806b8684b8","source":{"kind":"arxiv","id":"2606.28889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28889","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28889v1","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28889","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"IT7YBQCC75QY","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"IT7YBQCC75QY74CY","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"IT7YBQCC","created_at":"2026-06-30T01:17:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IT7YBQCC75QY74CYEJULRFA7OV","target":"record","payload":{"canonical_record":{"source":{"id":"2606.28889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-27T12:27:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"91aac64c62216011ed0cde0aeb261cb2dda4324a756437a4673726a38612b1d6","abstract_canon_sha256":"456f84a7a44994d2b6a869054bc5fd6ab1af78536088f5c8a3c01f8d18041aeb"},"schema_version":"1.0"},"canonical_sha256":"44ff80c042ff618ff0582268b8941f7540d318c42f634f1add145c806b8684b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:43.858459Z","signature_b64":"acTonUtfK+1z701KGhn8+Z9TZAOk6g1gA+g1zDkusuaB+baLAfxqMciOVCKeux7dcW8+9EAejaj8Ku9TP89kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44ff80c042ff618ff0582268b8941f7540d318c42f634f1add145c806b8684b8","last_reissued_at":"2026-06-30T01:17:43.857533Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:43.857533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.28889","source_version":1,"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-06-30T01:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pT68fBeoxCLl4DYEluHeqtB86ginp2LHH1nbwn0ynuigqb1SZaRKbm4id2bbNu18PIYVptX5KQxX6BjK/2xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:14:39.467097Z"},"content_sha256":"e981adddd0c43d4a65465f71a57571a08680e8a46d21da4e1196d3fa50094f7e","schema_version":"1.0","event_id":"sha256:e981adddd0c43d4a65465f71a57571a08680e8a46d21da4e1196d3fa50094f7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IT7YBQCC75QY74CYEJULRFA7OV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concurrent Splay-Based Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Artem Shilkin, Rene van Bevern, Vitaly Aksenov","submitted_at":"2026-06-27T12:27:07Z","abstract_excerpt":"Most work on efficient concurrent ordered indices, such as concurrent binary search trees, B-trees, skip lists, etc., has focused on data structures that provide good \\emph{worst-case} guarantees. In real workloads, objects are often accessed at different rates, since access distributions may be non-uniform. Many efficient distribution-adaptive data structures exist in the sequential case; however, they are often complicated to make efficient in the concurrent case.\n  The most prominent distribution-adaptive data structure is Splay Tree. Its most important advantage is that it does not store a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28889","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.28889/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-06-30T01:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFPCyy2PCGcZbrGtNnq4YcuvPAb5NwKwtEVqHGtxDzBmCIt+DHQUg5dthNxTDT4Ay7yuwA9rFBEvIN+A08vMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:14:39.467492Z"},"content_sha256":"37bedd00b2c9ec61a2edbccbd4faa9695c34aa86b2e075caedf2fb793ef74aee","schema_version":"1.0","event_id":"sha256:37bedd00b2c9ec61a2edbccbd4faa9695c34aa86b2e075caedf2fb793ef74aee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/bundle.json","state_url":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT7YBQCC75QY74CYEJULRFA7OV/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-06-30T13:14:39Z","links":{"resolver":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV","bundle":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/bundle.json","state":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT7YBQCC75QY74CYEJULRFA7OV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IT7YBQCC75QY74CYEJULRFA7OV","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":"456f84a7a44994d2b6a869054bc5fd6ab1af78536088f5c8a3c01f8d18041aeb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-27T12:27:07Z","title_canon_sha256":"91aac64c62216011ed0cde0aeb261cb2dda4324a756437a4673726a38612b1d6"},"schema_version":"1.0","source":{"id":"2606.28889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28889","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28889v1","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28889","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"IT7YBQCC75QY","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"IT7YBQCC75QY74CY","created_at":"2026-06-30T01:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"IT7YBQCC","created_at":"2026-06-30T01:17:43Z"}],"graph_snapshots":[{"event_id":"sha256:37bedd00b2c9ec61a2edbccbd4faa9695c34aa86b2e075caedf2fb793ef74aee","target":"graph","created_at":"2026-06-30T01:17:43Z","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/2606.28889/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most work on efficient concurrent ordered indices, such as concurrent binary search trees, B-trees, skip lists, etc., has focused on data structures that provide good \\emph{worst-case} guarantees. In real workloads, objects are often accessed at different rates, since access distributions may be non-uniform. Many efficient distribution-adaptive data structures exist in the sequential case; however, they are often complicated to make efficient in the concurrent case.\n  The most prominent distribution-adaptive data structure is Splay Tree. Its most important advantage is that it does not store a","authors_text":"Artem Shilkin, Rene van Bevern, Vitaly Aksenov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-27T12:27:07Z","title":"Concurrent Splay-Based Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28889","kind":"arxiv","version":1},"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:e981adddd0c43d4a65465f71a57571a08680e8a46d21da4e1196d3fa50094f7e","target":"record","created_at":"2026-06-30T01:17:43Z","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":"456f84a7a44994d2b6a869054bc5fd6ab1af78536088f5c8a3c01f8d18041aeb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-27T12:27:07Z","title_canon_sha256":"91aac64c62216011ed0cde0aeb261cb2dda4324a756437a4673726a38612b1d6"},"schema_version":"1.0","source":{"id":"2606.28889","kind":"arxiv","version":1}},"canonical_sha256":"44ff80c042ff618ff0582268b8941f7540d318c42f634f1add145c806b8684b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44ff80c042ff618ff0582268b8941f7540d318c42f634f1add145c806b8684b8","first_computed_at":"2026-06-30T01:17:43.857533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:17:43.857533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"acTonUtfK+1z701KGhn8+Z9TZAOk6g1gA+g1zDkusuaB+baLAfxqMciOVCKeux7dcW8+9EAejaj8Ku9TP89kAQ==","signature_status":"signed_v1","signed_at":"2026-06-30T01:17:43.858459Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e981adddd0c43d4a65465f71a57571a08680e8a46d21da4e1196d3fa50094f7e","sha256:37bedd00b2c9ec61a2edbccbd4faa9695c34aa86b2e075caedf2fb793ef74aee"],"state_sha256":"d55ac10e66905db50f67fb6bd482fd8d2f8b2e2448cce52aa98fd15c98da7778"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZ24deqwZmbwYEij7ynSjUotN9PIW9PxB8jd17xCNssoOifXVizAniSb1P+Fwo0aioiQ+o44wa0cZgDNOVGnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:14:39.469636Z","bundle_sha256":"b52b6c5276a30fbe0108fe9f52219f3cc22b524cd2eecdebd8a55fdd718e9696"}}