{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:35SAFWGI26UAMTI7ZVH5CZSJ5E","short_pith_number":"pith:35SAFWGI","schema_version":"1.0","canonical_sha256":"df6402d8c8d7a8064d1fcd4fd16649e93aceb31d3eff9f999f477fafe255214d","source":{"kind":"arxiv","id":"1901.10045","version":3},"attestation_state":"computed","paper":{"title":"Online Algorithms for Constructing Linear-size Suffix Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diptarama Hendrian, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2019-01-29T00:14:32Z","abstract_excerpt":"The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a string $T$ of length $n$ has $O(n)$ nodes and edges, and the string label of each edge is encoded by a pair of positions in $T$. Thus, even after the tree is built, the input text $T$ needs to be kept stored and random access to $T$ is still needed. The linear-size suffix tries (LSTs), proposed by Crochemore et al. [Linear-size suffix tries, TCS 638:171-178, 2016], are a `stand-alone' alternative to the suffix trees. Namely, the LST of a string $T$ of length $n$ occupies $O(n)$ total s"},"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":"1901.10045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-29T00:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"eaa16d84e24d2c1b44f778a603a361c985d8d619e50095ca4ce24f07c3943389","abstract_canon_sha256":"f4c53f02175f4d23dddd8fbebeae1e414851bc890fbaa93ab8e1790eb73a70d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:55.010720Z","signature_b64":"Rx3zMV499k7ovUtgnQUAZb8llbDwKnfY/pDNeMNsZVTlNhHBhBCk7hqX86OuWrOPTGvEJmb5yZOuhLd+ygozAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df6402d8c8d7a8064d1fcd4fd16649e93aceb31d3eff9f999f477fafe255214d","last_reissued_at":"2026-05-17T23:48:55.010138Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:55.010138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Algorithms for Constructing Linear-size Suffix Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diptarama Hendrian, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2019-01-29T00:14:32Z","abstract_excerpt":"The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a string $T$ of length $n$ has $O(n)$ nodes and edges, and the string label of each edge is encoded by a pair of positions in $T$. Thus, even after the tree is built, the input text $T$ needs to be kept stored and random access to $T$ is still needed. The linear-size suffix tries (LSTs), proposed by Crochemore et al. [Linear-size suffix tries, TCS 638:171-178, 2016], are a `stand-alone' alternative to the suffix trees. Namely, the LST of a string $T$ of length $n$ occupies $O(n)$ total s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10045","kind":"arxiv","version":3},"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":"1901.10045","created_at":"2026-05-17T23:48:55.010223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10045v3","created_at":"2026-05-17T23:48:55.010223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10045","created_at":"2026-05-17T23:48:55.010223+00:00"},{"alias_kind":"pith_short_12","alias_value":"35SAFWGI26UA","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"35SAFWGI26UAMTI7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"35SAFWGI","created_at":"2026-05-18T12:33:07.085635+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/35SAFWGI26UAMTI7ZVH5CZSJ5E","json":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E.json","graph_json":"https://pith.science/api/pith-number/35SAFWGI26UAMTI7ZVH5CZSJ5E/graph.json","events_json":"https://pith.science/api/pith-number/35SAFWGI26UAMTI7ZVH5CZSJ5E/events.json","paper":"https://pith.science/paper/35SAFWGI"},"agent_actions":{"view_html":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E","download_json":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E.json","view_paper":"https://pith.science/paper/35SAFWGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10045&json=true","fetch_graph":"https://pith.science/api/pith-number/35SAFWGI26UAMTI7ZVH5CZSJ5E/graph.json","fetch_events":"https://pith.science/api/pith-number/35SAFWGI26UAMTI7ZVH5CZSJ5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E/action/storage_attestation","attest_author":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E/action/author_attestation","sign_citation":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E/action/citation_signature","submit_replication":"https://pith.science/pith/35SAFWGI26UAMTI7ZVH5CZSJ5E/action/replication_record"}},"created_at":"2026-05-17T23:48:55.010223+00:00","updated_at":"2026-05-17T23:48:55.010223+00:00"}