{"as_of":"2026-08-16T14:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa91356470e29232817225635f55fd6d110eec4fa72ced9a970a191007e54f0a","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-16T06:30:59.297886+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-15T15:53:39.221905Z","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-15T15:53:40.330324Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.05362","last_updated":"2020-09-22T16:04:58Z","snapshot_observed_at":"2026-07-06T09:19:27.938219Z","submitted_at":"2020-05-11T18:11:57Z","title":"Minimal Model for Fast Scrambling","version":3},"cited_work":{"arxiv_id":"2005.05362","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.05362","snapshot_observed_at":"2026-08-15T15:53:40.330324Z","title":"Minimal Model for Fast Scrambling","venue":"quant-ph","work_id":"78c4dc2f-c365-4920-8a56-75da222aaaba","year":2020},"citing_paper":{"arxiv_id":"2509.25345","last_updated":"2026-07-06T16:05:34Z","snapshot_observed_at":"2026-08-15T15:40:39.131219Z","submitted_at":"2025-09-29T18:02:00Z","title":"Fast quantum computation with all-to-all Hamiltonians","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:53:39.221905Z"},"links":{"cited_paper":"/paper/2005.05362","citing_paper":"/paper/2509.25345"},"observation_digest":"sha256:6a99b3ee0983737ecdb708bbfb509128f1748af01bdf812bc40fbfc6bf3e2ae9","observation_id":"1fe1dd14-9d67-4fa1-a6ee-5f134120ad2e","resolution":{"observed_at":"2026-08-15T15:53:40.335609Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.05362/citation-record","integrity":"/paper/2005.05362/integrity","json":"/paper/2005.05362/citation-record.json","paper":"/paper/2005.05362"},"outbound":[],"paper":{"arxiv_id":"2005.05362","last_updated":"2020-09-22T16:04:58Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T09:19:27.938219Z","submitted_at":"2020-05-11T18:11:57Z","title":"Minimal Model for Fast Scrambling"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.05362."}