{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IFACHY6XZEBOZLZ7RUFNJWTSCU","short_pith_number":"pith:IFACHY6X","schema_version":"1.0","canonical_sha256":"414023e3d7c902ecaf3f8d0ad4da721503f01c44b522e2581eafde0d4fbcd8bd","source":{"kind":"arxiv","id":"1802.05471","version":2},"attestation_state":"computed","paper":{"title":"Smooth heaps and a dual view of self-adjusting data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma, Thatchaphol Saranurak","submitted_at":"2018-02-15T10:45:34Z","abstract_excerpt":"We present a new connection between self-adjusting binary search trees (BSTs) and heaps, two fundamental, extensively studied, and practically relevant families of data structures. Roughly speaking, we map an arbitrary heap algorithm within a natural model, to a corresponding BST algorithm with the same cost on a dual sequence of operations (i.e. the same sequence with the roles of time and key-space switched). This is the first general transformation between the two families of data structures.\n  There is a rich theory of dynamic optimality for BSTs (i.e. the theory of competitiveness between"},"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":"1802.05471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T10:45:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bb32c90dbf413dc68146cc55332e59603e32d80019b7bc79785a05d538047306","abstract_canon_sha256":"d9781dd680592d238bb4cced8ad73813237e7ee34ed5e20228d21d462ca06c59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.401495Z","signature_b64":"IOf5HTb5oE9Oj9BWboWiyGkZgr/yOaYStF1dgejMRI+vz+/9KLYargVPoVP9jXzbRKiO6oM5ALMZxHqUjnvcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414023e3d7c902ecaf3f8d0ad4da721503f01c44b522e2581eafde0d4fbcd8bd","last_reissued_at":"2026-05-17T23:57:15.400839Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.400839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth heaps and a dual view of self-adjusting data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma, Thatchaphol Saranurak","submitted_at":"2018-02-15T10:45:34Z","abstract_excerpt":"We present a new connection between self-adjusting binary search trees (BSTs) and heaps, two fundamental, extensively studied, and practically relevant families of data structures. Roughly speaking, we map an arbitrary heap algorithm within a natural model, to a corresponding BST algorithm with the same cost on a dual sequence of operations (i.e. the same sequence with the roles of time and key-space switched). This is the first general transformation between the two families of data structures.\n  There is a rich theory of dynamic optimality for BSTs (i.e. the theory of competitiveness between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05471","kind":"arxiv","version":2},"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":"1802.05471","created_at":"2026-05-17T23:57:15.400917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05471v2","created_at":"2026-05-17T23:57:15.400917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05471","created_at":"2026-05-17T23:57:15.400917+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFACHY6XZEBO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFACHY6XZEBOZLZ7","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFACHY6X","created_at":"2026-05-18T12:32:28.185984+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/IFACHY6XZEBOZLZ7RUFNJWTSCU","json":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU.json","graph_json":"https://pith.science/api/pith-number/IFACHY6XZEBOZLZ7RUFNJWTSCU/graph.json","events_json":"https://pith.science/api/pith-number/IFACHY6XZEBOZLZ7RUFNJWTSCU/events.json","paper":"https://pith.science/paper/IFACHY6X"},"agent_actions":{"view_html":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU","download_json":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU.json","view_paper":"https://pith.science/paper/IFACHY6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05471&json=true","fetch_graph":"https://pith.science/api/pith-number/IFACHY6XZEBOZLZ7RUFNJWTSCU/graph.json","fetch_events":"https://pith.science/api/pith-number/IFACHY6XZEBOZLZ7RUFNJWTSCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/action/storage_attestation","attest_author":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/action/author_attestation","sign_citation":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/action/citation_signature","submit_replication":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/action/replication_record"}},"created_at":"2026-05-17T23:57:15.400917+00:00","updated_at":"2026-05-17T23:57:15.400917+00:00"}