{"as_of":"2026-08-15T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d49022822c4f4cccb50653abdedf0ecf60ea4f06e9c9c5b439d0b2e597cacdf2","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:33:00.075590Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2507.13885/citation-record","integrity":"/paper/2507.13885/integrity","json":"/paper/2507.13885/citation-record.json","paper":"/paper/2507.13885"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.07732","last_updated":"2024-05-21T17:14:26Z","snapshot_observed_at":"2026-08-13T04:20:31.476432Z","submitted_at":"2024-02-12T15:42:50Z","title":"Pattern Matching with Mismatches and Wildcards","version":2},"cited_work":{"arxiv_id":"2402.07732","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.07732","snapshot_observed_at":"2026-08-06T16:33:00.120090Z","title":"Pattern Matching with Mismatches and Wildcards","venue":"cs.DS","work_id":"b550cdb8-7036-4d3e-8c9a-0a5be7080139","year":2024},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.011655Z"},"links":{"cited_paper":"/paper/2402.07732","citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:5ff54c7b245a84c351f93d5041e01e4b1c3820c54d821bb3993f9271c4c1b48f","observation_id":"6f98da9e-e85a-4dca-877b-17ac9e4cf52a","resolution":{"observed_at":"2026-08-06T16:33:00.126828Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.318759Z","title":"Improved mpc algorithms for edit distance and ulam distance","venue":null,"work_id":"1b89599f-258c-4c35-991e-5ca5f9ca230e","year":2019},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.016136Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:bb0ab3ebde6e26bb78bd77043511d87f6d6070f561976d3339d9cf1cb93b7b3d","observation_id":"28809473-28c9-44b3-95ae-ac6d2e9dabdb","resolution":{"observed_at":"2026-08-06T16:33:00.322238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.306732Z","title":"1+ ε approximation of tree edit distance in quadratic time","venue":null,"work_id":"0261cf2d-ca15-43dc-80d4-f81f9e15fa6d","year":2019},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.019846Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:69797b8b0b2732666bb7f9c410753f8a85ade875714947f9155253217527184a","observation_id":"3802b572-44df-48a5-8522-d0773cbe558f","resolution":{"observed_at":"2026-08-06T16:33:00.310683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.294498Z","title":"Improved algorithms for edit distance and lcs: beyond worst case","venue":null,"work_id":"b3805b6d-321b-410c-9040-41ee05c07e1e","year":2020},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.023652Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:c3abe27d4c8b755fabc9d3da1163a8cb198eec493bfe2f5a670069d116c38ae1","observation_id":"8ceeb164-eeaa-4c3a-83f7-f85f2ca2fa68","resolution":{"observed_at":"2026-08-06T16:33:00.298105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.282671Z","title":"Approximating edit distance in truly subquadratic time: Quantum and mapreduce","venue":null,"work_id":"c4d1c977-e751-4523-be3c-6d68f9c64eac","year":2021},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.027702Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:333d20b74689df5a2b6af68aa2c28243682244dbbdc216ec8164461c6dfd6b57","observation_id":"0a3d3ee7-f9cb-41fa-b0bd-84a7f443dac0","resolution":{"observed_at":"2026-08-06T16:33:00.286632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0005055","last_updated":"2000-05-15T18:19:59Z","snapshot_observed_at":"2026-07-07T07:03:25.387553Z","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0005055","snapshot_observed_at":"2026-08-06T16:33:00.031182Z","title":"Quantum amplitude amplifica- tion and estimation","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.031182Z"},"links":{"cited_paper":"/paper/quant-ph/0005055","citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:54937e8eda505d722fc5d9927f5326d795dd1efe9d0bd1c9131b7a298deab751","observation_id":"68a31244-cd96-42ae-bceb-e386eaba669f","resolution":{"observed_at":"2026-08-06T16:33:00.031182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:33:00.270100Z","title":"Simple deterministic wildcard matching","venue":null,"work_id":"fb0dd577-7569-4f91-b956-e87ccba3f91a","year":2007},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.035306Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:8adabaf05899e512adb5bd1d6a37620afb8236c28a4eec80a38abef6673ea45e","observation_id":"c5a6a802-4de7-413a-b51b-9d45c78b6681","resolution":{"observed_at":"2026-08-06T16:33:00.274799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.258701Z","title":"Pattern matching with don’t cares and few errors","venue":null,"work_id":"2d284b2b-b7c2-48d7-ab00-2d524ac4a532","year":2010},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.038774Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:8e038fe69c6a12d09b42673a3a600ce2767d2356d91cfb2d2796f56f0bbba192","observation_id":"5c45ab0d-5055-4a69-87aa-df239f245d7e","resolution":{"observed_at":"2026-08-06T16:33:00.262352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.247373Z","title":"A black box for online approximate pattern matching","venue":null,"work_id":"7f0fcca9-1a1c-4492-ac84-662ef8c2bf7f","year":2011},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.042122Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:dda5f09f38eafeabeab7a4e81b6e15b334b00f099a285ae220008157bf963c4d","observation_id":"c41259c9-9a89-4ce9-8cbf-e3ee2b0b678a","resolution":{"observed_at":"2026-08-06T16:33:00.251071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:33:00.045315Z","title":"Introduction to algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.045315Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:b1b0a28a5f41981670ec0f98e4ba052ff9e95e2cf632bdfe94844e37a956353a","observation_id":"6b3601df-b804-4c61-8249-44480a87dfb7","resolution":{"observed_at":"2026-08-06T16:33:00.045315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:33:00.228115Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":"52165417-cb88-4deb-8ea3-f1df2d2b4557","year":1996},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.048531Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:d8d3cbf4fdd4242719c965541be6bb3f9673cc3f8a3e86304949b2bcade789f6","observation_id":"290f3b4a-a28f-466d-9bdb-5a7a46f8d437","resolution":{"observed_at":"2026-08-06T16:33:00.231681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.217078Z","title":"Ap- proximating lcs in linear time: Beating the barrier","venue":null,"work_id":"d7e60082-cf6d-4a5e-83f3-7c5087622485","year":2019},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.052023Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:946d42bcd5d3e4b3b20533c90af5781703a40e598bb84352d66d2b706cb3d8ce","observation_id":"18b6251e-1e3c-4329-b812-cb5b787f7b07","resolution":{"observed_at":"2026-08-06T16:33:00.220571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.205921Z","title":"Massively parallel approx- imation algorithms for edit distance and longest common subsequence","venue":null,"work_id":"16ca1d5c-cedf-46a3-9735-fdc9731a41e1","year":2019},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.055695Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:8898634eb1c3edab8d092e559170b0d165a2f075b2569f6114f31ba43ef178ea","observation_id":"1d37a64f-ff8c-45e5-b5ae-010ebe706967","resolution":{"observed_at":"2026-08-06T16:33:00.209630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.194601Z","title":"String match- ing with wildcards in the massively parallel computation model","venue":null,"work_id":"0620b8f7-ec37-4ee6-b746-79bdc778ea7f","year":2021},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.059252Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:366149f1bb418f4bd008b987489527e0b0ba0677d37502422be4d032d124b568","observation_id":"cab5ce78-7c33-4b4a-80c6-2aec51884726","resolution":{"observed_at":"2026-08-06T16:33:00.198395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.182049Z","title":"Quantum Algorithms For String Problems","venue":null,"work_id":"988346d7-7cfc-47a5-8777-458908c9b7ba","year":2022},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.062646Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:a929eb0a9d63ddcad093308b926e357c74482555fb4851e67f7deca40bec44cb","observation_id":"5ec3c78e-4747-4f41-9752-85bebd0cc321","resolution":{"observed_at":"2026-08-06T16:33:00.186100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.170504Z","title":"Quantum meets fine-grained complexity: Sublinear time quantum algorithms for string problems","venue":null,"work_id":"75ee4d99-f58c-4029-bb91-a26d5fd04101","year":2023},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.066130Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:f4db72ef717fceeec6d2a183a3ea3e4b2a00454188a55613f57aa5bc5d89fca5","observation_id":"b1258a32-661b-4470-8540-323744da0382","resolution":{"observed_at":"2026-08-06T16:33:00.174142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.159184Z","title":"String matching in ˜O(√n + √m) quantum time","venue":null,"work_id":"61b0851f-6096-47e9-bc50-4c98fd867cab","year":2003},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.069245Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:c48a7ea348b7775c312c1d4f0d3978b4e61764b4993f9daa0c14274e7855fe52","observation_id":"32f6e6a8-4eee-453e-a4d5-c78205f9f965","resolution":{"observed_at":"2026-08-06T16:33:00.162866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.146764Z","title":"Approximation algorithms for lcs and lis with truly improved running times","venue":null,"work_id":"61e36c03-f02d-4a9e-ac2a-af650ea9563c","year":2023},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.072454Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:7a7d33490b2b680865b2c57abd839e2053ca7e18d8a4c5bf7f89e6f47affa189","observation_id":"53700b8d-05c2-456c-973b-cdeb469cff54","resolution":{"observed_at":"2026-08-06T16:33:00.150531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-06T16:33:00.135285Z","title":"3+ ε approximation of tree edit distance in truly subquadratic time","venue":null,"work_id":"62017e37-d36e-4611-8a5b-05cdd5b01ada","year":2022},"citing_paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:33:00.075590Z"},"links":{"citing_paper":"/paper/2507.13885"},"observation_digest":"sha256:111d2966d8b8ecc6816cb1e5e257515cdfc75eaea9511cee367a6646d6337166","observation_id":"e507cdcf-b939-4933-b9ab-000c42ab96e7","resolution":{"observed_at":"2026-08-06T16:33:00.138833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.13885","last_updated":"2025-07-18T13:02:05Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T04:17:21.867527Z","submitted_at":"2025-07-18T13:02:05Z","title":"Quantum Pattern Matching with Wildcards"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":16},"total_outbound_references":19},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2507.13885."}