{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BLEZPE27P5GKK4V45YAGFUAG6A","short_pith_number":"pith:BLEZPE27","schema_version":"1.0","canonical_sha256":"0ac997935f7f4ca572bcee0062d006f00c55b9ef241bdf4e98610125e98cbab1","source":{"kind":"arxiv","id":"1711.00275","version":1},"attestation_state":"computed","paper":{"title":"Fast Dynamic Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Roy Christiansen, Inge Li G{\\o}rtz, Mikko Berggren Ettienne, Philip Bille","submitted_at":"2017-11-01T10:31:32Z","abstract_excerpt":"We present a highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of $n$ elements supporting access in time $O(1)$ and insertion and deletion in time $O(n^\\epsilon)$ for $\\epsilon > 0$ while using $o(n)$ extra space. We consider several different implementation optimizations in C++ and compare their performance to that of vector and multiset from the standard library on sequences with up to $10^8$ elements. Our fastest implementation uses much less space than multiset while providing speedups of $40\\times$ for access operations compared to multiset and"},"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":"1711.00275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:31:32Z","cross_cats_sorted":[],"title_canon_sha256":"5becbe531a60b0c28ba1e22cb1aef9788d12dd253524738ede7e0cd8b911dd6b","abstract_canon_sha256":"fbb1f04f4582d33d3b8e1f6d0219116ff3b517b3a9e65bdf9b2c462da58d2348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:34.568999Z","signature_b64":"LNAOObvObYEwcR0DgzCU32Ivpf56AIiRKcMx0BFP9XObR5IH2WhLSGNbDNJKHJfrZAQ/yqRCTQzHefs/ZgHDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac997935f7f4ca572bcee0062d006f00c55b9ef241bdf4e98610125e98cbab1","last_reissued_at":"2026-05-18T00:31:34.568359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:34.568359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Dynamic Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Roy Christiansen, Inge Li G{\\o}rtz, Mikko Berggren Ettienne, Philip Bille","submitted_at":"2017-11-01T10:31:32Z","abstract_excerpt":"We present a highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of $n$ elements supporting access in time $O(1)$ and insertion and deletion in time $O(n^\\epsilon)$ for $\\epsilon > 0$ while using $o(n)$ extra space. We consider several different implementation optimizations in C++ and compare their performance to that of vector and multiset from the standard library on sequences with up to $10^8$ elements. Our fastest implementation uses much less space than multiset while providing speedups of $40\\times$ for access operations compared to multiset and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00275","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":"1711.00275","created_at":"2026-05-18T00:31:34.568467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00275v1","created_at":"2026-05-18T00:31:34.568467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00275","created_at":"2026-05-18T00:31:34.568467+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLEZPE27P5GK","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLEZPE27P5GKK4V4","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLEZPE27","created_at":"2026-05-18T12:31:08.081275+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/BLEZPE27P5GKK4V45YAGFUAG6A","json":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A.json","graph_json":"https://pith.science/api/pith-number/BLEZPE27P5GKK4V45YAGFUAG6A/graph.json","events_json":"https://pith.science/api/pith-number/BLEZPE27P5GKK4V45YAGFUAG6A/events.json","paper":"https://pith.science/paper/BLEZPE27"},"agent_actions":{"view_html":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A","download_json":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A.json","view_paper":"https://pith.science/paper/BLEZPE27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00275&json=true","fetch_graph":"https://pith.science/api/pith-number/BLEZPE27P5GKK4V45YAGFUAG6A/graph.json","fetch_events":"https://pith.science/api/pith-number/BLEZPE27P5GKK4V45YAGFUAG6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/action/storage_attestation","attest_author":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/action/author_attestation","sign_citation":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/action/citation_signature","submit_replication":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/action/replication_record"}},"created_at":"2026-05-18T00:31:34.568467+00:00","updated_at":"2026-05-18T00:31:34.568467+00:00"}