{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FJQSUHUKH3QH7EJVWAQDFDA2BQ","short_pith_number":"pith:FJQSUHUK","canonical_record":{"source":{"id":"1208.3798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-19T01:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"bf4cc450dc0f657089afd80f3704f3ca7d975249a1ea65d2be805a36fe491b98","abstract_canon_sha256":"27bb1ec34e06bb7c35d694fdbf96c3fdc8eddbe68dcd8e301a8dcfe1df2afab7"},"schema_version":"1.0"},"canonical_sha256":"2a612a1e8a3ee07f9135b020328c1a0c3dc2f699fbf47acd24ca3927128f5464","source":{"kind":"arxiv","id":"1208.3798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3798","created_at":"2026-05-18T03:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3798v1","created_at":"2026-05-18T03:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3798","created_at":"2026-05-18T03:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"FJQSUHUKH3QH","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FJQSUHUKH3QH7EJV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FJQSUHUK","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FJQSUHUKH3QH7EJVWAQDFDA2BQ","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-19T01:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"bf4cc450dc0f657089afd80f3704f3ca7d975249a1ea65d2be805a36fe491b98","abstract_canon_sha256":"27bb1ec34e06bb7c35d694fdbf96c3fdc8eddbe68dcd8e301a8dcfe1df2afab7"},"schema_version":"1.0"},"canonical_sha256":"2a612a1e8a3ee07f9135b020328c1a0c3dc2f699fbf47acd24ca3927128f5464","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:26.195006Z","signature_b64":"E2M7aObkvCax0jGh/k/XTksOQpv0FAuGUA7UzC0Uksp5y96j09jP/J8z0+dRDXtZSD361/IBfLTVfH6qQatOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a612a1e8a3ee07f9135b020328c1a0c3dc2f699fbf47acd24ca3927128f5464","last_reissued_at":"2026-05-18T03:48:26.194262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:26.194262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3798","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-18T03:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXzB1nkhwYyLOX98fOVu7bKkz1e/6NxxRwnNGIFev5HB/MCgLcJvVLQhhfkmHXor4L73a27V0ms8Rthwrim6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:30:16.902588Z"},"content_sha256":"83a0138d5c9ee6b2c228a59ecc224d65bf0f68ba7df76e676a37df43b29287f9","schema_version":"1.0","event_id":"sha256:83a0138d5c9ee6b2c228a59ecc224d65bf0f68ba7df76e676a37df43b29287f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FJQSUHUKH3QH7EJVWAQDFDA2BQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tsvi Kopelowitz","submitted_at":"2012-08-19T01:26:33Z","abstract_excerpt":"The problem of Text Indexing is a fundamental algorithmic problem in which one wishes to preprocess a text in order to quickly locate pattern queries within the text. In the ever evolving world of dynamic and on-line data, there is also a need for developing solutions to index texts which arrive on-line, i.e. a character at a time, and still be able to quickly locate said patterns. In this paper, a new solution for on-line indexing is presented by providing an on-line suffix tree construction in $O(\\log \\log n + \\log\\log |\\Sigma|)$ worst-case expected time per character, where $n$ is the size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3798","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-18T03:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K63VCDTGPMDg8V5vxqyDsxPyzU+QehjHNEDvbnqAJ6ScdIFl9l7owkQT6k/WeyoX1b4/OBIB0xTYeakp7CkQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:30:16.903347Z"},"content_sha256":"7520c7094ab4fceb50e6f8306f43e38cd52d64172875201c88f4287a4a8228fc","schema_version":"1.0","event_id":"sha256:7520c7094ab4fceb50e6f8306f43e38cd52d64172875201c88f4287a4a8228fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ/bundle.json","state_url":"https://pith.science/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ/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-31T20:30:16Z","links":{"resolver":"https://pith.science/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ","bundle":"https://pith.science/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ/bundle.json","state":"https://pith.science/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJQSUHUKH3QH7EJVWAQDFDA2BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FJQSUHUKH3QH7EJVWAQDFDA2BQ","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":"27bb1ec34e06bb7c35d694fdbf96c3fdc8eddbe68dcd8e301a8dcfe1df2afab7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-19T01:26:33Z","title_canon_sha256":"bf4cc450dc0f657089afd80f3704f3ca7d975249a1ea65d2be805a36fe491b98"},"schema_version":"1.0","source":{"id":"1208.3798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3798","created_at":"2026-05-18T03:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3798v1","created_at":"2026-05-18T03:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3798","created_at":"2026-05-18T03:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"FJQSUHUKH3QH","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FJQSUHUKH3QH7EJV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FJQSUHUK","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:7520c7094ab4fceb50e6f8306f43e38cd52d64172875201c88f4287a4a8228fc","target":"graph","created_at":"2026-05-18T03:48:26Z","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":"The problem of Text Indexing is a fundamental algorithmic problem in which one wishes to preprocess a text in order to quickly locate pattern queries within the text. In the ever evolving world of dynamic and on-line data, there is also a need for developing solutions to index texts which arrive on-line, i.e. a character at a time, and still be able to quickly locate said patterns. In this paper, a new solution for on-line indexing is presented by providing an on-line suffix tree construction in $O(\\log \\log n + \\log\\log |\\Sigma|)$ worst-case expected time per character, where $n$ is the size ","authors_text":"Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-19T01:26:33Z","title":"On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3798","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:83a0138d5c9ee6b2c228a59ecc224d65bf0f68ba7df76e676a37df43b29287f9","target":"record","created_at":"2026-05-18T03:48:26Z","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":"27bb1ec34e06bb7c35d694fdbf96c3fdc8eddbe68dcd8e301a8dcfe1df2afab7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-19T01:26:33Z","title_canon_sha256":"bf4cc450dc0f657089afd80f3704f3ca7d975249a1ea65d2be805a36fe491b98"},"schema_version":"1.0","source":{"id":"1208.3798","kind":"arxiv","version":1}},"canonical_sha256":"2a612a1e8a3ee07f9135b020328c1a0c3dc2f699fbf47acd24ca3927128f5464","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a612a1e8a3ee07f9135b020328c1a0c3dc2f699fbf47acd24ca3927128f5464","first_computed_at":"2026-05-18T03:48:26.194262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:26.194262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E2M7aObkvCax0jGh/k/XTksOQpv0FAuGUA7UzC0Uksp5y96j09jP/J8z0+dRDXtZSD361/IBfLTVfH6qQatOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:26.195006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83a0138d5c9ee6b2c228a59ecc224d65bf0f68ba7df76e676a37df43b29287f9","sha256:7520c7094ab4fceb50e6f8306f43e38cd52d64172875201c88f4287a4a8228fc"],"state_sha256":"7e8d11866fff2a387eca7cfcbbc43c4575b4b8c79ab0fb709bba4925c402eb36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOryv02lgTGgwXW6OfQ2ByuhxIxuSkGrPdOWEEhtXDLT58lCTpsR5yBD5Vb+8ecXxiGZCJ+Qu+BDF0iMx3AwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:30:16.907437Z","bundle_sha256":"8d4f896d5e41fa1dd3c29b38502890d9fc9f5f87df34ae1c6aca276bd230e671"}}