{"as_of":"2026-08-15T03:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0941984cc702b7cd881217e9a7de480791d02950fd3001ccedfeb8227bff857c","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:35:10.431684Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T06:16:19.390415Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.02262","last_updated":"2022-12-12T13:26:56Z","snapshot_observed_at":"2026-08-13T18:51:06.706071Z","submitted_at":"2021-07-05T20:41:18Z","title":"Cost-efficient QFA Algorithm for Quantum Computers","version":2},"cited_work":{"arxiv_id":"2107.02262","doi":"10.48550/arxiv.2107.02262","metadata_source":"pith","pith_arxiv_id":"2107.02262","snapshot_observed_at":"2026-08-11T06:16:19.390415Z","title":"Cost-efficient QFA Algorithm for Quantum Computers","venue":"quant-ph","work_id":"58682293-6452-4712-b7eb-2375821fb653","year":2021},"citing_paper":{"arxiv_id":"2412.18823","last_updated":"2024-12-25T08:26:06Z","snapshot_observed_at":"2026-08-14T14:32:17.979231Z","submitted_at":"2024-12-25T08:26:06Z","title":"Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T04:35:10.431684Z"},"links":{"cited_paper":"/paper/2107.02262","citing_paper":"/paper/2412.18823"},"observation_digest":"sha256:0e8e40e7e5d267696bb832a032ec5c767f9d28aa7ea695c5973a9608068d63fb","observation_id":"49553594-bb25-427c-8656-08970108a8eb","resolution":{"observed_at":"2026-08-11T04:35:10.532725Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.02262/citation-record","integrity":"/paper/2107.02262/integrity","json":"/paper/2107.02262/citation-record.json","paper":"/paper/2107.02262"},"outbound":[],"paper":{"arxiv_id":"2107.02262","last_updated":"2022-12-12T13:26:56Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T18:51:06.706071Z","submitted_at":"2021-07-05T20:41:18Z","title":"Cost-efficient QFA Algorithm for Quantum Computers"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2107.02262."}