{"as_of":"2026-08-16T17:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e2a08cbb750db341ba14eddb20bd5eb05161aba15223fa85d275e06c4e72a44","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-15T20:27:08.334383Z","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-15T20:27:09.603380Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.18985","last_updated":"2025-02-26T09:44:29Z","snapshot_observed_at":"2026-08-16T13:29:07.778527Z","submitted_at":"2025-02-26T09:44:29Z","title":"Design and efficiency in graph-state computation","version":1},"cited_work":{"arxiv_id":"2502.18985","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.18985","snapshot_observed_at":"2026-08-15T20:27:09.603380Z","title":"Design and efficiency in graph-state computation","venue":"quant-ph","work_id":"2ca9caa4-fb07-4164-8839-338c445f98e3","year":2025},"citing_paper":{"arxiv_id":"2608.12936","last_updated":"2026-08-13T08:15:29Z","snapshot_observed_at":"2026-08-16T17:11:06.301092Z","submitted_at":"2026-08-13T08:15:29Z","title":"AutoQuREO: A Framework for Automated Quantum Resource Estimation and Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:27:08.334383Z"},"links":{"cited_paper":"/paper/2502.18985","citing_paper":"/paper/2608.12936"},"observation_digest":"sha256:eb2769892c8223798269825a76e88f41c930e6a00cc6c1a2c3ed717c5bdbd8ed","observation_id":"abf7cc4d-b333-4449-8f69-0c0148253e65","resolution":{"observed_at":"2026-08-15T20:27:09.606873Z","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/2502.18985/citation-record","integrity":"/paper/2502.18985/integrity","json":"/paper/2502.18985/citation-record.json","paper":"/paper/2502.18985"},"outbound":[],"paper":{"arxiv_id":"2502.18985","last_updated":"2025-02-26T09:44:29Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T13:29:07.778527Z","submitted_at":"2025-02-26T09:44:29Z","title":"Design and efficiency in graph-state computation"},"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:2502.18985."}