{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IT7YBQCC75QY74CYEJULRFA7OV","short_pith_number":"pith:IT7YBQCC","schema_version":"1.0","canonical_sha256":"44ff80c042ff618ff0582268b8941f7540d318c42f634f1add145c806b8684b8","source":{"kind":"arxiv","id":"2606.28889","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.28889","created_at":"2026-06-30T01:17:43.857640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28889v1","created_at":"2026-06-30T01:17:43.857640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28889","created_at":"2026-06-30T01:17:43.857640+00:00"},{"alias_kind":"pith_short_12","alias_value":"IT7YBQCC75QY","created_at":"2026-06-30T01:17:43.857640+00:00"},{"alias_kind":"pith_short_16","alias_value":"IT7YBQCC75QY74CY","created_at":"2026-06-30T01:17:43.857640+00:00"},{"alias_kind":"pith_short_8","alias_value":"IT7YBQCC","created_at":"2026-06-30T01:17:43.857640+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/IT7YBQCC75QY74CYEJULRFA7OV","json":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV.json","graph_json":"https://pith.science/api/pith-number/IT7YBQCC75QY74CYEJULRFA7OV/graph.json","events_json":"https://pith.science/api/pith-number/IT7YBQCC75QY74CYEJULRFA7OV/events.json","paper":"https://pith.science/paper/IT7YBQCC"},"agent_actions":{"view_html":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV","download_json":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV.json","view_paper":"https://pith.science/paper/IT7YBQCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28889&json=true","fetch_graph":"https://pith.science/api/pith-number/IT7YBQCC75QY74CYEJULRFA7OV/graph.json","fetch_events":"https://pith.science/api/pith-number/IT7YBQCC75QY74CYEJULRFA7OV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/action/storage_attestation","attest_author":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/action/author_attestation","sign_citation":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/action/citation_signature","submit_replication":"https://pith.science/pith/IT7YBQCC75QY74CYEJULRFA7OV/action/replication_record"}},"created_at":"2026-06-30T01:17:43.857640+00:00","updated_at":"2026-06-30T01:17:43.857640+00:00"}