{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AJCLF7BGH22K5RGSKKHJAKOK3N","short_pith_number":"pith:AJCLF7BG","schema_version":"1.0","canonical_sha256":"0244b2fc263eb4aec4d2528e9029cadb6c8f2e02ea9d3cfb5651538f8fa219da","source":{"kind":"arxiv","id":"1603.08151","version":1},"attestation_state":"computed","paper":{"title":"Binary search trees and rectangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma, Thatchaphol Saranurak","submitted_at":"2016-03-26T22:49:46Z","abstract_excerpt":"We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatorial structures. In particular, we show that the execution trace of a BST that serves a sequence of queries is in close correspondence with the flip-sequence between two rectangulations. (Rectangulations are well-studied combinatorial objects also known as mosaic floorplans.) We also reinterpret Small Manhattan Network, a problem with known connections to the BST problem, in terms of flips in rectangulations. We apply f"},"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":"1603.08151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-26T22:49:46Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"e4a01f16b2cf4292ca06d5665ae91b90ae51e4c962b35eea3996ee336cce7c59","abstract_canon_sha256":"0db45b1899e875b96985b9e49c4e441d3e3a7d5bce939010682ccd4b99a0bab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:13.111598Z","signature_b64":"KN/RHCl9y/1C0SFHTphOum7TvnG3gg4yFQ+EBds1A1hrH5iaw6RSfTZvBP6DyJ1vTJJwRnNciScYVPNT17goBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0244b2fc263eb4aec4d2528e9029cadb6c8f2e02ea9d3cfb5651538f8fa219da","last_reissued_at":"2026-05-18T01:18:13.110901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:13.110901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary search trees and rectangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma, Thatchaphol Saranurak","submitted_at":"2016-03-26T22:49:46Z","abstract_excerpt":"We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatorial structures. In particular, we show that the execution trace of a BST that serves a sequence of queries is in close correspondence with the flip-sequence between two rectangulations. (Rectangulations are well-studied combinatorial objects also known as mosaic floorplans.) We also reinterpret Small Manhattan Network, a problem with known connections to the BST problem, in terms of flips in rectangulations. We apply f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08151","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":"1603.08151","created_at":"2026-05-18T01:18:13.110992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08151v1","created_at":"2026-05-18T01:18:13.110992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08151","created_at":"2026-05-18T01:18:13.110992+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJCLF7BGH22K","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJCLF7BGH22K5RGS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJCLF7BG","created_at":"2026-05-18T12:30:07.202191+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/AJCLF7BGH22K5RGSKKHJAKOK3N","json":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N.json","graph_json":"https://pith.science/api/pith-number/AJCLF7BGH22K5RGSKKHJAKOK3N/graph.json","events_json":"https://pith.science/api/pith-number/AJCLF7BGH22K5RGSKKHJAKOK3N/events.json","paper":"https://pith.science/paper/AJCLF7BG"},"agent_actions":{"view_html":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N","download_json":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N.json","view_paper":"https://pith.science/paper/AJCLF7BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08151&json=true","fetch_graph":"https://pith.science/api/pith-number/AJCLF7BGH22K5RGSKKHJAKOK3N/graph.json","fetch_events":"https://pith.science/api/pith-number/AJCLF7BGH22K5RGSKKHJAKOK3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N/action/storage_attestation","attest_author":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N/action/author_attestation","sign_citation":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N/action/citation_signature","submit_replication":"https://pith.science/pith/AJCLF7BGH22K5RGSKKHJAKOK3N/action/replication_record"}},"created_at":"2026-05-18T01:18:13.110992+00:00","updated_at":"2026-05-18T01:18:13.110992+00:00"}