{"as_of":"2026-08-17T21:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c047971e134ead4ddc7dd2f86d118a0d059219825d245800a5aa1349e5617094","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T05:14:14.390070Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.08566/citation-record","integrity":"/paper/2607.08566/integrity","json":"/paper/2607.08566/citation-record.json","paper":"/paper/2607.08566"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.wabi.2018.21.url:https://drops.dagstuhl.de/","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.521027Z","title":"Degenerate String Comparison and Applications","venue":null,"work_id":"cea48796-9e7e-4b6b-8eac-3a7dd79bf1b8","year":2018},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:cd16715b4518756ded8618dbdc84f8c736e47946810843757d9e70ebcf3888e2","observation_id":"23c1186d-b902-45fa-9253-0938e7940c5d","resolution":{"observed_at":"2026-07-10T05:16:47.522774Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.cpm.2018.9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Faster Online Elastic Degenerate String Matching","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"9bd60f38-b1c8-41fc-9a0b-98e4659ab3b6","year":2018},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:9d2b7e7097939121291e7a5d5330b70a416f9c2223e32c9622e4ef9dcffc0141","observation_id":"2e63834d-1e53-4774-924d-498547c7fd88","resolution":{"observed_at":"2026-07-10T05:16:47.530325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:56.572941+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:56.572941+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.wabi.2024.14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"1080780b-7257-407f-82e6-33d142be54c8","year":2024},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:f4799634dae4fe871a86ff5ea1b9a4dbf5a66fe1e4b77d363faea8fb4fe98c84","observation_id":"b10c4a37-89e7-48a8-9417-6fa315e32954","resolution":{"observed_at":"2026-07-10T05:16:47.506559Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:56.994194+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:56.994194+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:48.304719Z","title":"Which Regular Expression Patterns Are Hard to Match?","venue":null,"work_id":"23fbb179-367a-40a6-a98c-fe6d120ad8ff","year":2016},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:0d1f7c8b51edfe8ec7617e900e794968d1346fa316a639f5bd295bef22671459","observation_id":"dcc1ef39-d2e1-4928-83f9-8e15189ecb5f","resolution":{"observed_at":"2026-07-10T05:16:48.305920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2019.21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Even Faster Elastic-Degenerate String Matching via Fast Ma- trix Multiplication","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"1886b61d-8674-4fe6-ac43-2fb466ffcad7","year":2019},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:9221993734f2cc90fbb8ef0bcdf7844efbe691ebba01b2dcab6943ed8ee608e0","observation_id":"69b89db7-b840-4e03-b013-3897417564bd","resolution":{"observed_at":"2026-07-10T05:16:47.525461Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:57.399154+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:57.399154+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.00918","last_updated":"2016-11-07T06:44:04Z","snapshot_observed_at":"2026-08-14T21:32:10.367809Z","submitted_at":"2016-11-03T08:55:07Z","title":"A Dichotomy for Regular Expression Membership Testing","version":2},"cited_work":{"arxiv_id":"1611.00918","doi":"10.48550/arxiv.1611.00918","metadata_source":"pith","pith_arxiv_id":"1611.00918","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Dichotomy for Regular Expression Membership Testing","venue":"cs.DS","work_id":"6aafc274-d3a8-4e3b-9adc-09221d6c2cd9","year":2016},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"cited_paper":"/paper/1611.00918","citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:0bdb63e134453323560da407648de8cff0b65201ba4f567073d2998507b8e553","observation_id":"2fd2ee12-47da-4cf9-ba78-91dc5da04117","resolution":{"observed_at":"2026-07-10T05:16:47.500532Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:57.830918+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:57.830918+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6700.2020","doi":"10.1109/focs46700.2020.00013","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"c016149e-231e-40ae-a771-6cdae0f78587","year":2020},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:51e5905194950d2aa43b289ba1fc66d780099daca2b1a92c598e8bffe68c596d","observation_id":"1faa1f43-7421-47f3-8aa6-439a7601dc04","resolution":{"observed_at":"2026-07-10T05:16:47.513874Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7352.10073","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.952742Z","title":"In: Babai, L","venue":null,"work_id":"77affa1c-7d23-4a82-8309-3a681c0e1524","year":2004},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:d3386ae524b7e747f76f59eeadd05b48dc26ce57723eea8382fcdbf93b8835f1","observation_id":"5d4e7f1e-e9fb-45dc-916d-a6b37fa400e7","resolution":{"observed_at":"2026-07-10T05:16:47.954306Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:48.302798Z","title":"Cambridge University Press, 2007.isbn: 978-0-521-84899-2","venue":null,"work_id":"3f902e9d-6a44-4068-a356-8968b4f5377c","year":2007},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:590c1ffa758bf7709d18cea199022b5d0d4c24003af5ae20b18da01132a5467c","observation_id":"8e2c9fe0-10a9-479d-861e-4e3b12a818d4","resolution":{"observed_at":"2026-07-10T05:16:48.304188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.16297","last_updated":"2026-06-17T05:48:02Z","snapshot_observed_at":"2026-08-14T08:19:44.249202Z","submitted_at":"2026-03-17T09:35:02Z","title":"Quantum Pattern Matching in Generalised Degenerate Strings","version":2},"cited_work":{"arxiv_id":"2603.16297","doi":"10.48550/arxiv.2603.16297","metadata_source":"pith","pith_arxiv_id":"2603.16297","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Quantum Pattern Matching in Generalised Degenerate Strings","venue":"quant-ph","work_id":"04e65fd6-6e51-477e-94b8-8b95edb70d1a","year":2026},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"cited_paper":"/paper/2603.16297","citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:6f5c41006cdbbdc5bf412c02dd8ef9436e4f65d1ee4e89c9d54b9171df0010ab","observation_id":"e0c35c73-c59f-4fe6-9a10-9f2ec83a07c8","resolution":{"observed_at":"2026-07-10T05:16:47.520112Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:58.594999+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:58.594999+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.00629","last_updated":"2020-03-04T12:27:06Z","snapshot_observed_at":"2026-08-07T08:21:01.316999Z","submitted_at":"2020-02-03T10:01:34Z","title":"Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails","version":2},"cited_work":{"arxiv_id":"2002.00629","doi":"10.48550/arxiv.2002.00629","metadata_source":"pith","pith_arxiv_id":"2002.00629","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails","venue":"cs.CC","work_id":"c36a5c23-e4b7-4ad8-b59d-0597489d3c4b","year":2020},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"cited_paper":"/paper/2002.00629","citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:1bdfc569ae71a03d050154be3547e341461a73f77983712ba72cac29f71c00f6","observation_id":"747da82d-32c1-4df3-8a14-9f04c0b153c9","resolution":{"observed_at":"2026-07-10T05:16:47.551805Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:59.027356+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:59.027356+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:48.300813Z","title":"Graphs Cannot Be Indexed in Polynomial Time for Sub-Quadratic Time String Matching, Unless SETH Fails","venue":null,"work_id":"a404098f-9979-424f-ac1f-09691df91f82","year":2023},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:3856b3eeea0c737da2a4759305c3f8ec2062fc331dc6dc3bf34c03371f05364a","observation_id":"085235e0-5d7e-49ff-9e05-03a308c58a81","resolution":{"observed_at":"2026-07-10T05:16:48.302226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.cpm.2023.11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications","venue":"VU Research Portal","work_id":"d4454584-b6b3-46fb-ac4a-3b3b537eda4e","year":2023},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:a63c2f024dce29ef8a64f79eab57db046b10fc1bf5d9fef485d12d7c980846d1","observation_id":"5f8bce12-cbb3-4fb1-94f2-c5eb479c1331","resolution":{"observed_at":"2026-07-10T05:16:47.527784Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:59.442381+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:59.442381+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2018.62.url:https:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.501245Z","title":"Towards Unified Approximate Pattern Matching for Hamming andL1 Distance","venue":null,"work_id":"ff03321f-351d-4cf9-8708-732c33b08337","year":2018},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:0e8e7e5ebd836a15177513c16ee816dc2dcac3c99475c77b99ae40ae0c7378fc","observation_id":"0ebf5c75-de14-4306-a7ec-531fc278b8a5","resolution":{"observed_at":"2026-07-10T05:16:47.503080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:20:59.771697+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:20:59.771697+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.552739Z","title":"In: Fodor, P., Montali, M., Calvanese, D., Roman, D","venue":null,"work_id":"138a89bd-9857-4e55-a915-ff4f36d70e77","year":2020},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:0a70aa8e72e7d4b54d65cb84eaec092e8180f3bcb6345513e9e3e90476520384","observation_id":"a9a2fd78-95ac-46f8-8bc6-0f8065616c86","resolution":{"observed_at":"2026-07-10T05:16:47.554248Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.cpm.2017.9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On-Line Pattern Matching on Similar Texts","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"e97d0a38-295b-4599-8d90-071915759acc","year":2017},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:d9bad83b06710e09f1ff0dd194389fcc906cafeaeb3777f655fc7005e5cbbb24","observation_id":"a5a4ddb6-0a96-463e-aea8-b8a0c88a4453","resolution":{"observed_at":"2026-07-10T05:16:47.509420Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:21:00.18748+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:21:00.18748+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6539.274660","doi":"10.1145/2746539.2746604","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 47th annual ACM Symposium on Theory of Computing (STOC) , pages =","venue":null,"work_id":"788e1f04-8125-4651-8788-9baed48d255e","year":2015},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:52c2d54f5e9190b08e61da718896877e10153dadbc0bf1827d5c7f7365f5cf6a","observation_id":"e9e1cc80-2c1a-4c69-b53f-532f888c6179","resolution":{"observed_at":"2026-07-10T05:16:47.540036Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-05-20T09:56:25.981667+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T09:56:25.981667+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.104616","doi":"10.1016/j.ic.2020.104616","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Iliopoulos, Ritu Kundu, and Solon P","venue":"Information and Computation","work_id":"69380277-935a-408b-bf93-7167a6f2d4d9","year":2021},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:676ed93f5719188f6b63564d6fdb91b0e775f4dda7cf2f68797543bbe63523ea","observation_id":"b52377ab-f31b-40e4-a64a-983a871b3701","resolution":{"observed_at":"2026-07-10T05:16:47.536596Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.cpm.2016.8.url:https://drops.dagstuhl.de/","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.543685Z","title":"Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties","venue":null,"work_id":"8bafe04c-8d57-41ed-b171-6c656e93662c","year":2016},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:6739c2ee9cb51e0dab7f019633b25bbbde13e7ff9e7bb79ad51e0dc3c82fe53e","observation_id":"da019b7b-dd5c-428f-88f3-fdf8def667ef","resolution":{"observed_at":"2026-07-10T05:16:47.545284Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0206024.url:http://epubs.siam.org/doi/10.1137/","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.546118Z","title":"Fast Pattern Matching in Strings","venue":null,"work_id":"a815295e-0d25-4d92-a34d-caf05881dafd","year":1977},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:d83b7f15d5e47beceb49ac0082ebed421281776d182dee753e03363a4e622d18","observation_id":"489c8f57-452e-4a5d-b8c4-134c01577597","resolution":{"observed_at":"2026-07-10T05:16:47.548012Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:48.297052Z","title":"An Efficient String Matching Algorithm with k Differences for Nucleotide and Amino Acid Sequences","venue":null,"work_id":"66ce45f4-e36c-4218-a0ac-dfe06f38e9ac","year":1986},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:e958fb4ca8850c67f4ef2812fbff6fb294e412199c9015f6df55cd86bd1fcb90","observation_id":"1872408a-7162-4a91-81e2-f6cadee60bb2","resolution":{"observed_at":"2026-07-10T05:16:48.298410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0022-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:17:32.854191Z","title":"Nonlinear programming in complex space: Sufficient conditions and duality","venue":null,"work_id":"9c49f5a6-5d05-4bf3-a82c-bd60777cfc34","year":1974},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:ca25a7da72e02455b19954419c217954de572b9e4bf4a59d7f3963c8fbadc5ae","observation_id":"2ed9383d-4494-4ea9-9f00-d3944d95cd82","resolution":{"observed_at":"2026-07-10T05:16:47.542658Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:48.298974Z","title":"Set Intersection and Sequence Matching with Mismatch Counting","venue":null,"work_id":"70e2bceb-4483-4c81-8cef-adb01624fdf6","year":2016},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:0236292f3abd574cf52a466cde528610ef435b6235f26766c3dfc9840b4601de","observation_id":"d5e13e8b-4590-4d67-9620-049ed728dc6e","resolution":{"observed_at":"2026-07-10T05:16:48.300216Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2005.09.023.url:https://linkinghub.elsevier","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T05:16:47.531194Z","title":"A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications","venue":null,"work_id":"bd6b1f9a-3220-434a-98c8-8f1fff7a5e33","year":2005},"citing_paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T05:14:14.390070Z"},"links":{"citing_paper":"/paper/2607.08566"},"observation_digest":"sha256:d913dd42bc395c705d4cb7f215256a1ab438a4469b99680f978a6d356540ba6a","observation_id":"36dfe489-15fd-4288-83df-8079de5abc85","resolution":{"observed_at":"2026-07-10T05:16:47.532949Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:21:01.273325+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:21:01.273325+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08566","last_updated":"2026-07-09T14:56:01Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T21:40:20.632408Z","submitted_at":"2026-07-09T14:56:01Z","title":"Algorithms and Indexing Lower Bounds for Variable String Matching"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":6,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":0,"verified_exact":10,"verified_fuzzy":4},"total_outbound_references":24},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.08566."}