{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IFACHY6XZEBOZLZ7RUFNJWTSCU","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":"d9781dd680592d238bb4cced8ad73813237e7ee34ed5e20228d21d462ca06c59","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T10:45:34Z","title_canon_sha256":"bb32c90dbf413dc68146cc55332e59603e32d80019b7bc79785a05d538047306"},"schema_version":"1.0","source":{"id":"1802.05471","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05471","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05471v2","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05471","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"IFACHY6XZEBO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IFACHY6XZEBOZLZ7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IFACHY6X","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:07c2d2e6cbb8e05482040e9c9e6696dd7aac572f19e7de80d3aa828d37e09c40","target":"graph","created_at":"2026-05-17T23:57:15Z","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 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","authors_text":"L\\'aszl\\'o Kozma, Thatchaphol Saranurak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T10:45:34Z","title":"Smooth heaps and a dual view of self-adjusting data structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05471","kind":"arxiv","version":2},"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:90cc344ca78da21c9e9cc16f520c97897aaf2cfa22aa4ae640a0f3a8b7085c88","target":"record","created_at":"2026-05-17T23:57:15Z","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":"d9781dd680592d238bb4cced8ad73813237e7ee34ed5e20228d21d462ca06c59","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-15T10:45:34Z","title_canon_sha256":"bb32c90dbf413dc68146cc55332e59603e32d80019b7bc79785a05d538047306"},"schema_version":"1.0","source":{"id":"1802.05471","kind":"arxiv","version":2}},"canonical_sha256":"414023e3d7c902ecaf3f8d0ad4da721503f01c44b522e2581eafde0d4fbcd8bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"414023e3d7c902ecaf3f8d0ad4da721503f01c44b522e2581eafde0d4fbcd8bd","first_computed_at":"2026-05-17T23:57:15.400839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:15.400839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IOf5HTb5oE9Oj9BWboWiyGkZgr/yOaYStF1dgejMRI+vz+/9KLYargVPoVP9jXzbRKiO6oM5ALMZxHqUjnvcCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:15.401495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05471","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90cc344ca78da21c9e9cc16f520c97897aaf2cfa22aa4ae640a0f3a8b7085c88","sha256:07c2d2e6cbb8e05482040e9c9e6696dd7aac572f19e7de80d3aa828d37e09c40"],"state_sha256":"6e41fd286e5b1d30a9a10c32e6b8f3ed9b91611b35646837d1fd0c0e7a82b1d5"}