{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IUO76KKXPZ7LDQHIQTR5HJCB53","short_pith_number":"pith:IUO76KKX","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"},"canonical_sha256":"451dff29577e7eb1c0e884e3d3a441eec542a662a20db404c16cfeda6bb05b42","source":{"kind":"arxiv","id":"1507.07622","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07622","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07622v5","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07622","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"IUO76KKXPZ7L","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IUO76KKXPZ7LDQHI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IUO76KKX","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IUO76KKXPZ7LDQHIQTR5HJCB53","target":"record","payload":{"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"},"canonical_sha256":"451dff29577e7eb1c0e884e3d3a441eec542a662a20db404c16cfeda6bb05b42","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"},"source_kind":"arxiv","source_id":"1507.07622","source_version":5,"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:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HK2+Q2/3/OwXThn038OgSOZ0Iu3xaQGhMPVgpt23Ek2d4PvJzCTw4GH1OKargD/CEHHEbELhFkcAMAPFTrH7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:22:32.765859Z"},"content_sha256":"5e7e5fbf9823a2cc2e88825d743ce05c1d2441ae86766b0c5308a2a9bf3a590a","schema_version":"1.0","event_id":"sha256:5e7e5fbf9823a2cc2e88825d743ce05c1d2441ae86766b0c5308a2a9bf3a590a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IUO76KKXPZ7LDQHIQTR5HJCB53","target":"graph","payload":{"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"},"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:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3INonTefD86XXQf//xejWGnYmqJluG2Gw0frNuwcLzANd28oBjl+T+S9ArOvSwsqHialj/HhT6RCjqlMMZPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:22:32.766547Z"},"content_sha256":"6d17673f74f333abab76742bc0f9891a4589bb774d907b507a118ad93e6fa770","schema_version":"1.0","event_id":"sha256:6d17673f74f333abab76742bc0f9891a4589bb774d907b507a118ad93e6fa770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/bundle.json","state_url":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/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-06-07T06:22:32Z","links":{"resolver":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53","bundle":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/bundle.json","state":"https://pith.science/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUO76KKXPZ7LDQHIQTR5HJCB53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IUO76KKXPZ7LDQHIQTR5HJCB53","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":"c3520bd11952dff240440a1345066cc73d0545418584ba4e03fa3c3a59321eae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-28T02:15:02Z","title_canon_sha256":"971ba6a6a8095e422ba6896986d635dd50c9fcd8f771053a94ac8f2f9f8b856f"},"schema_version":"1.0","source":{"id":"1507.07622","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07622","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07622v5","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07622","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"IUO76KKXPZ7L","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IUO76KKXPZ7LDQHI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IUO76KKX","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:6d17673f74f333abab76742bc0f9891a4589bb774d907b507a118ad93e6fa770","target":"graph","created_at":"2026-05-18T00:10:57Z","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":"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","authors_text":"Dany Breslauer, Diptarama Hendrian, Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-28T02:15:02Z","title":"Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07622","kind":"arxiv","version":5},"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:5e7e5fbf9823a2cc2e88825d743ce05c1d2441ae86766b0c5308a2a9bf3a590a","target":"record","created_at":"2026-05-18T00:10:57Z","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":"c3520bd11952dff240440a1345066cc73d0545418584ba4e03fa3c3a59321eae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-28T02:15:02Z","title_canon_sha256":"971ba6a6a8095e422ba6896986d635dd50c9fcd8f771053a94ac8f2f9f8b856f"},"schema_version":"1.0","source":{"id":"1507.07622","kind":"arxiv","version":5}},"canonical_sha256":"451dff29577e7eb1c0e884e3d3a441eec542a662a20db404c16cfeda6bb05b42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"451dff29577e7eb1c0e884e3d3a441eec542a662a20db404c16cfeda6bb05b42","first_computed_at":"2026-05-18T00:10:57.460043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:57.460043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JUqNGvwsnppDEVP1u1y59KRu4flScEpkj6QZtHJ4n/cuGzoDiDDSYy7dKxB94ga5fCDyCUhcuqAbZ/9AHndpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:57.460789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07622","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e7e5fbf9823a2cc2e88825d743ce05c1d2441ae86766b0c5308a2a9bf3a590a","sha256:6d17673f74f333abab76742bc0f9891a4589bb774d907b507a118ad93e6fa770"],"state_sha256":"ca494d2fed8396d6a7cc3f4b2f164a309acf8206f5c15d0bfbf64a2219f6fc2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y20XhtwnisgyBazUulT+BHMwdaSlKCnaUBnymQdAmEwzDTncX8Chx9nIcwFuz1vZDYaxpfuhhJreQdsr9QEmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:22:32.769351Z","bundle_sha256":"6f73e762f6deaa306fc13b851be8eb661b8147e3092770b33e88270792574e13"}}