{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UCYPMRTWUXZWU3YVWOQOOPQWY7","short_pith_number":"pith:UCYPMRTW","schema_version":"1.0","canonical_sha256":"a0b0f64676a5f36a6f15b3a0e73e16c7cef40d3c63b137b5ee9bca51a0870684","source":{"kind":"arxiv","id":"1606.08275","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Ritu Kundu, Solon P. Pissis, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2016-06-27T13:49:16Z","abstract_excerpt":"Longest common extension queries (LCE queries) and runs are ubiquitous in algorithmic stringology. Linear-time algorithms computing runs and preprocessing for constant-time LCE queries have been known for over a decade. However, these algorithms assume a linearly-sortable integer alphabet. A recent breakthrough paper by Bannai et.\\ al.\\ (SODA 2015) showed a link between the two notions: all the runs in a string can be computed via a linear number of LCE queries. The first to consider these problems over a general ordered alphabet was Kosolobov (\\emph{Inf.\\ Process.\\ Lett.}, 2016), who presente"},"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":"1606.08275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-27T13:49:16Z","cross_cats_sorted":[],"title_canon_sha256":"57358e55fbdebbcaf29494ee8f4d4dca0586fe17e4a4e68056da6ed0e0817632","abstract_canon_sha256":"22fb2d5ded538374cbbfccd9b339f90cac1631c9fd820856f062057b4dbc9136"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:52.428455Z","signature_b64":"7bGxL0RFYVk/k3BkfTN1KwP6TK6PWbYwioXBklyvnTFQFCuHiSHjLJxs9alI+rKulcWcgu/SBSF4mAkFNzhdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b0f64676a5f36a6f15b3a0e73e16c7cef40d3c63b137b5ee9bca51a0870684","last_reissued_at":"2026-05-18T01:11:52.428119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:52.428119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Ritu Kundu, Solon P. Pissis, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2016-06-27T13:49:16Z","abstract_excerpt":"Longest common extension queries (LCE queries) and runs are ubiquitous in algorithmic stringology. Linear-time algorithms computing runs and preprocessing for constant-time LCE queries have been known for over a decade. However, these algorithms assume a linearly-sortable integer alphabet. A recent breakthrough paper by Bannai et.\\ al.\\ (SODA 2015) showed a link between the two notions: all the runs in a string can be computed via a linear number of LCE queries. The first to consider these problems over a general ordered alphabet was Kosolobov (\\emph{Inf.\\ Process.\\ Lett.}, 2016), who presente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08275","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.08275","created_at":"2026-05-18T01:11:52.428172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08275v1","created_at":"2026-05-18T01:11:52.428172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08275","created_at":"2026-05-18T01:11:52.428172+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCYPMRTWUXZW","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCYPMRTWUXZWU3YV","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCYPMRTW","created_at":"2026-05-18T12:30:46.583412+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/UCYPMRTWUXZWU3YVWOQOOPQWY7","json":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7.json","graph_json":"https://pith.science/api/pith-number/UCYPMRTWUXZWU3YVWOQOOPQWY7/graph.json","events_json":"https://pith.science/api/pith-number/UCYPMRTWUXZWU3YVWOQOOPQWY7/events.json","paper":"https://pith.science/paper/UCYPMRTW"},"agent_actions":{"view_html":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7","download_json":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7.json","view_paper":"https://pith.science/paper/UCYPMRTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08275&json=true","fetch_graph":"https://pith.science/api/pith-number/UCYPMRTWUXZWU3YVWOQOOPQWY7/graph.json","fetch_events":"https://pith.science/api/pith-number/UCYPMRTWUXZWU3YVWOQOOPQWY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7/action/storage_attestation","attest_author":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7/action/author_attestation","sign_citation":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7/action/citation_signature","submit_replication":"https://pith.science/pith/UCYPMRTWUXZWU3YVWOQOOPQWY7/action/replication_record"}},"created_at":"2026-05-18T01:11:52.428172+00:00","updated_at":"2026-05-18T01:11:52.428172+00:00"}