{"as_of":"2026-08-20T08:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a631b2fd48a423d3c70ac1ca98a76efe75a74669627dece81a197e0732a4d5cd","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-20T06:33:59.587034+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-14T11:34:14.058876Z","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-14T11:34:14.666439Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.08148","last_updated":"2019-08-21T05:28:34Z","snapshot_observed_at":"2026-08-20T07:19:36.359862Z","submitted_at":"2019-01-23T22:06:35Z","title":"A Quantum Algorithm to Efficiently Sample from Interfering Binary Trees","version":2},"cited_work":{"arxiv_id":"1901.08148","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.08148","snapshot_observed_at":"2026-08-14T11:34:14.666439Z","title":"A Quantum Algorithm to Efficiently Sample from Interfering Binary Trees","venue":"quant-ph","work_id":"11fe8e4a-f6fc-47cc-b907-9a4b0c1602b1","year":2019},"citing_paper":{"arxiv_id":"1908.08949","last_updated":"2020-05-05T23:06:05Z","snapshot_observed_at":"2026-08-20T04:51:37.969864Z","submitted_at":"2019-08-23T18:00:00Z","title":"Quantum Algorithms for Jet Clustering","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:14.058876Z"},"links":{"cited_paper":"/paper/1901.08148","citing_paper":"/paper/1908.08949"},"observation_digest":"sha256:a667a09027e1fd38c875c9abd710732bc592530e994b8604cb1c208972a2058a","observation_id":"c3456317-9745-4b2a-9331-d31c029bf4b6","resolution":{"observed_at":"2026-08-14T11:34:14.670922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1901.08148/citation-record","integrity":"/paper/1901.08148/integrity","json":"/paper/1901.08148/citation-record.json","paper":"/paper/1901.08148"},"outbound":[],"paper":{"arxiv_id":"1901.08148","last_updated":"2019-08-21T05:28:34Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-20T07:19:36.359862Z","submitted_at":"2019-01-23T22:06:35Z","title":"A Quantum Algorithm to Efficiently Sample from Interfering Binary Trees"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1901.08148."}