{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K3YOSFRV5RXTYVN7YNTBZMH5LQ","short_pith_number":"pith:K3YOSFRV","schema_version":"1.0","canonical_sha256":"56f0e91635ec6f3c55bfc3661cb0fd5c35adfc858081bbef71b6a222add70652","source":{"kind":"arxiv","id":"1910.07849","version":2},"attestation_state":"computed","paper":{"title":"Engineering Top-Down Weight-Balanced Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Lukas Barth","submitted_at":"2019-10-17T12:15:09Z","abstract_excerpt":"Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance annotated trees.\n  While usual weight-balanced trees perform their balancing operations in a bottom-up fashion after a modification to the tree is completed, there exists a top-down variant which performs these balancing operations during descend. This variant has so far received only little attention. We provide an in-depth analysis and engineering of these top-down weight-balanced trees, demonstrating their superio"},"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":"1910.07849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T12:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"076a7410f82a016fed807ad5f3fb5d6e3e15a4c3d49c27a121dd8609d5c4659f","abstract_canon_sha256":"d08e2aacce944d1eaefa22897d974c611aba0f90bbcb25192ef384370346f489"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:14.800391Z","signature_b64":"NxZkjw5uj8hzyhmpHSwZr/fCJ0NNXnC9WStMEgCD+hM/CFMr+1D3SowvZiUhugJLkjK6aPpCzxZ9iaSbh329AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56f0e91635ec6f3c55bfc3661cb0fd5c35adfc858081bbef71b6a222add70652","last_reissued_at":"2026-07-05T00:39:14.799925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:14.799925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Engineering Top-Down Weight-Balanced Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Lukas Barth","submitted_at":"2019-10-17T12:15:09Z","abstract_excerpt":"Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance annotated trees.\n  While usual weight-balanced trees perform their balancing operations in a bottom-up fashion after a modification to the tree is completed, there exists a top-down variant which performs these balancing operations during descend. This variant has so far received only little attention. We provide an in-depth analysis and engineering of these top-down weight-balanced trees, demonstrating their superio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.07849","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.07849/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.07849","created_at":"2026-07-05T00:39:14.799991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.07849v2","created_at":"2026-07-05T00:39:14.799991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.07849","created_at":"2026-07-05T00:39:14.799991+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3YOSFRV5RXT","created_at":"2026-07-05T00:39:14.799991+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3YOSFRV5RXTYVN7","created_at":"2026-07-05T00:39:14.799991+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3YOSFRV","created_at":"2026-07-05T00:39:14.799991+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/K3YOSFRV5RXTYVN7YNTBZMH5LQ","json":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ.json","graph_json":"https://pith.science/api/pith-number/K3YOSFRV5RXTYVN7YNTBZMH5LQ/graph.json","events_json":"https://pith.science/api/pith-number/K3YOSFRV5RXTYVN7YNTBZMH5LQ/events.json","paper":"https://pith.science/paper/K3YOSFRV"},"agent_actions":{"view_html":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ","download_json":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ.json","view_paper":"https://pith.science/paper/K3YOSFRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.07849&json=true","fetch_graph":"https://pith.science/api/pith-number/K3YOSFRV5RXTYVN7YNTBZMH5LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/K3YOSFRV5RXTYVN7YNTBZMH5LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ/action/storage_attestation","attest_author":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ/action/author_attestation","sign_citation":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ/action/citation_signature","submit_replication":"https://pith.science/pith/K3YOSFRV5RXTYVN7YNTBZMH5LQ/action/replication_record"}},"created_at":"2026-07-05T00:39:14.799991+00:00","updated_at":"2026-07-05T00:39:14.799991+00:00"}