{"as_of":"2026-08-18T19:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af7b67171beba0f5fd6c7c003eb4fbbb15c105f7c31c138bb59bafa6fede181f","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:21:07.433358Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-15T17:16:34.947085Z","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-20T06:53:06.030915Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.05523","last_updated":"2026-07-24T10:22:04Z","snapshot_observed_at":"2026-08-13T15:31:21.986019Z","submitted_at":"2025-08-07T15:53:05Z","title":"Logical accreditation: a framework for efficient certification of fault-tolerant computations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.05523","snapshot_observed_at":"2026-08-15T17:16:34.947085Z","title":"Mills, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.17513","last_updated":"2025-08-24T20:30:08Z","snapshot_observed_at":"2026-08-17T12:56:33.386408Z","submitted_at":"2025-08-24T20:30:08Z","title":"Universal Quantum Error Mitigation via Random Inverse Depolarizing Approximation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:16:34.947085Z"},"links":{"cited_paper":"/paper/2508.05523","citing_paper":"/paper/2508.17513"},"observation_digest":"sha256:ec5bd12c1bc253f3a53835b16d61cd382529d5e3888076423aa71517f8de2a71","observation_id":"89336e8c-5255-4048-a239-793e9e26dbf5","resolution":{"observed_at":"2026-08-15T17:16:34.947085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.05523","last_updated":"2026-07-24T10:22:04Z","snapshot_observed_at":"2026-08-13T15:31:21.986019Z","submitted_at":"2025-08-07T15:53:05Z","title":"Logical accreditation: a framework for efficient certification of fault-tolerant computations","version":3},"cited_work":{"arxiv_id":"2508.05523","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.05523","snapshot_observed_at":"2026-07-27T02:19:49.086933Z","title":"Mills, A","venue":null,"work_id":"cb536c50-5633-41c5-a621-e9dc3908d3f7","year":2025},"citing_paper":{"arxiv_id":"2605.19205","last_updated":"2026-05-19T00:14:30Z","snapshot_observed_at":"2026-08-15T22:06:33.766286Z","submitted_at":"2026-05-19T00:14:30Z","title":"Quantum Accreditation with Non-Clifford Two-qubit Gates","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-20T06:48:19.167592Z"},"links":{"cited_paper":"/paper/2508.05523","citing_paper":"/paper/2605.19205"},"observation_digest":"sha256:4cadafabf646abe11ef2386375ada71463a813c77f29bcc68fb3e4a29dd2c37c","observation_id":"2f884fa8-8696-4e7a-8efe-3db9a95532a5","resolution":{"observed_at":"2026-07-27T02:19:49.086933Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.05523/citation-record","integrity":"/paper/2508.05523/integrity","json":"/paper/2508.05523/citation-record.json","paper":"/paper/2508.05523"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.05526","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:21:07.648932Z","title":null,"venue":null,"work_id":"05f642d0-b6fe-4a33-9afd-513bcf85c0df","year":2025},"citing_paper":{"arxiv_id":"2508.05523","last_updated":"2026-07-24T10:22:04Z","snapshot_observed_at":"2026-08-13T15:31:21.986019Z","submitted_at":"2025-08-07T15:53:05Z","title":"Logical accreditation: a framework for efficient certification of fault-tolerant computations","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:07.433358Z"},"links":{"citing_paper":"/paper/2508.05523"},"observation_digest":"sha256:86c8e6b3c013e9b9226c0c7503097324bf5463a1690730f0c26017a47d1b3afd","observation_id":"c2d00efe-5358-48ef-bd0d-92b54b81edaf","resolution":{"observed_at":"2026-08-05T23:21:07.741999Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.05523","last_updated":"2026-07-24T10:22:04Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T15:31:21.986019Z","submitted_at":"2025-08-07T15:53:05Z","title":"Logical accreditation: a framework for efficient certification of fault-tolerant computations"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":1},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 1 of 1 outbound references and 2 inbound Pith citation observations for arXiv:2508.05523."}