{"as_of":"2026-08-22T12:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4e7929d157b7f08ed10cfda70e6815801f20bdc8e5d3c85895ea6183057882c","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:17:14.130163Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:49:36.386868Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T07:46:51.128351Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02162","snapshot_observed_at":"2026-08-15T19:49:36.386868Z","title":"Optimizing sequence align- ment with scored nfas","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.15070","last_updated":"2025-06-18T02:25:04Z","snapshot_observed_at":"2026-08-15T19:42:14.133830Z","submitted_at":"2025-06-18T02:25:04Z","title":"Toward a Lightweight, Scalable, and Parallel Secure Encryption Engine","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:49:36.386868Z"},"links":{"cited_paper":"/paper/2501.02162","citing_paper":"/paper/2506.15070"},"observation_digest":"sha256:261624bd036e1b0ff35350d0ed6a1686a08b012bd43c37be9fe1a9595ec23f57","observation_id":"e93e628a-6ef7-4d3f-b987-620844a8783e","resolution":{"observed_at":"2026-08-15T19:49:36.386868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02162","snapshot_observed_at":"2026-08-06T18:15:48.149334Z","title":"Optimizing sequence align- ment with scored nfas, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.08751","last_updated":"2025-07-11T17:02:33Z","snapshot_observed_at":"2026-08-17T01:47:38.055981Z","submitted_at":"2025-07-11T17:02:33Z","title":"ML-Based Automata Simplification for Symbolic Accelerators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:15:48.149334Z"},"links":{"cited_paper":"/paper/2501.02162","citing_paper":"/paper/2507.08751"},"observation_digest":"sha256:c95e6a0b2d345462362171cd70005cdb564b6e97413a8a9d027e9f9f5d07bc15","observation_id":"c225335d-90a6-4cf0-93c3-f6a419cacbbb","resolution":{"observed_at":"2026-08-06T18:15:48.149334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:1d71572827e0376de8690ee7bc1957288186084316cf9d720e38ad4ec89b2a82","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-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.02162/citation-record","integrity":"/paper/2501.02162/integrity","json":"/paper/2501.02162/citation-record.json","paper":"/paper/2501.02162"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:17:14.767212Z","title":"Bradshaw, Rasha Karakchi, and Jason D","venue":null,"work_id":"5d821410-95de-45d8-addb-892b0c4fd93f","year":2016},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:13.989654Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:a0cb5de051b210f68f079237f32c97705fd50ebe746ed78cbc05d60423f13a74","observation_id":"99d0fe2d-ad66-476b-94fa-754559860da5","resolution":{"observed_at":"2026-08-10T22:17:14.773969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.746223Z","title":"Bradshaw, and Jason D","venue":null,"work_id":"d8b6368f-8d8c-46f9-be76-782dae036e89","year":2016},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:13.998174Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:1622ab9178544afba3c422392774b5087c710536d50d1320213ce0250af942f5","observation_id":"5ee958a0-e530-4fb6-9c94-c84944202fb3","resolution":{"observed_at":"2026-08-10T22:17:14.752648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.004949Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.004949Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:f63d38ed34f04402180d8391c4f70e20194c8caf4d616d53da7895d0160879d9","observation_id":"9cbc4527-16c2-437c-b22f-d2d8a21efb31","resolution":{"observed_at":"2026-08-10T22:17:14.004949Z","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-10T22:17:14.704786Z","title":"Robotomata: A framework for approximate pattern matching of big data on an automata processor","venue":null,"work_id":"e91ffb81-5b2a-4de9-ba40-9adeb13c6339","year":2017},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.013740Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:017c8551b298e830e3f1f6b98a8defdc21e88198bb77e08f5bad32bdc47c4fb3","observation_id":"7cc75285-6d53-40fc-a64f-31c60a158eae","resolution":{"observed_at":"2026-08-10T22:17:14.711165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.681059Z","title":"Richards, and Jason D","venue":null,"work_id":"375438e3-3e0d-41c4-904c-41ecb01fcc1e","year":2017},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.021335Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:05cb843181a863e71092a11362f3d1adf17bc280bdfa19fcc324c0d14a54dc64","observation_id":"e74f1efc-9943-400d-9374-04cfe55a9acc","resolution":{"observed_at":"2026-08-10T22:17:14.687763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.651396Z","title":"An overlay architecture for pattern matching","venue":null,"work_id":"2a584abb-38f4-4a72-a13f-fb1136b33d6d","year":2019},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.028436Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:f528263088bcb017f23066dee5fad8d15ef698ae324ea6975bdad984cd796b18","observation_id":"405914e1-4671-4b31-9da8-3ea80cd90c43","resolution":{"observed_at":"2026-08-10T22:17:14.663348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.627046Z","title":"Finding motifs in biological sequences using the micron automata processor","venue":null,"work_id":"ba85d353-a3cd-4b40-b203-850750f89b67","year":2014},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.034867Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:80cfc7f8c7c2ab88e704ba2438411f8cf3764d5620eb8083fc22b9018d6a52ee","observation_id":"829f97c4-14d9-49e1-b53b-71e0437d8509","resolution":{"observed_at":"2026-08-10T22:17:14.634309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.604647Z","title":null,"venue":null,"work_id":"fbcd83a4-0c84-4462-ba07-26f469572d06","year":2017},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.044485Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:55b4f2c9d6ee50c8a2d3f1d0e5610a39f72369f504a6cbcedff011cccf5f4899","observation_id":"c5487b4a-a03a-4899-bb4d-3e4fa0e68045","resolution":{"observed_at":"2026-08-10T22:17:14.610399Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.575974Z","title":"Weighted automaton, 2024","venue":null,"work_id":"e47eda7f-e865-401c-9d6d-decaa64b9fc0","year":2024},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.052389Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:2473b4bb382d27ff41e92da398c8412d8e7cd15a3a880ad1ad6edffb4e1f3f47","observation_id":"79c14644-2554-448c-943e-b76c67d5336a","resolution":{"observed_at":"2026-08-10T22:17:14.591856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.547864Z","title":"Weighted automata algorithms","venue":null,"work_id":"81b8444f-6383-4bd5-80bc-459e88ad2211","year":2009},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.059938Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:59d8d1dfd9cac040040865690de4be55c355bfc04246c434ad2edb16d896ad74","observation_id":"a190b40d-271f-49db-95c7-9d60ae6cbd7e","resolution":{"observed_at":"2026-08-10T22:17:14.554763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.522669Z","title":"Handbook of Weighted Automata","venue":null,"work_id":"9194599f-ab4f-44b3-bd34-3b0dded231b7","year":2020},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.065212Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:653afa125a417829b017dcfda88568546ac61684197feb4067d5d1a069fc7200","observation_id":"f354a35d-77ca-4c88-86eb-9122a1d56a30","resolution":{"observed_at":"2026-08-10T22:17:14.528793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-19T20:59:52.644670Z","submitted_at":"2024-10-11T14:42:05Z","title":"A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19758","snapshot_observed_at":"2026-08-10T22:17:14.071809Z","title":"A scored non-deterministic finite automata processor for sequence alignment, 2024","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.071809Z"},"links":{"cited_paper":"/paper/2410.19758","citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:0d359f61bc5147c91b709a72c09365a87aab9e88f3feb961e302d08f6c3bda1f","observation_id":"06d1aed4-1f75-45c8-a630-f10d3561eccb","resolution":{"observed_at":"2026-08-10T22:17:14.071809Z","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-10T22:17:14.500607Z","title":"Weighted automata algorithms","venue":null,"work_id":"a00351a5-65c9-4f13-a54c-95f066ff4729","year":2012},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.082931Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:82223e431fd22b785de002a9c413bdd3620425457e00781fb392945ab77b75a4","observation_id":"792b909f-d670-4e9f-937b-86711086e142","resolution":{"observed_at":"2026-08-10T22:17:14.507685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.470959Z","title":"Bakos and Rasha Karakchi","venue":null,"work_id":"0f35eabb-34df-4521-8c29-522d7d625d7f","year":2023},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.092905Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:4dad079b0de993b2567c4fab8ace15e9336790793fe81c75b2ce5b07d7f5f9aa","observation_id":"98694aba-3665-48b8-8489-a93a6b68b863","resolution":{"observed_at":"2026-08-10T22:17:14.479437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.441591Z","title":"An efficient and scalable semiconductor architecture for parallel automata processing","venue":null,"work_id":"bf710d2a-f380-4244-98a1-f4946face037","year":2014},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.098859Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:321aac551505d15b0945afb6bd8cc739ec3c7a397ea61ce4a294f453b263c21a","observation_id":"3b0185ac-2f51-4484-985c-bb7543f1c50d","resolution":{"observed_at":"2026-08-10T22:17:14.451799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.421304Z","title":"Approximating proba- bilistic models as weighted finite automata","venue":null,"work_id":"e9495cd1-2b50-40d7-ac2a-c5dd6cd94719","year":2021},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.105854Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:8b78459d55a456799667a6a42798057a9fa3fae4a3bf1a0b8a3e927759b093c8","observation_id":"86adf251-a56e-482f-ad63-22917f7ec116","resolution":{"observed_at":"2026-08-10T22:17:14.427276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.400228Z","title":"Quasi-distances and weighted finite automata","venue":null,"work_id":"7e27de00-264f-4670-b1a9-4e590105547d","year":2015},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.111961Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:7e4f55dec5751c3c222d770596909366cd84265a4bcd467f9b0d886bbfc434b3","observation_id":"da498924-034d-499e-b96a-eb98fc75347a","resolution":{"observed_at":"2026-08-10T22:17:14.408734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.373875Z","title":"Zcu104 evaluation board user guide, 2019","venue":null,"work_id":"aaf47639-9809-4ce3-805d-f64f5c7f3f29","year":2019},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.117801Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:43254e3cb4f31960bab9c90c39d8178ed72a76bbeef3a5675988ba1b7f6ab9ab","observation_id":"fa439222-5602-48cc-b047-7d0ee92a7d6c","resolution":{"observed_at":"2026-08-10T22:17:14.382191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.350975Z","title":"Zcu102 evaluation board user guide, 2019","venue":null,"work_id":"7d8097ca-6b08-48f7-8b71-7d9c2bf55605","year":2019},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.124315Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:88d2e3cd77a84f3fe9d06c11ac07b013544935bc861ffe18ad93a3ae9dd5a9ce","observation_id":"ab381c51-4a9f-4aed-9ed8-db95036aafe4","resolution":{"observed_at":"2026-08-10T22:17:14.357864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-10T22:17:14.328155Z","title":"A scratchpad spiking neural network accelerator","venue":null,"work_id":"dfff7784-8dc2-470d-b047-a044cec1326b","year":2024},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:17:14.130163Z"},"links":{"citing_paper":"/paper/2501.02162"},"observation_digest":"sha256:8c77ad84d354216f9572cc0bcc54453f4c0d9184ed3f168accbdf60504adfa58","observation_id":"40362383-84b1-4e96-b3cf-bcf8d7d18789","resolution":{"observed_at":"2026-08-10T22:17:14.336001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.02162","last_updated":"2025-01-04T02:19:48Z","latest_version":1,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-12T23:35:21.779630Z","submitted_at":"2025-01-04T02:19:48Z","title":"Optimizing Sequence Alignment with Scored NFAs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":20},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 3 inbound Pith citation observations for arXiv:2501.02162."}