Pith. sign in

Paper Citation Record · LEDGER

A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.19758.

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

pith.paper-citation-record.v1
2410.19758 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T18:15:48.064866Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-12T07:46:51.367895Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 63482886-11ad-4305-bb3f-8f1b34a392ae · inbound

ML-Based Automata Simplification for Symbolic Accelerators cites this paper.

ML-Based Automata Simplification for Symbolic Accelerators A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-06T18:15:48.064866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T18:15:48.064866Z digest=sha256:69ddd2ecf146c59c79de29d982454dec071e1087a2a3c327bec6c5f0daa7638c

Observation ab25cb24-b62d-4cf9-9776-bbca61ec23d5 · inbound

Machine Learning-Based Graph Simplification for Symbolic Accelerators cites this paper.

Machine Learning-Based Graph Simplification for Symbolic Accelerators A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment

Reference 6

Resolution
verified exact
arxiv_id, observed 2026-05-12T07:46:51.426828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-05-12T01:51:55.541351Z digest=sha256:5e0752a9cc5d4490ca17b8cf947cd2f53c3b9bae622aea9172711fdc71ae22c1