{"as_of":"2026-08-15T14:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d4ee6f56ef81d6758148f48ce220f1d97ba9a06686dd34eeffbef81a92679a6","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-05-12T01:51:55.541351Z","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/2605.08996/citation-record","integrity":"/paper/2605.08996/integrity","json":"/paper/2605.08996/citation-record.json","paper":"/paper/2605.08996"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automata processor applications in bioinformatics: A survey","venue":null,"work_id":"f74795ce-5e6d-4782-9686-c54156aa2fec","year":2018},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:1d5cbd28fa9b5cc1383c615ec6a9e1cf82eca80fcc2e55f9043faed3c8322ae2","observation_id":"1756b794-b5b8-4a46-be32-6c66b3af6afd","resolution":{"observed_at":"2026-05-13T16:27:58.017588Z","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-06-05T21:23:00.469572Z","title":"An overlay architecture for pattern matching","venue":null,"work_id":"7cffd42b-daee-4b11-8506-b359039f1ba5","year":2019},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:99465f836a74757c69fd019ad34aed9c36e7ae30977c66ff94b91fdb2aa061ad","observation_id":"4ad10a07-466b-40e5-b23b-7174c80083b7","resolution":{"observed_at":"2026-05-13T16:27:58.020222Z","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-06-05T21:23:00.469572Z","title":"High-level synthesis of a genomic database search engine","venue":null,"work_id":"b5ae58c0-ed6e-4333-ae75-818a1b09e052","year":2016},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:c24c8a321570603d0fcc6e11fe0763bd3a4dfa8b353dbcfc0efd30a23cce9e00","observation_id":"f195c5db-8a3c-4504-a24f-84310fb79e11","resolution":{"observed_at":"2026-05-13T16:27:58.035410Z","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-06-05T21:23:00.469572Z","title":"A dynamically recon- figurable automata processor overlay","venue":null,"work_id":"2ce288ee-a2e7-4a21-a2c9-b4d109073394","year":2017},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:508f2653d81757acd30185c1cfc451ae71f4a1c13ea0a1f13bd9fc3443b138c6","observation_id":"9120541a-50b2-4d68-8edc-55dbb6e69e25","resolution":{"observed_at":"2026-05-13T16:27:58.038776Z","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-06-05T21:23:00.469572Z","title":"Developing a self-explanatory transformer","venue":null,"work_id":"b75ecd56-3010-4428-b76c-764f2d54af66","year":2024},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:96a480811f48294cfe9a355b93968624a554c4e3d08880dc42eda0773211ed59","observation_id":"a8bf2f16-7e40-4b89-9bb0-89bf147c76cf","resolution":{"observed_at":"2026-05-13T16:27:58.042532Z","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":"2410.19758","last_updated":"2024-10-11T14:42:05Z","snapshot_observed_at":"2026-08-12T22:25:23.344093Z","submitted_at":"2024-10-11T14:42:05Z","title":"A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment","version":1},"cited_work":{"arxiv_id":"2410.19758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19758","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A scored non-deterministic fi- nite automata processor for sequence alignment","venue":null,"work_id":"534d20e3-a354-4e19-8a86-79d8509e72f0","year":2024},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"cited_paper":"/paper/2410.19758","citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:18744806a5f34fe46430c9d1e40fedd6238a612611fac5ed1bda95f6b9491511","observation_id":"ab25cb24-b62d-4cf9-9776-bbca61ec23d5","resolution":{"observed_at":"2026-05-12T07:46:51.426828Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2501.02162","last_updated":"2025-01-04T02:19:48Z","snapshot_observed_at":"2026-08-12T23:35:21.779630Z","submitted_at":"2025-01-04T02:19:48Z","title":"Optimizing Sequence Alignment with Scored NFAs","version":1},"cited_work":{"arxiv_id":"2501.02162","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02162","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimizing sequence alignment with scored nfas","venue":null,"work_id":"62d27a83-3775-44c2-83b0-1f4d123685e8","year":2025},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"cited_paper":"/paper/2501.02162","citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:bb569cff9c5facc42b50528242f860451084c3d5c1dd0a2cfd2bd85399058e8d","observation_id":"a7d431a8-4008-4bba-95d9-211c32f2b864","resolution":{"observed_at":"2026-05-12T07:46:51.249200Z","resolver_source":"arxiv_id","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-06-05T21:23:00.469572Z","title":"Napoly: A non-deterministic automata processor overlay","venue":null,"work_id":"67567cf5-8372-4f43-9b7a-aeac5e1d42d9","year":2023},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:aafbe180f69b6480a5fc008e51641e8a2e291764e6e8ff94977bf09b3aa23a9e","observation_id":"411722e6-7f04-4bd7-ab83-a95c22587700","resolution":{"observed_at":"2026-05-13T16:27:58.029613Z","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-06-05T21:23:00.469572Z","title":"Demystifying automata processing: Gpus, fpgas or micron’s ap?","venue":null,"work_id":"4c3c0385-b71b-411d-8ef1-0786e56de3bd","year":2017},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:bb4d44e2fee7f51530969e41f3f7568fd211cf709ed5aa7cff45ff4d0761bb0f","observation_id":"98630308-d9f4-430b-942f-84fc90456df8","resolution":{"observed_at":"2026-05-13T16:27:58.014898Z","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-06-05T21:23:00.469572Z","title":"Automata-to-routing: An open- source toolchain for design-space exploration of spatial automata pro- cessing architectures","venue":null,"work_id":"c81e5dff-d8db-47bf-ab67-0b0d64fef1de","year":2017},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:9e82b14d1f5a109300012575ce98cb1cf0e1b72716ffb5c796bfd6179577513b","observation_id":"5e110364-fed9-4720-a615-d56b7a1cf7c3","resolution":{"observed_at":"2026-05-13T16:27:58.040830Z","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-07-07T13:53:48.105816Z","title":"Random forests","venue":null,"work_id":"33569c23-2385-43a4-b54d-349d36adee3d","year":2001},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:3887afe6d3f635800a30047e0e98ad885dd12bafe1e796c9871ef3353ece1cd4","observation_id":"85e2c11e-5f49-479d-89a4-78139050e368","resolution":{"observed_at":"2026-05-13T16:27:58.024222Z","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-06-05T21:23:00.469572Z","title":"Grapefruit: An open-source, full-stack, and customizable automata processing on fp- gas","venue":null,"work_id":"5f846df5-916b-4609-9272-fb96ea74c615","year":2020},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:24f65d49c7d6676a3bb4ee1a87bd433b579be80f6dc65c47f97483eae13227d1","observation_id":"e0f2409e-baba-47fe-9dc8-523f159fa4ac","resolution":{"observed_at":"2026-05-13T16:27:58.026129Z","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-06-05T21:23:00.469572Z","title":"Hap: A spatial-von neumann heterogeneous automata processor with optimized resource and io overhead on fpga","venue":null,"work_id":"d31e448b-1b2f-410a-9114-fe6a2e168543","year":2023},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:b2389c5533809298069dbffe42edc87ec5a2a123bbcbede4ead9abca779abf2d","observation_id":"26176515-f6c0-450e-b2c0-d7e90b284c87","resolution":{"observed_at":"2026-05-13T16:27:58.012326Z","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-06-05T21:23:00.469572Z","title":"A cellular automata system with fpga","venue":null,"work_id":"79f44a17-4058-4fc4-a774-2833cf2b1115","year":2001},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:6207d509cd9fdfdd386d5a5ce55ac0531c77e138a0f8ff28564a91c7e86109a1","observation_id":"55a26efb-a375-4c5a-bf51-11bff3bbb7d7","resolution":{"observed_at":"2026-05-13T16:27:58.027911Z","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-06-05T21:23:00.469572Z","title":"Parallel automata processor","venue":null,"work_id":"44b43b15-ee82-4a47-ad4f-0f2ad850392d","year":2017},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:d3f8c68b28e09e834310e6ca85928207498010c8a5843c1ad60795df802e1cf1","observation_id":"ea8d3480-f69d-4718-ad96-20581455538e","resolution":{"observed_at":"2026-05-13T16:27:58.022219Z","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-06-05T21:23:00.469572Z","title":"Fra-fpga: Fast reconfigurable automata processing on fpgas","venue":null,"work_id":"595f11bd-4221-4e37-940e-da4fddcf0e09","year":2022},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:ab54400a9dac517275b58c03fec7f825c4940f2e80a666e35322849c43302e3d","observation_id":"1aba2e56-9f97-4a4b-be5a-05e8e8c4a3f4","resolution":{"observed_at":"2026-05-13T16:27:58.037092Z","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-06-05T21:23:00.469572Z","title":"Anmlzoo: a benchmark suite for exploring bottlenecks in automata processing engines and architectures","venue":null,"work_id":"244e2e80-0e25-418d-a169-adcff1ec2463","year":2016},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:e7151c420cfd6d3da92b62c46efc1a00585e602da7c973f5831a03fa97630d52","observation_id":"aec9a223-3a72-4c13-9f74-65497af6887a","resolution":{"observed_at":"2026-05-13T16:27:58.044222Z","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-06-05T21:23:00.469572Z","title":"Two-hit filter synthesis for genomic database search","venue":null,"work_id":"0a4a59b0-2f9a-4a42-81b2-270c25123f22","year":2016},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:3fa5a99ad084e7b3ec18c03663133ae368125bc2487dbbf775437f24313f903d","observation_id":"9978c673-c744-4c3f-9348-869be04fb521","resolution":{"observed_at":"2026-05-13T16:27:58.031539Z","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-06-05T21:23:00.469572Z","title":"Deep forest: Towards an alternative to deep neural networks","venue":null,"work_id":"6246ebd4-33e2-4021-ade3-916dafec539d","year":2017},"citing_paper":{"arxiv_id":"2605.08996","last_updated":"2026-05-09T15:26:06Z","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-12T01:51:55.541351Z"},"links":{"citing_paper":"/paper/2605.08996"},"observation_digest":"sha256:addc5232a93aaad7ff0877b2bc4e189e91a6331437ed1e52c7b1c19d6615a0e3","observation_id":"97d6b7cc-2e99-465f-a00d-4d2744c486b4","resolution":{"observed_at":"2026-05-13T16:27:58.033251Z","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":"2605.08996","last_updated":"2026-05-09T15:26:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:21:11.475005Z","submitted_at":"2026-05-09T15:26:06Z","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":17},"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:2605.08996."}