{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IUO76KKXPZ7LDQHIQTR5HJCB53","short_pith_number":"pith:IUO76KKX","schema_version":"1.0","canonical_sha256":"451dff29577e7eb1c0e884e3d3a441eec542a662a20db404c16cfeda6bb05b42","source":{"kind":"arxiv","id":"1507.07622","version":5},"attestation_state":"computed","paper":{"title":"Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dany Breslauer, Diptarama Hendrian, Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2015-07-28T02:15:02Z","abstract_excerpt":"We consider construction of the suffix tree and the directed acyclic word graph (DAWG) indexing data structures for a collection $\\mathcal{T}$ of texts, where a new symbol may be appended to any text in $\\mathcal{T} = \\{T_1, \\ldots, T_K\\}$, at any time. This fully-online scenario, which arises in dynamically indexing multi-sensor data, is a natural generalization of the long solved semi-online text indexing problem, where texts $T_1, \\ldots, T_{k}$ are permanently fixed before the next text $T_{k+1}$ is processed for each $1 \\leq k < K$. We present fully-online algorithms that construct the su"},"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":"1507.07622","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-28T02:15:02Z","cross_cats_sorted":[],"title_canon_sha256":"971ba6a6a8095e422ba6896986d635dd50c9fcd8f771053a94ac8f2f9f8b856f","abstract_canon_sha256":"c3520bd11952dff240440a1345066cc73d0545418584ba4e03fa3c3a59321eae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:57.460789Z","signature_b64":"JUqNGvwsnppDEVP1u1y59KRu4flScEpkj6QZtHJ4n/cuGzoDiDDSYy7dKxB94ga5fCDyCUhcuqAbZ/9AHndpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451dff29577e7eb1c0e884e3d3a441eec542a662a20db404c16cfeda6bb05b42","last_reissued_at":"2026-05-18T00:10:57.460043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:57.460043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dany Breslauer, Diptarama Hendrian, Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2015-07-28T02:15:02Z","abstract_excerpt":"We consider construction of the suffix tree and the directed acyclic word graph (DAWG) indexing data structures for a collection $\\mathcal{T}$ of texts, where a new symbol may be appended to any text in $\\mathcal{T} = \\{T_1, \\ldots, T_K\\}$, at any time. This fully-online scenario, which arises in dynamically indexing multi-sensor data, is a natural generalization of the long solved semi-online text indexing problem, where texts $T_1, \\ldots, T_{k}$ are permanently fixed before the next text $T_{k+1}$ is processed for each $1 \\leq k < K$. We present fully-online algorithms that construct the su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07622","kind":"arxiv","version":5},"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":"1507.07622","created_at":"2026-05-18T00:10:57.460164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07622v5","created_at":"2026-05-18T00:10:57.460164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07622","created_at":"2026-05-18T00:10:57.460164+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUO76KKXPZ7L","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUO76KKXPZ7LDQHI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUO76KKX","created_at":"2026-05-18T12:29:25.134429+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/IUO76KKXPZ7LDQHIQTR5HJCB53","json":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53.json","graph_json":"https://pith.science/api/pith-number/IUO76KKXPZ7LDQHIQTR5HJCB53/graph.json","events_json":"https://pith.science/api/pith-number/IUO76KKXPZ7LDQHIQTR5HJCB53/events.json","paper":"https://pith.science/paper/IUO76KKX"},"agent_actions":{"view_html":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53","download_json":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53.json","view_paper":"https://pith.science/paper/IUO76KKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07622&json=true","fetch_graph":"https://pith.science/api/pith-number/IUO76KKXPZ7LDQHIQTR5HJCB53/graph.json","fetch_events":"https://pith.science/api/pith-number/IUO76KKXPZ7LDQHIQTR5HJCB53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/action/storage_attestation","attest_author":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/action/author_attestation","sign_citation":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/action/citation_signature","submit_replication":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/action/replication_record"}},"created_at":"2026-05-18T00:10:57.460164+00:00","updated_at":"2026-05-18T00:10:57.460164+00:00"}