{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6PSXPBVAIPP5LGRHE7UL6ZR2GA","short_pith_number":"pith:6PSXPBVA","canonical_record":{"source":{"id":"1704.05682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T10:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"36f11fa7a517d2aebaa601947638608ad4d9dbf3612da9a3d802d3b37d9e548e","abstract_canon_sha256":"a2ce624c76ab4ffef37047ae78870469f2ae045052c766b5399e7e5114f90821"},"schema_version":"1.0"},"canonical_sha256":"f3e57786a043dfd59a2727e8bf663a30200c5211f1f5ee104c41b537bef3546f","source":{"kind":"arxiv","id":"1704.05682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05682","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05682v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05682","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"6PSXPBVAIPP5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6PSXPBVAIPP5LGRH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6PSXPBVA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6PSXPBVAIPP5LGRHE7UL6ZR2GA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T10:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"36f11fa7a517d2aebaa601947638608ad4d9dbf3612da9a3d802d3b37d9e548e","abstract_canon_sha256":"a2ce624c76ab4ffef37047ae78870469f2ae045052c766b5399e7e5114f90821"},"schema_version":"1.0"},"canonical_sha256":"f3e57786a043dfd59a2727e8bf663a30200c5211f1f5ee104c41b537bef3546f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.799514Z","signature_b64":"LboCLbMbh5oq4z/LA7FuZemAUH35k9FHNTfTwS3SkCGjWBHvRmJBxviaqQmlj0nCAKOUXfS6r5/blMVIH/tXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3e57786a043dfd59a2727e8bf663a30200c5211f1f5ee104c41b537bef3546f","last_reissued_at":"2026-05-18T00:46:06.798885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.798885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05682","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:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVr6dwmFtPaumbAbWt/y+vKIm6bIPbZGNdVGrEympqsGO8plPrR9gAjDGh6uCcPLHjd8CMZkql6liDiZQOuQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:32:14.311269Z"},"content_sha256":"d7de51f818b67266eca807069600b4b0f821ba2effbed4e799932c0978fa3926","schema_version":"1.0","event_id":"sha256:d7de51f818b67266eca807069600b4b0f821ba2effbed4e799932c0978fa3926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6PSXPBVAIPP5LGRHE7UL6ZR2GA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"m-Bonsai: a Practical Compact Dynamic Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Poyias, Rajeev Raman, Simon J. Puglisi","submitted_at":"2017-04-19T10:45:05Z","abstract_excerpt":"We consider the problem of implementing a space-efficient dynamic trie, with an emphasis on good practical performance. For a trie with $n$ nodes with an alphabet of size $\\sigma$, the information-theoretic lower bound is $n \\log \\sigma + O(n)$ bits. The Bonsai data structure is a compact trie proposed by Darragh et al. (Softw., Pract. Exper. 23(3), 1993, p. 277-291). Its disadvantages include the user having to specify an upper bound $M$ on the trie size in advance (which cannot be changed easily after initalization), a space usage of $M \\log \\sigma + O(M \\log \\log M)$ (which is asymptoticall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05682","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:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmcsHUAl7uLsFsLwpBQQ42c3Ti6ZScWpxkfeYDfy6HqzT1jh9yIX/ikSeePoTSwQIMs2w1d4PvPjjxk0kS/PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:32:14.311639Z"},"content_sha256":"5a3249ebfbf130155c294adde6d738627b46d551715c692ce4c0198cde98a7df","schema_version":"1.0","event_id":"sha256:5a3249ebfbf130155c294adde6d738627b46d551715c692ce4c0198cde98a7df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/bundle.json","state_url":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/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-03T22:32:14Z","links":{"resolver":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA","bundle":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/bundle.json","state":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6PSXPBVAIPP5LGRHE7UL6ZR2GA","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":"a2ce624c76ab4ffef37047ae78870469f2ae045052c766b5399e7e5114f90821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T10:45:05Z","title_canon_sha256":"36f11fa7a517d2aebaa601947638608ad4d9dbf3612da9a3d802d3b37d9e548e"},"schema_version":"1.0","source":{"id":"1704.05682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05682","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05682v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05682","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"6PSXPBVAIPP5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6PSXPBVAIPP5LGRH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6PSXPBVA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:5a3249ebfbf130155c294adde6d738627b46d551715c692ce4c0198cde98a7df","target":"graph","created_at":"2026-05-18T00:46:06Z","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 consider the problem of implementing a space-efficient dynamic trie, with an emphasis on good practical performance. For a trie with $n$ nodes with an alphabet of size $\\sigma$, the information-theoretic lower bound is $n \\log \\sigma + O(n)$ bits. The Bonsai data structure is a compact trie proposed by Darragh et al. (Softw., Pract. Exper. 23(3), 1993, p. 277-291). Its disadvantages include the user having to specify an upper bound $M$ on the trie size in advance (which cannot be changed easily after initalization), a space usage of $M \\log \\sigma + O(M \\log \\log M)$ (which is asymptoticall","authors_text":"Andreas Poyias, Rajeev Raman, Simon J. Puglisi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T10:45:05Z","title":"m-Bonsai: a Practical Compact Dynamic Trie"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05682","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:d7de51f818b67266eca807069600b4b0f821ba2effbed4e799932c0978fa3926","target":"record","created_at":"2026-05-18T00:46:06Z","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":"a2ce624c76ab4ffef37047ae78870469f2ae045052c766b5399e7e5114f90821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T10:45:05Z","title_canon_sha256":"36f11fa7a517d2aebaa601947638608ad4d9dbf3612da9a3d802d3b37d9e548e"},"schema_version":"1.0","source":{"id":"1704.05682","kind":"arxiv","version":1}},"canonical_sha256":"f3e57786a043dfd59a2727e8bf663a30200c5211f1f5ee104c41b537bef3546f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3e57786a043dfd59a2727e8bf663a30200c5211f1f5ee104c41b537bef3546f","first_computed_at":"2026-05-18T00:46:06.798885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:06.798885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LboCLbMbh5oq4z/LA7FuZemAUH35k9FHNTfTwS3SkCGjWBHvRmJBxviaqQmlj0nCAKOUXfS6r5/blMVIH/tXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:06.799514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7de51f818b67266eca807069600b4b0f821ba2effbed4e799932c0978fa3926","sha256:5a3249ebfbf130155c294adde6d738627b46d551715c692ce4c0198cde98a7df"],"state_sha256":"606dfbde22b5230d56cf088077db568fb9fbb36b3a65c006d708ddd5d895c615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cF6zAPG/gNG1e3OnGA3L56cgevjyfBcOXNS0ykIyQ2bZxJEglvkRwFCAGcE8sni8Sv96tLkdiscQoNRr0B4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:32:14.313665Z","bundle_sha256":"46351f0e20a32fd95a52b3f751204981beab2e17f8a6d0be658e38c7f08879f0"}}