Paper Citation Record · LEDGER

Machine Learning-Based Graph Simplification for Symbolic Accelerators

As of 15 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2605.08996.

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

pith.paper-citation-record.v1
2605.08996 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-12T01:51:55.541351Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+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

19 of 19 outbound references displayed

verified exact2
verified fuzzy17
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1756b794-b5b8-4a46-be32-6c66b3af6afd · outbound

This paper cites Automata processor applications in bioinformatics: A survey.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Automata processor applications in bioinformatics: A survey

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.017588Z

Source-reported events for the cited work

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

Observation 4ad10a07-466b-40e5-b23b-7174c80083b7 · outbound

This paper cites An overlay architecture for pattern matching.

Machine Learning-Based Graph Simplification for Symbolic Accelerators An overlay architecture for pattern matching

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.020222Z

Source-reported events for the cited work

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

Observation f195c5db-8a3c-4504-a24f-84310fb79e11 · outbound

This paper cites High-level synthesis of a genomic database search engine.

Machine Learning-Based Graph Simplification for Symbolic Accelerators High-level synthesis of a genomic database search engine

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.035410Z

Source-reported events for the cited work

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

Observation 9120541a-50b2-4d68-8edc-55dbb6e69e25 · outbound

This paper cites A dynamically recon- figurable automata processor overlay.

Machine Learning-Based Graph Simplification for Symbolic Accelerators A dynamically recon- figurable automata processor overlay

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.038776Z

Source-reported events for the cited work

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

Observation a8bf2f16-7e40-4b89-9bb0-89bf147c76cf · outbound

This paper cites Developing a self-explanatory transformer.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Developing a self-explanatory transformer

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.042532Z

Source-reported events for the cited work

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

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

This paper cites A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment.

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-15T06:32:42.880941+00:00.

Observation a7d431a8-4008-4bba-95d9-211c32f2b864 · outbound

This paper cites Optimizing Sequence Alignment with Scored NFAs.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Optimizing Sequence Alignment with Scored NFAs

Reference 7

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

Source-reported events for the cited work

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

Observation 411722e6-7f04-4bd7-ab83-a95c22587700 · outbound

This paper cites Napoly: A non-deterministic automata processor overlay.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Napoly: A non-deterministic automata processor overlay

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.029613Z

Source-reported events for the cited work

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

Observation 98630308-d9f4-430b-942f-84fc90456df8 · outbound

This paper cites Demystifying automata processing: Gpus, fpgas or micron’s ap?.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Demystifying automata processing: Gpus, fpgas or micron’s ap?

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.014898Z

Source-reported events for the cited work

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

Observation 5e110364-fed9-4720-a615-d56b7a1cf7c3 · outbound

This paper cites Automata-to-routing: An open- source toolchain for design-space exploration of spatial automata pro- cessing architectures.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Automata-to-routing: An open- source toolchain for design-space exploration of spatial automata pro- cessing architectures

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.040830Z

Source-reported events for the cited work

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

Observation 85e2c11e-5f49-479d-89a4-78139050e368 · outbound

This paper cites Random forests.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Random forests

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.024222Z

Source-reported events for the cited work

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

Observation e0f2409e-baba-47fe-9dc8-523f159fa4ac · outbound

This paper cites Grapefruit: An open-source, full-stack, and customizable automata processing on fp- gas.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Grapefruit: An open-source, full-stack, and customizable automata processing on fp- gas

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.026129Z

Source-reported events for the cited work

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

Observation 26176515-f6c0-450e-b2c0-d7e90b284c87 · outbound

This paper cites Hap: A spatial-von neumann heterogeneous automata processor with optimized resource and io overhead on fpga.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Hap: A spatial-von neumann heterogeneous automata processor with optimized resource and io overhead on fpga

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.012326Z

Source-reported events for the cited work

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

Observation 55a26efb-a375-4c5a-bf51-11bff3bbb7d7 · outbound

This paper cites A cellular automata system with fpga.

Machine Learning-Based Graph Simplification for Symbolic Accelerators A cellular automata system with fpga

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.027911Z

Source-reported events for the cited work

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

Observation ea8d3480-f69d-4718-ad96-20581455538e · outbound

This paper cites Parallel automata processor.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Parallel automata processor

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.022219Z

Source-reported events for the cited work

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

Observation 1aba2e56-9f97-4a4b-be5a-05e8e8c4a3f4 · outbound

This paper cites Fra-fpga: Fast reconfigurable automata processing on fpgas.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Fra-fpga: Fast reconfigurable automata processing on fpgas

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.037092Z

Source-reported events for the cited work

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

Observation aec9a223-3a72-4c13-9f74-65497af6887a · outbound

This paper cites Anmlzoo: a benchmark suite for exploring bottlenecks in automata processing engines and architectures.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Anmlzoo: a benchmark suite for exploring bottlenecks in automata processing engines and architectures

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.044222Z

Source-reported events for the cited work

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

Observation 9978c673-c744-4c3f-9348-869be04fb521 · outbound

This paper cites Two-hit filter synthesis for genomic database search.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Two-hit filter synthesis for genomic database search

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.031539Z

Source-reported events for the cited work

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

Observation 97d6b7cc-2e99-465f-a00d-4d2744c486b4 · outbound

This paper cites Deep forest: Towards an alternative to deep neural networks.

Machine Learning-Based Graph Simplification for Symbolic Accelerators Deep forest: Towards an alternative to deep neural networks

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-05-13T16:27:58.033251Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.