{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NQ3RVN4KGYNBEKLNFRDI2F7OLU","short_pith_number":"pith:NQ3RVN4K","canonical_record":{"source":{"id":"1111.1665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"7ea881479ac2053c4d44bc6ca06caa002c8e084e029457daee30bc07b86e8530","abstract_canon_sha256":"5dc8dc3822bc4764beb36b4b3f9864ea75a5c81a60ffc32a632e630195ebb8be"},"schema_version":"1.0"},"canonical_sha256":"6c371ab78a361a12296d2c468d17ee5d21665483a806e9a5a23cb69af6c9686e","source":{"kind":"arxiv","id":"1111.1665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1665","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1665v1","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1665","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"NQ3RVN4KGYNB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQ3RVN4KGYNBEKLN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQ3RVN4K","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NQ3RVN4KGYNBEKLNFRDI2F7OLU","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"7ea881479ac2053c4d44bc6ca06caa002c8e084e029457daee30bc07b86e8530","abstract_canon_sha256":"5dc8dc3822bc4764beb36b4b3f9864ea75a5c81a60ffc32a632e630195ebb8be"},"schema_version":"1.0"},"canonical_sha256":"6c371ab78a361a12296d2c468d17ee5d21665483a806e9a5a23cb69af6c9686e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:25.596465Z","signature_b64":"LsHJ9TPj8kgwGR8kGYPJB0NriG9wSccJTwV8a4zo83Uiqu8mJ3qOuW2yXw2s90ORpseflsbBFu3PGGzLMgXbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c371ab78a361a12296d2c468d17ee5d21665483a806e9a5a23cb69af6c9686e","last_reissued_at":"2026-05-18T04:09:25.595919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:25.595919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1665","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-05-18T04:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8Xjy5jyGzSWxQu3NMEGUFOdq5KX9+ZovuupkeN08C20QTp3TbTC/bXTIbjl/dHxEUvZTEJomz4KC8x/b9sJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:35:30.200487Z"},"content_sha256":"cf8e81d5973d0b9d2ee31f10fd1c38e4ad2d5bb11769129e9a88c8999a4491b8","schema_version":"1.0","event_id":"sha256:cf8e81d5973d0b9d2ee31f10fd1c38e4ad2d5bb11769129e9a88c8999a4491b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NQ3RVN4KGYNBEKLNFRDI2F7OLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"De-amortizing Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Prosenjit Bose, Rolf Fagerberg, S\\'ebastien Collette, Stefan Langerman","submitted_at":"2011-11-07T18:16:59Z","abstract_excerpt":"We present a general method for de-amortizing essentially any Binary Search Tree (BST) algorithm. In particular, by transforming Splay Trees, our method produces a BST that has the same asymptotic cost as Splay Trees on any access sequence while performing each search in O(log n) worst case time. By transforming Multi-Splay Trees, we obtain a BST that is O(log log n) competitive, satisfies the scanning theorem, the static optimality theorem, the static finger theorem, the working set theorem, and performs each search in O(log n) worst case time. Moreover, we prove that if there is a dynamicall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1665","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":""},"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-18T04:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYezpWfcglHyLMq85OU+y+yPqyvglXcSKoA31UEAKuSZ/F9RibkY86yb3CBkIbx2gbn/zQeBTA145SoNY/IODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:35:30.201206Z"},"content_sha256":"16cd76ea726ae7b4d65ed772d40f5a5dd9200442df8179072447a2f705ffe3cc","schema_version":"1.0","event_id":"sha256:16cd76ea726ae7b4d65ed772d40f5a5dd9200442df8179072447a2f705ffe3cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU/bundle.json","state_url":"https://pith.science/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU/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-05-25T19:35:30Z","links":{"resolver":"https://pith.science/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU","bundle":"https://pith.science/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU/bundle.json","state":"https://pith.science/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQ3RVN4KGYNBEKLNFRDI2F7OLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NQ3RVN4KGYNBEKLNFRDI2F7OLU","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":"5dc8dc3822bc4764beb36b4b3f9864ea75a5c81a60ffc32a632e630195ebb8be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:16:59Z","title_canon_sha256":"7ea881479ac2053c4d44bc6ca06caa002c8e084e029457daee30bc07b86e8530"},"schema_version":"1.0","source":{"id":"1111.1665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1665","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1665v1","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1665","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"NQ3RVN4KGYNB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQ3RVN4KGYNBEKLN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQ3RVN4K","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:16cd76ea726ae7b4d65ed772d40f5a5dd9200442df8179072447a2f705ffe3cc","target":"graph","created_at":"2026-05-18T04:09:25Z","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":"We present a general method for de-amortizing essentially any Binary Search Tree (BST) algorithm. In particular, by transforming Splay Trees, our method produces a BST that has the same asymptotic cost as Splay Trees on any access sequence while performing each search in O(log n) worst case time. By transforming Multi-Splay Trees, we obtain a BST that is O(log log n) competitive, satisfies the scanning theorem, the static optimality theorem, the static finger theorem, the working set theorem, and performs each search in O(log n) worst case time. Moreover, we prove that if there is a dynamicall","authors_text":"Prosenjit Bose, Rolf Fagerberg, S\\'ebastien Collette, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:16:59Z","title":"De-amortizing Binary Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1665","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:cf8e81d5973d0b9d2ee31f10fd1c38e4ad2d5bb11769129e9a88c8999a4491b8","target":"record","created_at":"2026-05-18T04:09:25Z","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":"5dc8dc3822bc4764beb36b4b3f9864ea75a5c81a60ffc32a632e630195ebb8be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:16:59Z","title_canon_sha256":"7ea881479ac2053c4d44bc6ca06caa002c8e084e029457daee30bc07b86e8530"},"schema_version":"1.0","source":{"id":"1111.1665","kind":"arxiv","version":1}},"canonical_sha256":"6c371ab78a361a12296d2c468d17ee5d21665483a806e9a5a23cb69af6c9686e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c371ab78a361a12296d2c468d17ee5d21665483a806e9a5a23cb69af6c9686e","first_computed_at":"2026-05-18T04:09:25.595919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:25.595919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LsHJ9TPj8kgwGR8kGYPJB0NriG9wSccJTwV8a4zo83Uiqu8mJ3qOuW2yXw2s90ORpseflsbBFu3PGGzLMgXbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:25.596465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf8e81d5973d0b9d2ee31f10fd1c38e4ad2d5bb11769129e9a88c8999a4491b8","sha256:16cd76ea726ae7b4d65ed772d40f5a5dd9200442df8179072447a2f705ffe3cc"],"state_sha256":"7f5677cbd23975905a04bef2b8b9ef6eb6a1de0ffd6a1551e54df7245cb4f878"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NarLrACdV3c+vi301SdGYEw+geaAngxqogPWY2u5/Vtfs8jtWvar+4TEl4Ples6aujZYcDz93YxufvjMQvdbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:35:30.205450Z","bundle_sha256":"e4a1c2dee299f04a06d727bc0f5f2cde83ebe03b1fb274a9e0cac0bb19a7bb69"}}