{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7YUVYXHEAZ3UPQ4GWVTFEXVMBF","short_pith_number":"pith:7YUVYXHE","schema_version":"1.0","canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","source":{"kind":"arxiv","id":"1509.07417","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Sparse Suffix Sorting in the Restore Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Johannes Fischer, Tomohiro I","submitted_at":"2015-09-24T16:05:25Z","abstract_excerpt":"Given a text $T$ of length $n$, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of $T$ in $O(c \\sqrt{\\lg n} + m \\lg m \\lg n \\lg^* n)$ time with $O(m)$ words of space under the premise that the space of $T$ is rewritable, where $m \\le n$ is the number of suffixes to be sorted (provided online and arbitrarily), and $c$ is the number of characters with $m \\le c \\le n$ that must be compared for distinguishing the designated suffixes."},"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":"1509.07417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T16:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"2ea8dd1826108205b9d3313a755b2140799fdbe1864d745597819495b6d7c0d8","abstract_canon_sha256":"438d59a41cd016cf7a6f12462ec8d5cda18a626ef97cbbdbba786c8cab1a0f77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:22.591546Z","signature_b64":"NVDvjDEsy1VODELTqu2BaeHXrcJfllmE9bnStJX0QeDkmKjslM961PYbWSSZWTo20WiCsG0fIP+idN2sNGbkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe295c5ce4067747c386b566525eac095849f1de6ed5ac565d9a5a67af3f60df","last_reissued_at":"2026-05-18T00:20:22.590896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:22.590896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Sparse Suffix Sorting in the Restore Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Johannes Fischer, Tomohiro I","submitted_at":"2015-09-24T16:05:25Z","abstract_excerpt":"Given a text $T$ of length $n$, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of $T$ in $O(c \\sqrt{\\lg n} + m \\lg m \\lg n \\lg^* n)$ time with $O(m)$ words of space under the premise that the space of $T$ is rewritable, where $m \\le n$ is the number of suffixes to be sorted (provided online and arbitrarily), and $c$ is the number of characters with $m \\le c \\le n$ that must be compared for distinguishing the designated suffixes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07417","kind":"arxiv","version":2},"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":"1509.07417","created_at":"2026-05-18T00:20:22.590978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07417v2","created_at":"2026-05-18T00:20:22.590978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07417","created_at":"2026-05-18T00:20:22.590978+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YUVYXHEAZ3U","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YUVYXHEAZ3UPQ4G","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YUVYXHE","created_at":"2026-05-18T12:29:10.953037+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/7YUVYXHEAZ3UPQ4GWVTFEXVMBF","json":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF.json","graph_json":"https://pith.science/api/pith-number/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/graph.json","events_json":"https://pith.science/api/pith-number/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/events.json","paper":"https://pith.science/paper/7YUVYXHE"},"agent_actions":{"view_html":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF","download_json":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF.json","view_paper":"https://pith.science/paper/7YUVYXHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07417&json=true","fetch_graph":"https://pith.science/api/pith-number/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/graph.json","fetch_events":"https://pith.science/api/pith-number/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/action/storage_attestation","attest_author":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/action/author_attestation","sign_citation":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/action/citation_signature","submit_replication":"https://pith.science/pith/7YUVYXHEAZ3UPQ4GWVTFEXVMBF/action/replication_record"}},"created_at":"2026-05-18T00:20:22.590978+00:00","updated_at":"2026-05-18T00:20:22.590978+00:00"}