{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6PSXPBVAIPP5LGRHE7UL6ZR2GA","short_pith_number":"pith:6PSXPBVA","schema_version":"1.0","canonical_sha256":"f3e57786a043dfd59a2727e8bf663a30200c5211f1f5ee104c41b537bef3546f","source":{"kind":"arxiv","id":"1704.05682","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.05682","created_at":"2026-05-18T00:46:06.799001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05682v1","created_at":"2026-05-18T00:46:06.799001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05682","created_at":"2026-05-18T00:46:06.799001+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PSXPBVAIPP5","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PSXPBVAIPP5LGRH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PSXPBVA","created_at":"2026-05-18T12:31:03.183658+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/6PSXPBVAIPP5LGRHE7UL6ZR2GA","json":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA.json","graph_json":"https://pith.science/api/pith-number/6PSXPBVAIPP5LGRHE7UL6ZR2GA/graph.json","events_json":"https://pith.science/api/pith-number/6PSXPBVAIPP5LGRHE7UL6ZR2GA/events.json","paper":"https://pith.science/paper/6PSXPBVA"},"agent_actions":{"view_html":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA","download_json":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA.json","view_paper":"https://pith.science/paper/6PSXPBVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05682&json=true","fetch_graph":"https://pith.science/api/pith-number/6PSXPBVAIPP5LGRHE7UL6ZR2GA/graph.json","fetch_events":"https://pith.science/api/pith-number/6PSXPBVAIPP5LGRHE7UL6ZR2GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/action/storage_attestation","attest_author":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/action/author_attestation","sign_citation":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/action/citation_signature","submit_replication":"https://pith.science/pith/6PSXPBVAIPP5LGRHE7UL6ZR2GA/action/replication_record"}},"created_at":"2026-05-18T00:46:06.799001+00:00","updated_at":"2026-05-18T00:46:06.799001+00:00"}