{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UNS5RYQDEJ445RHYZ4WR7TWAWM","short_pith_number":"pith:UNS5RYQD","schema_version":"1.0","canonical_sha256":"a365d8e2032279cec4f8cf2d1fcec0b3390c807a8d8ae986484afa53946e1c15","source":{"kind":"arxiv","id":"1407.7917","version":1},"attestation_state":"computed","paper":{"title":"Top-Down Skiplists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luis Barba, Pat Morin","submitted_at":"2014-07-30T01:24:34Z","abstract_excerpt":"We describe todolists (top-down skiplists), a variant of skiplists (Pugh 1990) that can execute searches using at most $\\log_{2-\\varepsilon} n + O(1)$ binary comparisons per search and that have amortized update time $O(\\varepsilon^{-1}\\log n)$. A variant of todolists, called working-todolists, can execute a search for any element $x$ using $\\log_{2-\\varepsilon} w(x) + o(\\log w(x))$ binary comparisons and have amortized search time $O(\\varepsilon^{-1}\\log w(w))$. Here, $w(x)$ is the \"working-set number\" of $x$. No previous data structure is known to achieve a bound better than $4\\log_2 w(x)$ c"},"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":"1407.7917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T01:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"08d023813a3237305a7a2e47b4455583c771620dcf84b8f2c96537d78f7dbea2","abstract_canon_sha256":"88d0c3baff11b3bf273a1e69499486d9abd8c098ad320ec0966c4f1cbad9a56d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:14.191931Z","signature_b64":"jBWNrD1obA3rFBa5dyQuMFBjUNmtTTg1KftT5Tdx/wRYMAonbunRgxf2f+15z28HMtS6KuKsWXWyXiVagaegAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a365d8e2032279cec4f8cf2d1fcec0b3390c807a8d8ae986484afa53946e1c15","last_reissued_at":"2026-05-18T02:46:14.191203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:14.191203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-Down Skiplists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luis Barba, Pat Morin","submitted_at":"2014-07-30T01:24:34Z","abstract_excerpt":"We describe todolists (top-down skiplists), a variant of skiplists (Pugh 1990) that can execute searches using at most $\\log_{2-\\varepsilon} n + O(1)$ binary comparisons per search and that have amortized update time $O(\\varepsilon^{-1}\\log n)$. A variant of todolists, called working-todolists, can execute a search for any element $x$ using $\\log_{2-\\varepsilon} w(x) + o(\\log w(x))$ binary comparisons and have amortized search time $O(\\varepsilon^{-1}\\log w(w))$. Here, $w(x)$ is the \"working-set number\" of $x$. No previous data structure is known to achieve a bound better than $4\\log_2 w(x)$ c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7917","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":"1407.7917","created_at":"2026-05-18T02:46:14.191311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7917v1","created_at":"2026-05-18T02:46:14.191311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7917","created_at":"2026-05-18T02:46:14.191311+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNS5RYQDEJ44","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNS5RYQDEJ445RHY","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNS5RYQD","created_at":"2026-05-18T12:28:52.271510+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/UNS5RYQDEJ445RHYZ4WR7TWAWM","json":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM.json","graph_json":"https://pith.science/api/pith-number/UNS5RYQDEJ445RHYZ4WR7TWAWM/graph.json","events_json":"https://pith.science/api/pith-number/UNS5RYQDEJ445RHYZ4WR7TWAWM/events.json","paper":"https://pith.science/paper/UNS5RYQD"},"agent_actions":{"view_html":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM","download_json":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM.json","view_paper":"https://pith.science/paper/UNS5RYQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7917&json=true","fetch_graph":"https://pith.science/api/pith-number/UNS5RYQDEJ445RHYZ4WR7TWAWM/graph.json","fetch_events":"https://pith.science/api/pith-number/UNS5RYQDEJ445RHYZ4WR7TWAWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM/action/storage_attestation","attest_author":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM/action/author_attestation","sign_citation":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM/action/citation_signature","submit_replication":"https://pith.science/pith/UNS5RYQDEJ445RHYZ4WR7TWAWM/action/replication_record"}},"created_at":"2026-05-18T02:46:14.191311+00:00","updated_at":"2026-05-18T02:46:14.191311+00:00"}