{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BLEZPE27P5GKK4V45YAGFUAG6A","short_pith_number":"pith:BLEZPE27","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"},"canonical_sha256":"0ac997935f7f4ca572bcee0062d006f00c55b9ef241bdf4e98610125e98cbab1","source":{"kind":"arxiv","id":"1711.00275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00275","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00275v1","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00275","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"pith_short_12","alias_value":"BLEZPE27P5GK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BLEZPE27P5GKK4V4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BLEZPE27","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BLEZPE27P5GKK4V45YAGFUAG6A","target":"record","payload":{"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"},"canonical_sha256":"0ac997935f7f4ca572bcee0062d006f00c55b9ef241bdf4e98610125e98cbab1","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"},"source_kind":"arxiv","source_id":"1711.00275","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfCK9IZvv/qutxZLrNLcnhmfhPPDS1hjUK+hPYI0lDui+fcTT3VJQtoBPYS7FGnuduwXv76d3YSLkaR54lh/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:04:28.862741Z"},"content_sha256":"46b46f7507efb55c855e7165deb7023252aca0fdc7db38a9d7ca4160d999a422","schema_version":"1.0","event_id":"sha256:46b46f7507efb55c855e7165deb7023252aca0fdc7db38a9d7ca4160d999a422"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BLEZPE27P5GKK4V45YAGFUAG6A","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ag8h8zBzmQrzlZJ+RGG7kaEhHf/RADPpGDxlg321FtaANUB8JMukEM7MGqgti3pY7T4BLKADM1UmVc1OAXhyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:04:28.863776Z"},"content_sha256":"19d8183fb565d212c2020183570dd9497418c6116edcdd70c337245f10823f87","schema_version":"1.0","event_id":"sha256:19d8183fb565d212c2020183570dd9497418c6116edcdd70c337245f10823f87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/bundle.json","state_url":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLEZPE27P5GKK4V45YAGFUAG6A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T09:04:28Z","links":{"resolver":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A","bundle":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/bundle.json","state":"https://pith.science/pith/BLEZPE27P5GKK4V45YAGFUAG6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLEZPE27P5GKK4V45YAGFUAG6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BLEZPE27P5GKK4V45YAGFUAG6A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbb1f04f4582d33d3b8e1f6d0219116ff3b517b3a9e65bdf9b2c462da58d2348","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:31:32Z","title_canon_sha256":"5becbe531a60b0c28ba1e22cb1aef9788d12dd253524738ede7e0cd8b911dd6b"},"schema_version":"1.0","source":{"id":"1711.00275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00275","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00275v1","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00275","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"pith_short_12","alias_value":"BLEZPE27P5GK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BLEZPE27P5GKK4V4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BLEZPE27","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:19d8183fb565d212c2020183570dd9497418c6116edcdd70c337245f10823f87","target":"graph","created_at":"2026-05-18T00:31:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anders Roy Christiansen, Inge Li G{\\o}rtz, Mikko Berggren Ettienne, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:31:32Z","title":"Fast Dynamic Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00275","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:46b46f7507efb55c855e7165deb7023252aca0fdc7db38a9d7ca4160d999a422","target":"record","created_at":"2026-05-18T00:31:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbb1f04f4582d33d3b8e1f6d0219116ff3b517b3a9e65bdf9b2c462da58d2348","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:31:32Z","title_canon_sha256":"5becbe531a60b0c28ba1e22cb1aef9788d12dd253524738ede7e0cd8b911dd6b"},"schema_version":"1.0","source":{"id":"1711.00275","kind":"arxiv","version":1}},"canonical_sha256":"0ac997935f7f4ca572bcee0062d006f00c55b9ef241bdf4e98610125e98cbab1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ac997935f7f4ca572bcee0062d006f00c55b9ef241bdf4e98610125e98cbab1","first_computed_at":"2026-05-18T00:31:34.568359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:34.568359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LNAOObvObYEwcR0DgzCU32Ivpf56AIiRKcMx0BFP9XObR5IH2WhLSGNbDNJKHJfrZAQ/yqRCTQzHefs/ZgHDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:34.568999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46b46f7507efb55c855e7165deb7023252aca0fdc7db38a9d7ca4160d999a422","sha256:19d8183fb565d212c2020183570dd9497418c6116edcdd70c337245f10823f87"],"state_sha256":"dc9ecebfc1e9a626155a8deddd1ff19fefd6327f1b6d27514e1f2763d9425159"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R41Fzn3d2SKLz1a6qyBqGXjuOJGpXPOWoy6dR5iols52GgDRY+xjipgo0Vg7LqCP380sJz/RBh2FR582HPBJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:04:28.867920Z","bundle_sha256":"18c8875a3539000207054b670ad8afe3ebd024f60c55a0d237de6eb4f8da0675"}}