{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U3FTMTOEJKSSTSCGSIAVMVDAAC","short_pith_number":"pith:U3FTMTOE","schema_version":"1.0","canonical_sha256":"a6cb364dc44aa529c846920156546000beb7b9814bb7759781402976c50ac9e9","source":{"kind":"arxiv","id":"1712.07431","version":3},"attestation_state":"computed","paper":{"title":"Text Indexing and Searching in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, J. Ian Munro, Yakov Nekrich","submitted_at":"2017-12-20T11:51:51Z","abstract_excerpt":"We introduce the first index that can be built in $o(n)$ time for a text of length $n$, and can also be queried in $o(q)$ time for a pattern of length $q$. On an alphabet of size $\\sigma$, our index uses $O(n\\sqrt{\\log n\\log\\sigma})$ bits, is built in $O(n((\\log\\log n)^2+\\sqrt{\\log\\sigma})/\\sqrt{\\log_\\sigma n})$ deterministic time, and computes the number $\\mathrm{occ}$ of occurrences of the pattern in time $O(q/\\log_\\sigma n+\\log n)$. Each such occurrence can then be found in $O(\\sqrt{\\log n\\log\\sigma})$ time. By slightly increasing the space and construction time, to $O(n(\\sqrt{\\log n\\log\\si"},"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":"1712.07431","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-20T11:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"5803a848f5780c3a01226291f3911848d16c0765ef909afef4ca9c2760488974","abstract_canon_sha256":"85022dba8a9922afb6923b439dec0e501bad81df7fc107d0eb881cd61f317e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.968356Z","signature_b64":"ECPwllAlDWNybnPzaMD0E01U8KBN7niSJk7KVslH8sGFQ24hNqOMRHtzCPdw9ZxXGh50A9NRVGqdzwv4onaUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6cb364dc44aa529c846920156546000beb7b9814bb7759781402976c50ac9e9","last_reissued_at":"2026-05-17T23:40:41.967754Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.967754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Text Indexing and Searching in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, J. Ian Munro, Yakov Nekrich","submitted_at":"2017-12-20T11:51:51Z","abstract_excerpt":"We introduce the first index that can be built in $o(n)$ time for a text of length $n$, and can also be queried in $o(q)$ time for a pattern of length $q$. On an alphabet of size $\\sigma$, our index uses $O(n\\sqrt{\\log n\\log\\sigma})$ bits, is built in $O(n((\\log\\log n)^2+\\sqrt{\\log\\sigma})/\\sqrt{\\log_\\sigma n})$ deterministic time, and computes the number $\\mathrm{occ}$ of occurrences of the pattern in time $O(q/\\log_\\sigma n+\\log n)$. Each such occurrence can then be found in $O(\\sqrt{\\log n\\log\\sigma})$ time. By slightly increasing the space and construction time, to $O(n(\\sqrt{\\log n\\log\\si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07431","kind":"arxiv","version":3},"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":"1712.07431","created_at":"2026-05-17T23:40:41.967828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07431v3","created_at":"2026-05-17T23:40:41.967828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07431","created_at":"2026-05-17T23:40:41.967828+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3FTMTOEJKSS","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3FTMTOEJKSSTSCG","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3FTMTOE","created_at":"2026-05-18T12:31:46.661854+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/U3FTMTOEJKSSTSCGSIAVMVDAAC","json":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC.json","graph_json":"https://pith.science/api/pith-number/U3FTMTOEJKSSTSCGSIAVMVDAAC/graph.json","events_json":"https://pith.science/api/pith-number/U3FTMTOEJKSSTSCGSIAVMVDAAC/events.json","paper":"https://pith.science/paper/U3FTMTOE"},"agent_actions":{"view_html":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC","download_json":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC.json","view_paper":"https://pith.science/paper/U3FTMTOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07431&json=true","fetch_graph":"https://pith.science/api/pith-number/U3FTMTOEJKSSTSCGSIAVMVDAAC/graph.json","fetch_events":"https://pith.science/api/pith-number/U3FTMTOEJKSSTSCGSIAVMVDAAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC/action/storage_attestation","attest_author":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC/action/author_attestation","sign_citation":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC/action/citation_signature","submit_replication":"https://pith.science/pith/U3FTMTOEJKSSTSCGSIAVMVDAAC/action/replication_record"}},"created_at":"2026-05-17T23:40:41.967828+00:00","updated_at":"2026-05-17T23:40:41.967828+00:00"}