Paper Citation Record · LEDGER

Algorithms and Indexing Lower Bounds for Variable String Matching

As of 22 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.08566.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.08566 v1

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-10T05:14:14.390070Z

measured 24 of 24 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

24 of 24 outbound references displayed

verified exact10
verified fuzzy4
unresolved0
parse uncertain0
malformed identifier6
metadata mismatch4

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 23c1186d-b902-45fa-9253-0938e7940c5d · outbound

This paper cites Degenerate String Comparison and Applications.

Algorithms and Indexing Lower Bounds for Variable String Matching Degenerate String Comparison and Applications

Reference 1

Resolution: malformed identifier; doi_truncated, observed 2026-07-10T05:16:47.522774Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2e63834d-1e53-4774-924d-498547c7fd88 · outbound

This paper cites Faster Online Elastic Degenerate String Matching.

Algorithms and Indexing Lower Bounds for Variable String Matching Faster Online Elastic Degenerate String Matching

Reference 2

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.530325Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b10c4a37-89e7-48a8-9417-6fa315e32954 · outbound

This paper cites A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs.

Algorithms and Indexing Lower Bounds for Variable String Matching A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs

Reference 3

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.506559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation dcc1ef39-d2e1-4928-83f9-8e15189ecb5f · outbound

This paper cites Which Regular Expression Patterns Are Hard to Match?.

Algorithms and Indexing Lower Bounds for Variable String Matching Which Regular Expression Patterns Are Hard to Match?

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T05:16:48.305920Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 69b89db7-b840-4e03-b013-3897417564bd · outbound

This paper cites Even Faster Elastic-Degenerate String Matching via Fast Ma- trix Multiplication.

Algorithms and Indexing Lower Bounds for Variable String Matching Even Faster Elastic-Degenerate String Matching via Fast Ma- trix Multiplication

Reference 5

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.525461Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2fd2ee12-47da-4cf9-ba78-91dc5da04117 · outbound

This paper cites A Dichotomy for Regular Expression Membership Testing.

Algorithms and Indexing Lower Bounds for Variable String Matching A Dichotomy for Regular Expression Membership Testing

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-07-10T05:16:47.500532Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1faa1f43-7421-47f3-8aa6-439a7601dc04 · outbound

This paper cites 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =.

Algorithms and Indexing Lower Bounds for Variable String Matching 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Reference 7

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T05:16:47.513874Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5d4e7f1e-e9fb-45dc-916d-a6b37fa400e7 · outbound

This paper cites In: Babai, L.

Algorithms and Indexing Lower Bounds for Variable String Matching In: Babai, L

Reference 8

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T05:16:47.954306Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8e2c9fe0-10a9-479d-861e-4e3b12a818d4 · outbound

This paper cites Cambridge University Press, 2007.isbn: 978-0-521-84899-2.

Algorithms and Indexing Lower Bounds for Variable String Matching Cambridge University Press, 2007.isbn: 978-0-521-84899-2

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T05:16:48.304188Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e0c35c73-c59f-4fe6-9a10-9f2ec83a07c8 · outbound

This paper cites Quantum Pattern Matching in Generalised Degenerate Strings.

Algorithms and Indexing Lower Bounds for Variable String Matching Quantum Pattern Matching in Generalised Degenerate Strings

Reference 10

Resolution: verified exact; local_arxiv, observed 2026-07-10T05:16:47.520112Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 747da82d-32c1-4df3-8a14-9f04c0b153c9 · outbound

This paper cites Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.

Algorithms and Indexing Lower Bounds for Variable String Matching Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

Reference 11

Resolution: verified exact; local_arxiv, observed 2026-07-10T05:16:47.551805Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 085235e0-5d7e-49ff-9e05-03a308c58a81 · outbound

This paper cites Graphs Cannot Be Indexed in Polynomial Time for Sub-Quadratic Time String Matching, Unless SETH Fails.

Algorithms and Indexing Lower Bounds for Variable String Matching Graphs Cannot Be Indexed in Polynomial Time for Sub-Quadratic Time String Matching, Unless SETH Fails

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T05:16:48.302226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5f8bce12-cbb3-4fb1-94f2-c5eb479c1331 · outbound

This paper cites Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications.

Algorithms and Indexing Lower Bounds for Variable String Matching Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications

Reference 13

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.527784Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0ebf5c75-de14-4306-a7ec-531fc278b8a5 · outbound

This paper cites Towards Unified Approximate Pattern Matching for Hamming andL1 Distance.

Algorithms and Indexing Lower Bounds for Variable String Matching Towards Unified Approximate Pattern Matching for Hamming andL1 Distance

Reference 14

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.503080Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a9a2fd78-95ac-46f8-8bc6-0f8065616c86 · outbound

This paper cites In: Fodor, P., Montali, M., Calvanese, D., Roman, D.

Algorithms and Indexing Lower Bounds for Variable String Matching In: Fodor, P., Montali, M., Calvanese, D., Roman, D

Reference 15

Resolution: malformed identifier; doi_truncated, observed 2026-07-10T05:16:47.554248Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a5a4ddb6-0a96-463e-aea8-b8a0c88a4453 · outbound

This paper cites On-Line Pattern Matching on Similar Texts.

Algorithms and Indexing Lower Bounds for Variable String Matching On-Line Pattern Matching on Similar Texts

Reference 16

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.509420Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e9e1cc80-2c1a-4c69-b53f-532f888c6179 · outbound

This paper cites Proceedings of the 47th annual ACM Symposium on Theory of Computing (STOC) , pages =.

Algorithms and Indexing Lower Bounds for Variable String Matching Proceedings of the 47th annual ACM Symposium on Theory of Computing (STOC) , pages =

Reference 17

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T05:16:47.540036Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b52377ab-f31b-40e4-a64a-983a871b3701 · outbound

This paper cites Iliopoulos, Ritu Kundu, and Solon P.

Algorithms and Indexing Lower Bounds for Variable String Matching Iliopoulos, Ritu Kundu, and Solon P

Reference 18

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T05:16:47.536596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation da019b7b-dd5c-428f-88f3-fdf8def667ef · outbound

This paper cites Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.

Algorithms and Indexing Lower Bounds for Variable String Matching Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties

Reference 19

Resolution: malformed identifier; doi_truncated, observed 2026-07-10T05:16:47.545284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 489c8f57-452e-4a5d-b8c4-134c01577597 · outbound

This paper cites Fast Pattern Matching in Strings.

Algorithms and Indexing Lower Bounds for Variable String Matching Fast Pattern Matching in Strings

Reference 20

Resolution: malformed identifier; doi_truncated, observed 2026-07-10T05:16:47.548012Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1872408a-7162-4a91-81e2-f6cadee60bb2 · outbound

This paper cites An Efficient String Matching Algorithm with k Differences for Nucleotide and Amino Acid Sequences.

Algorithms and Indexing Lower Bounds for Variable String Matching An Efficient String Matching Algorithm with k Differences for Nucleotide and Amino Acid Sequences

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T05:16:48.298410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2ed9383d-4494-4ea9-9f00-d3944d95cd82 · outbound

This paper cites Nonlinear programming in complex space: Sufficient conditions and duality.

Algorithms and Indexing Lower Bounds for Variable String Matching Nonlinear programming in complex space: Sufficient conditions and duality

Reference 22

Resolution: malformed identifier; doi_truncated, observed 2026-07-10T05:16:47.542658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d5e13e8b-4590-4d67-9620-049ed728dc6e · outbound

This paper cites Set Intersection and Sequence Matching with Mismatch Counting.

Algorithms and Indexing Lower Bounds for Variable String Matching Set Intersection and Sequence Matching with Mismatch Counting

Reference 23

Resolution: malformed identifier; raw_fallback, observed 2026-07-10T05:16:48.300216Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 36dfe489-15fd-4288-83df-8079de5abc85 · outbound

This paper cites A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications.

Algorithms and Indexing Lower Bounds for Variable String Matching A New Algorithm for Optimal 2-Constraint Satisfaction and Its Im- plications

Reference 24

Resolution: verified exact; doi, observed 2026-07-10T05:16:47.532949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.