{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FTCYEDTUESOVY5LMDJ4SGA7CWW","short_pith_number":"pith:FTCYEDTU","schema_version":"1.0","canonical_sha256":"2cc5820e74249d5c756c1a792303e2b5a27eb9a3848389fae0a2fc110a44c899","source":{"kind":"arxiv","id":"1509.06948","version":1},"attestation_state":"computed","paper":{"title":"Dynamic concurrent van Emde Boas array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konrad Ku{\\l}akowski","submitted_at":"2015-09-23T12:53:59Z","abstract_excerpt":"The growing popularity of shared-memory multiprocessor machines has caused significant changes in the design of concurrent software. In this approach, the concurrently running threads communicate and synchronize with each other through data structures in shared memory. Hence, the efficiency of these structures is essential for the performance of concurrent applications. The need to find new concurrent data structures prompted the author some time ago to propose the cvEB array modeled on the van Emde Boas Tree structure as a dynamic set alternative. This paper describes an improved version of t"},"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":"1509.06948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-23T12:53:59Z","cross_cats_sorted":[],"title_canon_sha256":"33d786c7fbf0cac3d2129a255b18f8bab7ee8ede7afc1d0953b3003c6074d218","abstract_canon_sha256":"e09ee620baf54ab22a940a000c0de55fe93235cff1ba0aede1bd0dabb2869831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:17.430520Z","signature_b64":"wlC7uHdTZNDt7m//tQDSQnAZDkNofjnFf+avh1OsHGuZsHgkj6BeXsi7gPFsCbJust321EuelLHC6AoReK52AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc5820e74249d5c756c1a792303e2b5a27eb9a3848389fae0a2fc110a44c899","last_reissued_at":"2026-05-18T01:32:17.429769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:17.429769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic concurrent van Emde Boas array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konrad Ku{\\l}akowski","submitted_at":"2015-09-23T12:53:59Z","abstract_excerpt":"The growing popularity of shared-memory multiprocessor machines has caused significant changes in the design of concurrent software. In this approach, the concurrently running threads communicate and synchronize with each other through data structures in shared memory. Hence, the efficiency of these structures is essential for the performance of concurrent applications. The need to find new concurrent data structures prompted the author some time ago to propose the cvEB array modeled on the van Emde Boas Tree structure as a dynamic set alternative. This paper describes an improved version of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06948","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":"1509.06948","created_at":"2026-05-18T01:32:17.429865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06948v1","created_at":"2026-05-18T01:32:17.429865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06948","created_at":"2026-05-18T01:32:17.429865+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTCYEDTUESOV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTCYEDTUESOVY5LM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTCYEDTU","created_at":"2026-05-18T12:29:22.688609+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/FTCYEDTUESOVY5LMDJ4SGA7CWW","json":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW.json","graph_json":"https://pith.science/api/pith-number/FTCYEDTUESOVY5LMDJ4SGA7CWW/graph.json","events_json":"https://pith.science/api/pith-number/FTCYEDTUESOVY5LMDJ4SGA7CWW/events.json","paper":"https://pith.science/paper/FTCYEDTU"},"agent_actions":{"view_html":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW","download_json":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW.json","view_paper":"https://pith.science/paper/FTCYEDTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06948&json=true","fetch_graph":"https://pith.science/api/pith-number/FTCYEDTUESOVY5LMDJ4SGA7CWW/graph.json","fetch_events":"https://pith.science/api/pith-number/FTCYEDTUESOVY5LMDJ4SGA7CWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW/action/storage_attestation","attest_author":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW/action/author_attestation","sign_citation":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW/action/citation_signature","submit_replication":"https://pith.science/pith/FTCYEDTUESOVY5LMDJ4SGA7CWW/action/replication_record"}},"created_at":"2026-05-18T01:32:17.429865+00:00","updated_at":"2026-05-18T01:32:17.429865+00:00"}