{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6RTXAIWIXULEWZ2K6Z6ARYO3YT","short_pith_number":"pith:6RTXAIWI","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"},"canonical_sha256":"f4677022c8bd164b674af67c08e1dbc4cdc7f941a4747f43d1a469c8d6c68c02","source":{"kind":"arxiv","id":"1602.00422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00422","created_at":"2026-05-18T00:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00422v1","created_at":"2026-05-18T00:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00422","created_at":"2026-05-18T00:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"6RTXAIWIXULE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6RTXAIWIXULEWZ2K","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6RTXAIWI","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6RTXAIWIXULEWZ2K6Z6ARYO3YT","target":"record","payload":{"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"},"canonical_sha256":"f4677022c8bd164b674af67c08e1dbc4cdc7f941a4747f43d1a469c8d6c68c02","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"},"source_kind":"arxiv","source_id":"1602.00422","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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skBjJF3AwNkUvHoDI/9fjmQsEViV/PKIG5Qy9bhUMJ1lkFYIeray+XRO3ZaHKYVW51Gm94brrDREw8VL/665BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:31.946182Z"},"content_sha256":"a38370d065bddba7dd4042c66f1711c6f0f1803a97385052fa44858324f76f48","schema_version":"1.0","event_id":"sha256:a38370d065bddba7dd4042c66f1711c6f0f1803a97385052fa44858324f76f48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6RTXAIWIXULEWZ2K6Z6ARYO3YT","target":"graph","payload":{"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"},"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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLuX0lsPVGD1ueZ4hB4QFYUmhxX7Fs5RR6y6hFBCzfkTGohvjahs0SuId6RBDXC8Kq3f2hxX8UXfyHYzQ7j/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:31.946729Z"},"content_sha256":"4a65a20e09cb8d132fd80939a3ad87d4d60f4d97bf58ec13777f41af17591be3","schema_version":"1.0","event_id":"sha256:4a65a20e09cb8d132fd80939a3ad87d4d60f4d97bf58ec13777f41af17591be3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/bundle.json","state_url":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/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-05-27T22:16:31Z","links":{"resolver":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT","bundle":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/bundle.json","state":"https://pith.science/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RTXAIWIXULEWZ2K6Z6ARYO3YT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6RTXAIWIXULEWZ2K6Z6ARYO3YT","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":"7ba561f1ee2f7f3c3da994c20640b6d98c797e2728e3fc16aa332d53521c9ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-01T08:17:52Z","title_canon_sha256":"3a168a8b4a9f829b925f1dd6e6033a69d67a42a5b7d4b3e0b8836076b3079616"},"schema_version":"1.0","source":{"id":"1602.00422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00422","created_at":"2026-05-18T00:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00422v1","created_at":"2026-05-18T00:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00422","created_at":"2026-05-18T00:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"6RTXAIWIXULE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6RTXAIWIXULEWZ2K","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6RTXAIWI","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:4a65a20e09cb8d132fd80939a3ad87d4d60f4d97bf58ec13777f41af17591be3","target":"graph","created_at":"2026-05-18T00:33:24Z","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":"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 ","authors_text":"Hiroki Arimura, Kunihiko Sadakane, Shunsuke Inenaga, Takuya Takagi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-01T08:17:52Z","title":"Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00422","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:a38370d065bddba7dd4042c66f1711c6f0f1803a97385052fa44858324f76f48","target":"record","created_at":"2026-05-18T00:33:24Z","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":"7ba561f1ee2f7f3c3da994c20640b6d98c797e2728e3fc16aa332d53521c9ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-01T08:17:52Z","title_canon_sha256":"3a168a8b4a9f829b925f1dd6e6033a69d67a42a5b7d4b3e0b8836076b3079616"},"schema_version":"1.0","source":{"id":"1602.00422","kind":"arxiv","version":1}},"canonical_sha256":"f4677022c8bd164b674af67c08e1dbc4cdc7f941a4747f43d1a469c8d6c68c02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4677022c8bd164b674af67c08e1dbc4cdc7f941a4747f43d1a469c8d6c68c02","first_computed_at":"2026-05-18T00:33:24.002547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:24.002547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vdkAc0SOxW269dQgMtE02889PQzhb7bFfJivKDr781b1+8q0dBQIT0MVUNup1oxIKw+8eL0GVry8zR+MieX3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:24.003483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a38370d065bddba7dd4042c66f1711c6f0f1803a97385052fa44858324f76f48","sha256:4a65a20e09cb8d132fd80939a3ad87d4d60f4d97bf58ec13777f41af17591be3"],"state_sha256":"b31cb94c2ac0513b827862588efb369b5ce9d9f401d7d7d3ed69da8362029eee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWiibgq1FradR5lCZXAGSuPH6eJnJMrlFg/CVi0H1wVyTHK98skE+QFIO3ywShYjE3ey48lIF4aE20uqa/JpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:16:31.950411Z","bundle_sha256":"17614da3a041a88f173e39a23d5032c85f78e33cb6ad7a8d46cd2c9211e72db3"}}