{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","short_pith_number":"pith:LJ3SMSNQ","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"},"canonical_sha256":"5a772649b01caf337c5f8bf52eed81c0fe514f25e4a6e44dd630c4da5735b221","source":{"kind":"arxiv","id":"2607.08566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08566","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08566v1","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08566","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"LJ3SMSNQDSXT","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"LJ3SMSNQDSXTG7C7","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"LJ3SMSNQ","created_at":"2026-07-10T01:19:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"record","payload":{"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"},"canonical_sha256":"5a772649b01caf337c5f8bf52eed81c0fe514f25e4a6e44dd630c4da5735b221","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"},"source_kind":"arxiv","source_id":"2607.08566","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-10T01:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lz0/PUASZoAPILQBmWBFqJzZHFpfAEZRBzNw23x9O/3RAPlVIINboEaHVpRthhFHnOrekW7B4cfAamuRJhuCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.237907Z"},"content_sha256":"30b4e23b50939df473fb3ee3e701c04e01c79d7f4f6b481027cd20af94892c62","schema_version":"1.0","event_id":"sha256:30b4e23b50939df473fb3ee3e701c04e01c79d7f4f6b481027cd20af94892c62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"graph","payload":{"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"},"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-10T01:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iTZk7m2CQP45O/Fog1Fv+zyhMvaEvddVo0YYbNhnbNrG612VP+hlEdJcbbJfves+A0beFUhDehdw1hQh0jHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.239413Z"},"content_sha256":"bc01d40ac385664f253ab8414ea11769779ec5b01e8b334e19b49739410315a0","schema_version":"1.0","event_id":"sha256:bc01d40ac385664f253ab8414ea11769779ec5b01e8b334e19b49739410315a0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Ryan Williams. “A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications.” In:Theoretical Computer Science348.2–3 (Dec. 2005), pp. 357–365.issn: 03043975.doi:10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier. com","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Ryan Williams. “A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications.” In:Theoretical Computer Science348.2–3 (Dec. 2005), pp. 357–365.issn: 03043975.doi:10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier. com","reconstructed_doi":"10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13"},"severity":"advisory","ref_index":24,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier.com/retrieve/pii/S0304397505005438.13","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0f0f7583bdd7e6a52cddff78ed88a794c93bcab6ee22f7447e3ec7211b51bb73","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11844,"payload_sha256":"a7f3ce687d0c5f78e71d1baca28c862a8d2473be412df35917946fb692f64591","signature_b64":"ldQO+uGl15jn1wdilIEIcSWCQJw8+mM11l2cIkYcDNjMkBT38sW2y5AkzLVVr9PKa+6d85OlEvdqYmS/wINaAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chZFHgkcSrCLvWc7EblUrAUadaW5gdBu5tveZmGTQAMOpHep7tW15cZtuXTYHtgpL1JRTSJoCj2Guw26XNrMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.266046Z"},"content_sha256":"e798080fe4c8303a02805f5a1af3dccb3fdc3b327d160a5dafce58637e37f939","schema_version":"1.0","event_id":"sha256:e798080fe4c8303a02805f5a1af3dccb3fdc3b327d160a5dafce58637e37f939"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0022-0000(88) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"GadM.LandauandUziVishkin.“FastStringMatchingwithkDifferences.” In:J. Comput. Syst. Sci.37.1 (1988), pp. 63–78.doi:10.1016/0022- 0000(88)90045- 1.url:https: //doi.org/10.1016/0022-0000(88)90045-1","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"GadM.LandauandUziVishkin.“FastStringMatchingwithkDifferences.” In:J. Comput. Syst. Sci.37.1 (1988), pp. 63–78.doi:10.1016/0022- 0000(88)90045- 1.url:https: //doi.org/10.1016/0022-0000(88)90045-1","reconstructed_doi":"10.1016/0022-0000(88"},"severity":"advisory","ref_index":22,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0022-0000(88","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f41dc4bf52afadbfe155baad98658adddf651d7c455642bc3d32aaa5e34d9c0e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11843,"payload_sha256":"4ceeb7177dce7426a69613436147e889e8202988b5ffdb602c7906b8f0eed980","signature_b64":"+YVYOaLKR678a+Drgr62CDwoxif45bDETaLO14lrN/XoLc1jMNCKNaO0MzlojGF2SYeWdJnAhBC1KuK5Zp/SCQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3jNdYUDvj5Jwcq2YZyFpRO5CV4nHULICZE4diQqpZAEZYqe0MY0XzxhCCyB1rZj9Xi+BBhl1zuMURtvmwFrjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.266789Z"},"content_sha256":"8ab3abcb0e1da8489a69cda838b1608965809c5e1e5d1e482eeca3420b48f17a","schema_version":"1.0","event_id":"sha256:8ab3abcb0e1da8489a69cda838b1608965809c5e1e5d1e482eeca3420b48f17a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Donald E. Knuth, James H. Morris Jr., and Vaughan R. Pratt. “Fast Pattern Matching in Strings.” In:SIAM Journal on Computing6.2 (June 1977), pp. 323–350.issn: 0097- 5397, 1095-7111.doi:10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/ ","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":20,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Donald E. Knuth, James H. Morris Jr., and Vaughan R. Pratt. “Fast Pattern Matching in Strings.” In:SIAM Journal on Computing6.2 (June 1977), pp. 323–350.issn: 0097- 5397, 1095-7111.doi:10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/ ","reconstructed_doi":"10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024"},"severity":"advisory","ref_index":20,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/0206024","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"84342b3a6281abdd199050f1d37367b4619b8411d9ce3e2929dd6d95e4971c09","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11842,"payload_sha256":"7897d901409f229c791d5d293250d9bc77b00f16c32a4225aab7112db66b5989","signature_b64":"pCyfjYdUbg8xidSwy2abNDMxeU7he2i/SWtLWMfxJG+rzmWGnnbzTBMSn4S+zES6SpoQKUx33nIZorpk0WRnAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftldp7PfqOFLteZjy35RWAnUfk6adwwhrjeCm/yYlvaJIZOslkdL1dWxo6R/DCHpYOn2+nyfs7tZ/JkoLAtdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.268341Z"},"content_sha256":"deab06906ce38b7541cea3fadf2ab111c676ad22ca1c29f28d48c488a92ef9c1","schema_version":"1.0","event_id":"sha256:deab06906ce38b7541cea3fadf2ab111c676ad22ca1c29f28d48c488a92ef9c1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Costas S. Iliopoulos and Jakub Radoszewski. “Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.” In:27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Ed. by Roberto Grossi an","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Costas S. Iliopoulos and Jakub Radoszewski. “Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.” In:27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Ed. by Roberto Grossi an","reconstructed_doi":"10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8"},"severity":"advisory","ref_index":19,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.CPM.2016.8.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"55e4a6bc2601a3496a31761cd353d1babde64e123914baeb77ce556d37bcf8d4","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11841,"payload_sha256":"b09658927a585f3cceea211053bb39c205a927e81af019a69c589be2b45b0839","signature_b64":"h9xjXsIa5dqJs/w/ueYYDx1433m6jn/U/09jTBIVEM74y/GhYrKG7pKPfP1Pef0oBtPepyaMIPmBvM0rY3BADQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YgCXeZ5iGXFPi5z5PSlA7dgj8CRuonIclGRP8q8SlLMRs7d42zkZiL768NffMT3yb3aoYgEGLnS/92SJp5kBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.269852Z"},"content_sha256":"42f6af730e33daa3f953f49d809aaaa0cd1a7f4611570cdca76609ea4ad64efa","schema_version":"1.0","event_id":"sha256:42f6af730e33daa3f953f49d809aaaa0cd1a7f4611570cdca76609ea4ad64efa"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Costas S. Iliopoulos, Ritu Kundu, and Solon P. Pissis. “Efficient pattern matching in elastic-degenerate strings.” In:Information and Computation279 (2021). Selected Papers of the 11th International Conference on Language and Automata Theor","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Costas S. Iliopoulos, Ritu Kundu, and Solon P. Pissis. “Efficient pattern matching in elastic-degenerate strings.” In:Information and Computation279 (2021). Selected Papers of the 11th International Conference on Language and Automata Theor","reconstructed_doi":"10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048"},"severity":"advisory","ref_index":18,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.ic.2020.104616.url:https://www.sciencedirect.com/science/article/pii/S0890540120301048","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3fc7993ea4a7af64e0ce3a0909bd3fc4cb1392c5ef60f9a3ff928e3803442a6e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11840,"payload_sha256":"881bfb4999ee69b53dc3c681729241e70c4afd36f5280c99239fb700e668916d","signature_b64":"v4UYg5Sqw3qqHi3sunO5ubfHl/z4Mp6ReGWCH2iEFEXZafmcSTHpTgSmpFEBmh0R/j6mEnMwv6Py3GV53nXODg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4lKAPvi6EyXJyQa8GQynG2MGgvIZs+xHW26p8XwKp0Mp+li0AbQq/iELD7htuh278qjupMSIfBkWulBnfY8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.273734Z"},"content_sha256":"a2d572747a1536397addaee7065fb4312cea8f2a43f45be9937383e22851daf5","schema_version":"1.0","event_id":"sha256:a2d572747a1536397addaee7065fb4312cea8f2a43f45be9937383e22851daf5"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Paweł Gawrychowski and Przemysław Uznański. “Towards Unified Approximate Pattern Matching for Hamming andL1 Distance.” In:45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Repu","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Paweł Gawrychowski and Przemysław Uznański. “Towards Unified Approximate Pattern Matching for Hamming andL1 Distance.” In:45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Repu","reconstructed_doi":"10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62"},"severity":"advisory","ref_index":14,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/lipics.icalp.2018.62.url:https://doi.org/10.4230/LIPIcs.ICALP.2018.62","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"65d37e9464697851a7b7a3bd9d98ed6b3c334630896ca5da81729c6dce5c09db","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11839,"payload_sha256":"cebd1e938dbfcca0c200d27ab2acc79e7b2d7d80117c0c03ba49650f446b1aa9","signature_b64":"YiWPnvJLki0yQVJGGeznpB8ONsKwhxTYr2r8JwEQ8q099rW8oHBUccPWIHAaL+BA5OPLVo2Z39v6YwiPPgc/Dw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ng0OGUDpV/Ey1KMTGj+IBW7cN3bRTpK7oJyxlb+9X5NOgvc/GbHz5wVXO/exhHpHWUn6o8MZtO+/691l12rMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.274517Z"},"content_sha256":"6b33f99c62b031f2bfdb49bec27872f181d33e34ad8e70267689969954716d64","schema_version":"1.0","event_id":"sha256:6b33f99c62b031f2bfdb49bec27872f181d33e34ad8e70267689969954716d64"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. “Faster Approxi- mate Pattern Matching: A Unified Approach.” In:61st IEEE Annual Symposium on Foun- dations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19,","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. “Faster Approxi- mate Pattern Matching: A Unified Approach.” In:61st IEEE Annual Symposium on Foun- dations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19,","reconstructed_doi":"10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095"},"severity":"advisory","ref_index":7,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/focs46700.2020.00095.url:https://doi.org/10.1109/FOCS46700.2020.00095","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"b0b2f8b6cb3e055b64f4c43d74f5c24792c296ca8135e234d8cd0f8d8d942f9d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11838,"payload_sha256":"fd343751abd889f89579f31e8c298fa8a5d10337061e3d8a3c9af0e320cc5dc5","signature_b64":"Q3nOpn5iJukdI8MsdOV6IvsQsRlood1mB3PYq2CBWC1raXoCd8ipeIaGQHSr+rtvMf/FUwV2SCOfu1glYXAiCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbOuyleoNHo9oWruAZiw6aXb/FWImJiNtD8vaPWQxC5Ae8d4PCPA64aiKCl5EUiotj8mDSv9m3uzyt6KnBvPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.276288Z"},"content_sha256":"28856bb03f3ffe79ae10b0d0d5df233ff5257f76e157f2aa82976b56c8ab170b","schema_version":"1.0","event_id":"sha256:28856bb03f3ffe79ae10b0d0d5df233ff5257f76e157f2aa82976b56c8ab170b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Mai Alzamel et al. “Degenerate String Comparison and Applications.” In:LIPIcs, Volume 113, WABI 2018113 (2018). Ed. by Laxmi Parida and Esko Ukkonen, 21:1–21:14.issn: 1868-8969.doi:10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/ ","arxiv_id":"2607.08566","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Mai Alzamel et al. “Degenerate String Comparison and Applications.” In:LIPIcs, Volume 113, WABI 2018113 (2018). Ed. by Laxmi Parida and Esko Ukkonen, 21:1–21:14.issn: 1868-8969.doi:10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/ ","reconstructed_doi":"10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21"},"severity":"advisory","ref_index":1,"audited_at":"2026-07-10T05:22:11.969215Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPICS.WABI.2018.21.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.21","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"da93528890aa71835724bd90668bcdb1fefb6fdbe42c82c467ec23f9f3ac54e9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":11837,"payload_sha256":"d19b92f7917aa986a50895a833900aa4fdd2432f4536cf3fff08891fbaa5c315","signature_b64":"I2TX9onzEF/9hT8cbOeGmjyV7EJ2WK71wINt/7A0M6rkgaPyAZ4wFC8jDUlhTJpimJy2BGDVGersQfoc3U6xAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T05:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r29ET054NxhoqOsEt6FFCxqFdOewwtaAhfe54lVmt0uFsOfSR9lcLKD1PNGG5LDAev039mqvf0gbJ7N/A0l3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:24:10.277065Z"},"content_sha256":"c3ce4bca96d2747dc4ee5976acc883c77a1e271d098caf53482e29edb9dd0832","schema_version":"1.0","event_id":"sha256:c3ce4bca96d2747dc4ee5976acc883c77a1e271d098caf53482e29edb9dd0832"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/bundle.json","state_url":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/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-08-17T12:24:10Z","links":{"resolver":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD","bundle":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/bundle.json","state":"https://pith.science/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ3SMSNQDSXTG7C7RP2S53MBYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LJ3SMSNQDSXTG7C7RP2S53MBYD","merge_version":"pith-open-graph-merge-v1","event_count":10,"valid_event_count":10,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"084ecda7030358a652c9af7e9c3ea26dbdc841b60fe634f866855ca3880fba04","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:56:01Z","title_canon_sha256":"8a5f161935d024a3f65ef30c7ef2f9615b014b09b8423107f3ad00046706dad1"},"schema_version":"1.0","source":{"id":"2607.08566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08566","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08566v1","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08566","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"LJ3SMSNQDSXT","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"LJ3SMSNQDSXTG7C7","created_at":"2026-07-10T01:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"LJ3SMSNQ","created_at":"2026-07-10T01:19:53Z"}],"graph_snapshots":[{"event_id":"sha256:bc01d40ac385664f253ab8414ea11769779ec5b01e8b334e19b49739410315a0","target":"graph","created_at":"2026-07-10T01:19:53Z","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.08566/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Est\\'eban Gabory","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08566","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:30b4e23b50939df473fb3ee3e701c04e01c79d7f4f6b481027cd20af94892c62","target":"record","created_at":"2026-07-10T01:19:53Z","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":"084ecda7030358a652c9af7e9c3ea26dbdc841b60fe634f866855ca3880fba04","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T14:56:01Z","title_canon_sha256":"8a5f161935d024a3f65ef30c7ef2f9615b014b09b8423107f3ad00046706dad1"},"schema_version":"1.0","source":{"id":"2607.08566","kind":"arxiv","version":1}},"canonical_sha256":"5a772649b01caf337c5f8bf52eed81c0fe514f25e4a6e44dd630c4da5735b221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a772649b01caf337c5f8bf52eed81c0fe514f25e4a6e44dd630c4da5735b221","first_computed_at":"2026-07-10T01:19:53.802069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:53.802069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pJomrJ60XYYuzJnSxpN0iLu8eDx6nX6OUAO3XxoomaEIe3inle876Fe8x/ddl4Q7TeCDVoL5hWFVS4IXOXsMDg==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:53.802488Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08566","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:28856bb03f3ffe79ae10b0d0d5df233ff5257f76e157f2aa82976b56c8ab170b","sha256:42f6af730e33daa3f953f49d809aaaa0cd1a7f4611570cdca76609ea4ad64efa","sha256:6b33f99c62b031f2bfdb49bec27872f181d33e34ad8e70267689969954716d64","sha256:8ab3abcb0e1da8489a69cda838b1608965809c5e1e5d1e482eeca3420b48f17a","sha256:a2d572747a1536397addaee7065fb4312cea8f2a43f45be9937383e22851daf5","sha256:c3ce4bca96d2747dc4ee5976acc883c77a1e271d098caf53482e29edb9dd0832","sha256:deab06906ce38b7541cea3fadf2ab111c676ad22ca1c29f28d48c488a92ef9c1","sha256:e798080fe4c8303a02805f5a1af3dccb3fdc3b327d160a5dafce58637e37f939"]}],"invalid_events":[],"applied_event_ids":["sha256:30b4e23b50939df473fb3ee3e701c04e01c79d7f4f6b481027cd20af94892c62","sha256:bc01d40ac385664f253ab8414ea11769779ec5b01e8b334e19b49739410315a0"],"state_sha256":"31a5c43650b754f3d8b569f1662cd460bee3bbefbad9f952b132cbdd2038955d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFVe3tuaerW6PDU8rN3S5qFTyY0eBnPCrUUizvE+rOlapn0a79rTQ6cVfr3QrZsE9AXVeD+89IH8R9aCW6vrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:24:10.293133Z","bundle_sha256":"3b2d070e2796f32c6e8c0bd3040d46eee27fe1dbddf7206b2566cdbdd4938d42"}}