{"as_of":"2026-08-10T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a425c6f43fe6888f9b73105ab33f96725aa27343f1bb0cbdbee2708199f68b6","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:15:48.064866Z","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.367895Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.19758","last_updated":"2024-10-11T14:42:05Z","snapshot_observed_at":"2026-08-05T19:31:32.320289Z","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-06T18:15:48.064866Z","title":"A scored non-deterministic finite automata processor for sequence alignment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08751","last_updated":"2025-07-11T17:02:33Z","snapshot_observed_at":"2026-08-09T05:21:15.307568Z","submitted_at":"2025-07-11T17:02:33Z","title":"ML-Based Automata Simplification for Symbolic Accelerators","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:15:48.064866Z"},"links":{"cited_paper":"/paper/2410.19758","citing_paper":"/paper/2507.08751"},"observation_digest":"sha256:69ddd2ecf146c59c79de29d982454dec071e1087a2a3c327bec6c5f0daa7638c","observation_id":"63482886-11ad-4305-bb3f-8f1b34a392ae","resolution":{"observed_at":"2026-08-06T18:15:48.064866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19758","last_updated":"2024-10-11T14:42:05Z","snapshot_observed_at":"2026-08-05T19:31:32.320289Z","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:5e0752a9cc5d4490ca17b8cf947cd2f53c3b9bae622aea9172711fdc71ae22c1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.19758/citation-record","integrity":"/paper/2410.19758/integrity","json":"/paper/2410.19758/citation-record.json","paper":"/paper/2410.19758"},"outbound":[],"paper":{"arxiv_id":"2410.19758","last_updated":"2024-10-11T14:42:05Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-05T19:31:32.320289Z","submitted_at":"2024-10-11T14:42:05Z","title":"A Scored Non-Deterministic Finite Automata Processor for Sequence Alignment"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}