{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5VBVZQ3W2K2ECCLODXEOJFS4Y7","short_pith_number":"pith:5VBVZQ3W","schema_version":"1.0","canonical_sha256":"ed435cc376d2b441096e1dc8e4965cc7f6d7bd767d6d01cf78323b868110f1c1","source":{"kind":"arxiv","id":"1905.05254","version":3},"attestation_state":"computed","paper":{"title":"Optimal Multithreaded Batch-Parallel 2-3 Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Wei Quan Lim","submitted_at":"2019-05-13T19:23:36Z","abstract_excerpt":"This paper presents a batch-parallel 2-3 tree T in an asynchronous dynamic multithreading model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the restrictive QRMW (queued read-modify-write) memory contention model where concurrent accesses to the same memory location are queued and serviced one by one.\n  Specifically, if T has n items, then performing an item-sorted batch (given as a leaf-based balanced binary tree) of b operations on T takes O( b * log(n/b+1) + b ) work and O( log b + log n ) span (in the worst case as b"},"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":"1905.05254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-13T19:23:36Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9642baa5f89b8f1d5b7bf24b40325fe5cf191689312d6bd6adb292db0a7e87f2","abstract_canon_sha256":"fbdfb085b0f162ffe2b956d3cd3d089236ec4440dc2d8c9abeb094cb1bc5fc4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:39.053694Z","signature_b64":"MA1JVw642iMb8FbX+zrL6uL1Mx4Au4OM0FPtT+kY2hQrfslGPi0NZNtLIayyqqno4W5tD5WCwZHALqssFnIEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed435cc376d2b441096e1dc8e4965cc7f6d7bd767d6d01cf78323b868110f1c1","last_reissued_at":"2026-07-05T03:24:39.053294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:39.053294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Multithreaded Batch-Parallel 2-3 Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Wei Quan Lim","submitted_at":"2019-05-13T19:23:36Z","abstract_excerpt":"This paper presents a batch-parallel 2-3 tree T in an asynchronous dynamic multithreading model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the restrictive QRMW (queued read-modify-write) memory contention model where concurrent accesses to the same memory location are queued and serviced one by one.\n  Specifically, if T has n items, then performing an item-sorted batch (given as a leaf-based balanced binary tree) of b operations on T takes O( b * log(n/b+1) + b ) work and O( log b + log n ) span (in the worst case as b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05254","kind":"arxiv","version":3},"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/1905.05254/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":"1905.05254","created_at":"2026-07-05T03:24:39.053357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05254v3","created_at":"2026-07-05T03:24:39.053357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05254","created_at":"2026-07-05T03:24:39.053357+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VBVZQ3W2K2E","created_at":"2026-07-05T03:24:39.053357+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VBVZQ3W2K2ECCLO","created_at":"2026-07-05T03:24:39.053357+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VBVZQ3W","created_at":"2026-07-05T03:24:39.053357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02741","citing_title":"Parallel Finger Search Structures","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7","json":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7.json","graph_json":"https://pith.science/api/pith-number/5VBVZQ3W2K2ECCLODXEOJFS4Y7/graph.json","events_json":"https://pith.science/api/pith-number/5VBVZQ3W2K2ECCLODXEOJFS4Y7/events.json","paper":"https://pith.science/paper/5VBVZQ3W"},"agent_actions":{"view_html":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7","download_json":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7.json","view_paper":"https://pith.science/paper/5VBVZQ3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05254&json=true","fetch_graph":"https://pith.science/api/pith-number/5VBVZQ3W2K2ECCLODXEOJFS4Y7/graph.json","fetch_events":"https://pith.science/api/pith-number/5VBVZQ3W2K2ECCLODXEOJFS4Y7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7/action/storage_attestation","attest_author":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7/action/author_attestation","sign_citation":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7/action/citation_signature","submit_replication":"https://pith.science/pith/5VBVZQ3W2K2ECCLODXEOJFS4Y7/action/replication_record"}},"created_at":"2026-07-05T03:24:39.053357+00:00","updated_at":"2026-07-05T03:24:39.053357+00:00"}