{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R7NZ6K366NU7IETB5X4EEOB65K","short_pith_number":"pith:R7NZ6K36","schema_version":"1.0","canonical_sha256":"8fdb9f2b7ef369f41261edf842383eeabd1a20c6535a05708965519dbe8cdc6c","source":{"kind":"arxiv","id":"1507.06953","version":1},"attestation_state":"computed","paper":{"title":"Pattern-avoiding access in binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Laszlo Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2015-07-24T18:43:59Z","abstract_excerpt":"The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..]\n  Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BS"},"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":"1507.06953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-24T18:43:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"db216d6cc423e7ffaae2e7f6810918c18b318bd23a002d789db49b6fa0a1def6","abstract_canon_sha256":"2a15d34ea23ce1aae4be280d52c09c8122ab633637ae82e25388ff62df662536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:04.499948Z","signature_b64":"bXsymLP6f3kFBBry1Y9gAozZ7lUx7TrGMkoNirPBVYjNf6sl8brzbC1j1lLpsXIg+V7dc0qIdm24ho1IVPYIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fdb9f2b7ef369f41261edf842383eeabd1a20c6535a05708965519dbe8cdc6c","last_reissued_at":"2026-05-18T01:35:04.499219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:04.499219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern-avoiding access in binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Laszlo Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2015-07-24T18:43:59Z","abstract_excerpt":"The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..]\n  Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06953","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.06953","created_at":"2026-05-18T01:35:04.499336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06953v1","created_at":"2026-05-18T01:35:04.499336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06953","created_at":"2026-05-18T01:35:04.499336+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7NZ6K366NU7","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7NZ6K366NU7IETB","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7NZ6K36","created_at":"2026-05-18T12:29:39.896362+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/R7NZ6K366NU7IETB5X4EEOB65K","json":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K.json","graph_json":"https://pith.science/api/pith-number/R7NZ6K366NU7IETB5X4EEOB65K/graph.json","events_json":"https://pith.science/api/pith-number/R7NZ6K366NU7IETB5X4EEOB65K/events.json","paper":"https://pith.science/paper/R7NZ6K36"},"agent_actions":{"view_html":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K","download_json":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K.json","view_paper":"https://pith.science/paper/R7NZ6K36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06953&json=true","fetch_graph":"https://pith.science/api/pith-number/R7NZ6K366NU7IETB5X4EEOB65K/graph.json","fetch_events":"https://pith.science/api/pith-number/R7NZ6K366NU7IETB5X4EEOB65K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K/action/storage_attestation","attest_author":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K/action/author_attestation","sign_citation":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K/action/citation_signature","submit_replication":"https://pith.science/pith/R7NZ6K366NU7IETB5X4EEOB65K/action/replication_record"}},"created_at":"2026-05-18T01:35:04.499336+00:00","updated_at":"2026-05-18T01:35:04.499336+00:00"}