{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6RTXAIWIXULEWZ2K6Z6ARYO3YT","short_pith_number":"pith:6RTXAIWI","schema_version":"1.0","canonical_sha256":"f4677022c8bd164b674af67c08e1dbc4cdc7f941a4747f43d1a469c8d6c68c02","source":{"kind":"arxiv","id":"1602.00422","version":1},"attestation_state":"computed","paper":{"title":"Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroki Arimura, Kunihiko Sadakane, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2016-02-01T08:17:52Z","abstract_excerpt":"In this paper, we present a new data structure called the packed compact trie (packed c-trie) which stores a set $S$ of $k$ strings of total length $n$ in $n \\log\\sigma + O(k \\log n)$ bits of space and supports fast pattern matching queries and updates, where $\\sigma$ is the size of an alphabet. Assume that $\\alpha = \\log_\\sigma n$ letters are packed in a single machine word on the standard word RAM model, and let $f(k,n)$ denote the query and update times of the dynamic predecessor/successor data structure of our choice which stores $k$ integers from universe $[1,n]$ in $O(k \\log n)$ bits of "},"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":"1602.00422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-01T08:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"3a168a8b4a9f829b925f1dd6e6033a69d67a42a5b7d4b3e0b8836076b3079616","abstract_canon_sha256":"7ba561f1ee2f7f3c3da994c20640b6d98c797e2728e3fc16aa332d53521c9ddd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:24.003483Z","signature_b64":"vdkAc0SOxW269dQgMtE02889PQzhb7bFfJivKDr781b1+8q0dBQIT0MVUNup1oxIKw+8eL0GVry8zR+MieX3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4677022c8bd164b674af67c08e1dbc4cdc7f941a4747f43d1a469c8d6c68c02","last_reissued_at":"2026-05-18T00:33:24.002547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:24.002547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroki Arimura, Kunihiko Sadakane, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2016-02-01T08:17:52Z","abstract_excerpt":"In this paper, we present a new data structure called the packed compact trie (packed c-trie) which stores a set $S$ of $k$ strings of total length $n$ in $n \\log\\sigma + O(k \\log n)$ bits of space and supports fast pattern matching queries and updates, where $\\sigma$ is the size of an alphabet. Assume that $\\alpha = \\log_\\sigma n$ letters are packed in a single machine word on the standard word RAM model, and let $f(k,n)$ denote the query and update times of the dynamic predecessor/successor data structure of our choice which stores $k$ integers from universe $[1,n]$ in $O(k \\log n)$ bits of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00422","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":"1602.00422","created_at":"2026-05-18T00:33:24.002723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00422v1","created_at":"2026-05-18T00:33:24.002723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00422","created_at":"2026-05-18T00:33:24.002723+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RTXAIWIXULE","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RTXAIWIXULEWZ2K","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RTXAIWI","created_at":"2026-05-18T12:30:01.593930+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/6RTXAIWIXULEWZ2K6Z6ARYO3YT","json":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT.json","graph_json":"https://pith.science/api/pith-number/6RTXAIWIXULEWZ2K6Z6ARYO3YT/graph.json","events_json":"https://pith.science/api/pith-number/6RTXAIWIXULEWZ2K6Z6ARYO3YT/events.json","paper":"https://pith.science/paper/6RTXAIWI"},"agent_actions":{"view_html":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT","download_json":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT.json","view_paper":"https://pith.science/paper/6RTXAIWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00422&json=true","fetch_graph":"https://pith.science/api/pith-number/6RTXAIWIXULEWZ2K6Z6ARYO3YT/graph.json","fetch_events":"https://pith.science/api/pith-number/6RTXAIWIXULEWZ2K6Z6ARYO3YT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/action/storage_attestation","attest_author":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/action/author_attestation","sign_citation":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/action/citation_signature","submit_replication":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/action/replication_record"}},"created_at":"2026-05-18T00:33:24.002723+00:00","updated_at":"2026-05-18T00:33:24.002723+00:00"}