{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MAVYBYL3FXPL2LLDJX6KVAI3OC","short_pith_number":"pith:MAVYBYL3","schema_version":"1.0","canonical_sha256":"602b80e17b2ddebd2d634dfcaa811b70b023c757e9cde2cfd5f1790fdbd0ce43","source":{"kind":"arxiv","id":"2607.00204","version":1},"attestation_state":"computed","paper":{"title":"Computing Smallest Suffixient Arrays in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristian Urbina, Francisco Olivares, Giuseppe Romana, Gonzalo Navarro, Hiroto Fujimaru, Jakub Radoszewski","submitted_at":"2026-06-30T21:33:31Z","abstract_excerpt":"A suffixient array is a novel data structure that, when combined with an index providing direct access on a text $T$, allows us to answer a variety of pattern matching queries. In this work, we show how to compute a smallest suffixient array for $T[1\\dots n]$ in $O(\\frac{n\\log \\sigma}{\\sqrt{\\log n}}+\\min(r,\\bar{r})\\log^\\epsilon n)$ time for any $\\epsilon > 0$, where $\\sigma$ is the alphabet size of $T$ and $r$ and $\\bar{r}$ are the numbers of equal-letter runs of the Burrows-Wheeler transforms of $T$ and its reverse $\\overline{T}$, respectively. This time complexity becomes sublinear when $\\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":"2607.00204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T21:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"4d393a134b15390a87120efd7740ed9ba212e948df051e148778b424dab58879","abstract_canon_sha256":"a32ab593691280aa414139d533d6c5d5c3eb28a5fbeaeff2329b8760fb189b24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:38.988808Z","signature_b64":"+m9uWqrOgrzu7dVqQultKS1BQN0R+39f3iLiPQoA4bcWF67m6QIeoraY0uKiKHH2yoA6RwnwIodQxSzNoI4XCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602b80e17b2ddebd2d634dfcaa811b70b023c757e9cde2cfd5f1790fdbd0ce43","last_reissued_at":"2026-07-02T00:18:38.988354Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:38.988354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Smallest Suffixient Arrays in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristian Urbina, Francisco Olivares, Giuseppe Romana, Gonzalo Navarro, Hiroto Fujimaru, Jakub Radoszewski","submitted_at":"2026-06-30T21:33:31Z","abstract_excerpt":"A suffixient array is a novel data structure that, when combined with an index providing direct access on a text $T$, allows us to answer a variety of pattern matching queries. In this work, we show how to compute a smallest suffixient array for $T[1\\dots n]$ in $O(\\frac{n\\log \\sigma}{\\sqrt{\\log n}}+\\min(r,\\bar{r})\\log^\\epsilon n)$ time for any $\\epsilon > 0$, where $\\sigma$ is the alphabet size of $T$ and $r$ and $\\bar{r}$ are the numbers of equal-letter runs of the Burrows-Wheeler transforms of $T$ and its reverse $\\overline{T}$, respectively. This time complexity becomes sublinear when $\\si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00204","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00204/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.00204","created_at":"2026-07-02T00:18:38.988429+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00204v1","created_at":"2026-07-02T00:18:38.988429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00204","created_at":"2026-07-02T00:18:38.988429+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAVYBYL3FXPL","created_at":"2026-07-02T00:18:38.988429+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAVYBYL3FXPL2LLD","created_at":"2026-07-02T00:18:38.988429+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAVYBYL3","created_at":"2026-07-02T00:18:38.988429+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/MAVYBYL3FXPL2LLDJX6KVAI3OC","json":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC.json","graph_json":"https://pith.science/api/pith-number/MAVYBYL3FXPL2LLDJX6KVAI3OC/graph.json","events_json":"https://pith.science/api/pith-number/MAVYBYL3FXPL2LLDJX6KVAI3OC/events.json","paper":"https://pith.science/paper/MAVYBYL3"},"agent_actions":{"view_html":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC","download_json":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC.json","view_paper":"https://pith.science/paper/MAVYBYL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00204&json=true","fetch_graph":"https://pith.science/api/pith-number/MAVYBYL3FXPL2LLDJX6KVAI3OC/graph.json","fetch_events":"https://pith.science/api/pith-number/MAVYBYL3FXPL2LLDJX6KVAI3OC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/action/storage_attestation","attest_author":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/action/author_attestation","sign_citation":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/action/citation_signature","submit_replication":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/action/replication_record"}},"created_at":"2026-07-02T00:18:38.988429+00:00","updated_at":"2026-07-02T00:18:38.988429+00:00"}