{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IFACHY6XZEBOZLZ7RUFNJWTSCU","short_pith_number":"pith:IFACHY6X","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"},"canonical_sha256":"414023e3d7c902ecaf3f8d0ad4da721503f01c44b522e2581eafde0d4fbcd8bd","source":{"kind":"arxiv","id":"1802.05471","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IFACHY6XZEBOZLZ7RUFNJWTSCU","target":"record","payload":{"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"},"canonical_sha256":"414023e3d7c902ecaf3f8d0ad4da721503f01c44b522e2581eafde0d4fbcd8bd","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"},"source_kind":"arxiv","source_id":"1802.05471","source_version":2,"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-17T23:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHaoUMwpWgnA3vzvkCIEztCTZ9K4tpdVCOy9wKwpiPU46eWHZp3D95KnwS0yUjSM4EUzBxX4hZpXJ/N5WSf5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:58:43.002463Z"},"content_sha256":"90cc344ca78da21c9e9cc16f520c97897aaf2cfa22aa4ae640a0f3a8b7085c88","schema_version":"1.0","event_id":"sha256:90cc344ca78da21c9e9cc16f520c97897aaf2cfa22aa4ae640a0f3a8b7085c88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IFACHY6XZEBOZLZ7RUFNJWTSCU","target":"graph","payload":{"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"},"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-17T23:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pEVuzUokjiFJY8NBrKuPWApWBH9wcmPUOlCdZDmIQvMfeL1UTabMOm+ofiEXDK+H/jizUAR1JMkitws3I9LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:58:43.003119Z"},"content_sha256":"07c2d2e6cbb8e05482040e9c9e6696dd7aac572f19e7de80d3aa828d37e09c40","schema_version":"1.0","event_id":"sha256:07c2d2e6cbb8e05482040e9c9e6696dd7aac572f19e7de80d3aa828d37e09c40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/bundle.json","state_url":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/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-06-03T10:58:43Z","links":{"resolver":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU","bundle":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/bundle.json","state":"https://pith.science/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFACHY6XZEBOZLZ7RUFNJWTSCU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZEebcGN1fIYE70IpQUkx0XeorSKv+hWuYAbBYugdcVi+Zb6fWDpiJDt6OYPH+SJB0t0hF/CmlwDV3m2rWUZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:58:43.006185Z","bundle_sha256":"33cf06f8334bd9e88a9a9241f45d09d71e0da27345599e82f14563267e8580af"}}