{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","short_pith_number":"pith:LJ3SMSNQ","schema_version":"1.0","canonical_sha256":"5a772649b01caf337c5f8bf52eed81c0fe514f25e4a6e44dd630c4da5735b221","source":{"kind":"arxiv","id":"2607.08566","version":1},"attestation_state":"computed","paper":{"title":"Algorithms and Indexing Lower Bounds for Variable String Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Est\\'eban Gabory","submitted_at":"2026-07-09T14:56:01Z","abstract_excerpt":"A \\emph{generalized degenerate string} (GD) is a sequence $T=T_1\\dots T_n$ of nonempty finite sets of strings, called \\emph{segments}, such that all strings in a segment have the same length. Given a solid pattern $P$, GD string matching asks whether $P$ occurs in $T$. Ascone et al. (WABI 2024) identified this as the main remaining boundary case in the fine-grained complexity of pattern matching on variable strings, between variants with near-linear algorithms and those with SETH-based quadratic lower bounds. We give a $\\tilde{\\mathcal O}(N\\sqrt m)$-time algorithm, where $N$ is the total size "},"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.08566","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:56:01Z","cross_cats_sorted":[],"title_canon_sha256":"8a5f161935d024a3f65ef30c7ef2f9615b014b09b8423107f3ad00046706dad1","abstract_canon_sha256":"084ecda7030358a652c9af7e9c3ea26dbdc841b60fe634f866855ca3880fba04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:53.802488Z","signature_b64":"pJomrJ60XYYuzJnSxpN0iLu8eDx6nX6OUAO3XxoomaEIe3inle876Fe8x/ddl4Q7TeCDVoL5hWFVS4IXOXsMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a772649b01caf337c5f8bf52eed81c0fe514f25e4a6e44dd630c4da5735b221","last_reissued_at":"2026-07-10T01:19:53.802069Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:53.802069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms and Indexing Lower Bounds for Variable String Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Est\\'eban Gabory","submitted_at":"2026-07-09T14:56:01Z","abstract_excerpt":"A \\emph{generalized degenerate string} (GD) is a sequence $T=T_1\\dots T_n$ of nonempty finite sets of strings, called \\emph{segments}, such that all strings in a segment have the same length. Given a solid pattern $P$, GD string matching asks whether $P$ occurs in $T$. Ascone et al. (WABI 2024) identified this as the main remaining boundary case in the fine-grained complexity of pattern matching on variable strings, between variants with near-linear algorithms and those with SETH-based quadratic lower bounds. We give a $\\tilde{\\mathcal O}(N\\sqrt m)$-time algorithm, where $N$ is the total size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08566","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.08566/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.08566","created_at":"2026-07-10T01:19:53.802126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08566v1","created_at":"2026-07-10T01:19:53.802126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08566","created_at":"2026-07-10T01:19:53.802126+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ3SMSNQDSXT","created_at":"2026-07-10T01:19:53.802126+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ3SMSNQDSXTG7C7","created_at":"2026-07-10T01:19:53.802126+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ3SMSNQ","created_at":"2026-07-10T01:19:53.802126+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/LJ3SMSNQDSXTG7C7RP2S53MBYD","json":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD.json","graph_json":"https://pith.science/api/pith-number/LJ3SMSNQDSXTG7C7RP2S53MBYD/graph.json","events_json":"https://pith.science/api/pith-number/LJ3SMSNQDSXTG7C7RP2S53MBYD/events.json","paper":"https://pith.science/paper/LJ3SMSNQ"},"agent_actions":{"view_html":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD","download_json":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD.json","view_paper":"https://pith.science/paper/LJ3SMSNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08566&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ3SMSNQDSXTG7C7RP2S53MBYD/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ3SMSNQDSXTG7C7RP2S53MBYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/action/storage_attestation","attest_author":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/action/author_attestation","sign_citation":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/action/citation_signature","submit_replication":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/action/replication_record"}},"created_at":"2026-07-10T01:19:53.802126+00:00","updated_at":"2026-07-10T01:19:53.802126+00:00"}