{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MAVYBYL3FXPL2LLDJX6KVAI3OC","short_pith_number":"pith:MAVYBYL3","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"},"canonical_sha256":"602b80e17b2ddebd2d634dfcaa811b70b023c757e9cde2cfd5f1790fdbd0ce43","source":{"kind":"arxiv","id":"2607.00204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00204","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00204v1","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00204","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"pith_short_12","alias_value":"MAVYBYL3FXPL","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"pith_short_16","alias_value":"MAVYBYL3FXPL2LLD","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"pith_short_8","alias_value":"MAVYBYL3","created_at":"2026-07-02T00:18:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MAVYBYL3FXPL2LLDJX6KVAI3OC","target":"record","payload":{"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"},"canonical_sha256":"602b80e17b2ddebd2d634dfcaa811b70b023c757e9cde2cfd5f1790fdbd0ce43","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"},"source_kind":"arxiv","source_id":"2607.00204","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-07-02T00:18:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ppaam/JAxoLKrTrxHJ7VtTqWbcsykcis+QGZJ0NH+InCYDNLBHXQv0O2jX01T0Lct07xNJ3MMYr3RieSwdd/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:19:45.086937Z"},"content_sha256":"5d6723b0d4c3267cae7cd3c51725d4e618f680e9407232377fe5dcfb6d97d8fe","schema_version":"1.0","event_id":"sha256:5d6723b0d4c3267cae7cd3c51725d4e618f680e9407232377fe5dcfb6d97d8fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MAVYBYL3FXPL2LLDJX6KVAI3OC","target":"graph","payload":{"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"},"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-07-02T00:18:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4U11uyo3m6evfL08xmotrFkTqFDwzYzw3iYqGOzAR85r7z3LeI4JW/PFna/SyPW7A9CM+sLEufuw4l3LyinCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:19:45.087292Z"},"content_sha256":"36b37b9c80714792405560f9a31e6fd17476630f1a1013543ad0a0452889164f","schema_version":"1.0","event_id":"sha256:36b37b9c80714792405560f9a31e6fd17476630f1a1013543ad0a0452889164f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/bundle.json","state_url":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/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-07-04T02:19:45Z","links":{"resolver":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC","bundle":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/bundle.json","state":"https://pith.science/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAVYBYL3FXPL2LLDJX6KVAI3OC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MAVYBYL3FXPL2LLDJX6KVAI3OC","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":"a32ab593691280aa414139d533d6c5d5c3eb28a5fbeaeff2329b8760fb189b24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T21:33:31Z","title_canon_sha256":"4d393a134b15390a87120efd7740ed9ba212e948df051e148778b424dab58879"},"schema_version":"1.0","source":{"id":"2607.00204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00204","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00204v1","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00204","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"pith_short_12","alias_value":"MAVYBYL3FXPL","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"pith_short_16","alias_value":"MAVYBYL3FXPL2LLD","created_at":"2026-07-02T00:18:38Z"},{"alias_kind":"pith_short_8","alias_value":"MAVYBYL3","created_at":"2026-07-02T00:18:38Z"}],"graph_snapshots":[{"event_id":"sha256:36b37b9c80714792405560f9a31e6fd17476630f1a1013543ad0a0452889164f","target":"graph","created_at":"2026-07-02T00:18:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00204/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cristian Urbina, Francisco Olivares, Giuseppe Romana, Gonzalo Navarro, Hiroto Fujimaru, Jakub Radoszewski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T21:33:31Z","title":"Computing Smallest Suffixient Arrays in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00204","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:5d6723b0d4c3267cae7cd3c51725d4e618f680e9407232377fe5dcfb6d97d8fe","target":"record","created_at":"2026-07-02T00:18:38Z","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":"a32ab593691280aa414139d533d6c5d5c3eb28a5fbeaeff2329b8760fb189b24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T21:33:31Z","title_canon_sha256":"4d393a134b15390a87120efd7740ed9ba212e948df051e148778b424dab58879"},"schema_version":"1.0","source":{"id":"2607.00204","kind":"arxiv","version":1}},"canonical_sha256":"602b80e17b2ddebd2d634dfcaa811b70b023c757e9cde2cfd5f1790fdbd0ce43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"602b80e17b2ddebd2d634dfcaa811b70b023c757e9cde2cfd5f1790fdbd0ce43","first_computed_at":"2026-07-02T00:18:38.988354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:38.988354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+m9uWqrOgrzu7dVqQultKS1BQN0R+39f3iLiPQoA4bcWF67m6QIeoraY0uKiKHH2yoA6RwnwIodQxSzNoI4XCg==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:38.988808Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d6723b0d4c3267cae7cd3c51725d4e618f680e9407232377fe5dcfb6d97d8fe","sha256:36b37b9c80714792405560f9a31e6fd17476630f1a1013543ad0a0452889164f"],"state_sha256":"a024b9bb2ec2f1b46516f85ea856fa751cc26c632e0729ebe70efc89bfcc1976"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oMfglOipaNsc5Tj5Gxf/dL2I1Nb3g1MbTTmrKn9bDl1sZSgl688j7RhSD+SUTzf4e50H4P7lSqIUJksYz4TCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T02:19:45.089381Z","bundle_sha256":"2bd0bd2361393b9dab4faf2475b4c585e7f6565e44c4f0035775351c539ba9fd"}}