{"as_of":"2026-08-10T10:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99db8824a887ef6112356015183cf97c7f1bc35ceb00bf0716a8794ab3cf3662","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T12:14:05.470183Z","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-25T06:06:42.715421Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.07343","last_updated":"2023-03-13T17:59:43Z","snapshot_observed_at":"2026-08-10T09:11:18.759526Z","submitted_at":"2023-03-13T17:59:43Z","title":"Building Krylov complexity from circuit complexity","version":1},"cited_work":{"arxiv_id":"2303.07343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.07343","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c63bd5e3-92a9-43f2-9da6-bcd1b4a444e7","year":2023},"citing_paper":{"arxiv_id":"2405.09628","last_updated":"2025-05-15T07:39:48Z","snapshot_observed_at":"2026-08-09T06:57:42.865531Z","submitted_at":"2024-05-15T18:00:09Z","title":"Quantum Dynamics in Krylov Space: Methods and Applications","version":3},"reference_index":193,"source":"pdf_text","source_observed_at":"2026-05-25T06:06:05.060811Z"},"links":{"cited_paper":"/paper/2303.07343","citing_paper":"/paper/2405.09628"},"observation_digest":"sha256:dc5a55f9e9dd7d3ab6a71844d9cc5ffa5c78ee2b78032c42b29a4d32d339415f","observation_id":"4d04382d-ce08-4303-a3e9-ad0c5162603c","resolution":{"observed_at":"2026-05-25T06:06:42.717972Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07343","last_updated":"2023-03-13T17:59:43Z","snapshot_observed_at":"2026-08-10T09:11:18.759526Z","submitted_at":"2023-03-13T17:59:43Z","title":"Building Krylov complexity from circuit complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.07343","snapshot_observed_at":"2026-08-06T12:14:05.470183Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22118","last_updated":"2025-07-29T18:00:02Z","snapshot_observed_at":"2026-08-08T13:48:15.455778Z","submitted_at":"2025-07-29T18:00:02Z","title":"CFT Complexity and Penalty Factors","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T12:14:05.470183Z"},"links":{"cited_paper":"/paper/2303.07343","citing_paper":"/paper/2507.22118"},"observation_digest":"sha256:87504ed8328dcfa1be9f5527cd4ff81a96496f2291f1b408ad94852fef7f50fc","observation_id":"9320c4dd-b0bd-4826-964c-8607047dc476","resolution":{"observed_at":"2026-08-06T12:14:05.470183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07343","last_updated":"2023-03-13T17:59:43Z","snapshot_observed_at":"2026-08-10T09:11:18.759526Z","submitted_at":"2023-03-13T17:59:43Z","title":"Building Krylov complexity from circuit complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.07343","snapshot_observed_at":"2026-08-03T04:36:23.150680Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.04949","last_updated":"2026-07-14T06:12:37Z","snapshot_observed_at":"2026-08-08T11:20:02.917864Z","submitted_at":"2026-02-04T19:00:00Z","title":"Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity","version":5},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-03T04:36:23.150680Z"},"links":{"cited_paper":"/paper/2303.07343","citing_paper":"/paper/2602.04949"},"observation_digest":"sha256:ae43d1851c1645f905a5d70d68b48558000e7d6f02e5227f1a5ff6585e8f299e","observation_id":"709a8c8c-db7c-4730-8012-8ff1757f413b","resolution":{"observed_at":"2026-08-03T04:36:23.150680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07343","last_updated":"2023-03-13T17:59:43Z","snapshot_observed_at":"2026-08-10T09:11:18.759526Z","submitted_at":"2023-03-13T17:59:43Z","title":"Building Krylov complexity from circuit complexity","version":1},"cited_work":{"arxiv_id":"2303.07343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.07343","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c63bd5e3-92a9-43f2-9da6-bcd1b4a444e7","year":2023},"citing_paper":{"arxiv_id":"2605.07668","last_updated":"2026-05-08T12:39:43Z","snapshot_observed_at":"2026-07-06T23:20:01.856093Z","submitted_at":"2026-05-08T12:39:43Z","title":"Bridging Krylov Complexity and Universal Analog Quantum Simulator","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-11T02:35:22.825362Z"},"links":{"cited_paper":"/paper/2303.07343","citing_paper":"/paper/2605.07668"},"observation_digest":"sha256:302aa66170f99a8c9673b9917c3261a945f450af8f2b44d1e8eb195c36451437","observation_id":"578a4ba7-1624-4b2d-ac7f-d6f50838b5e7","resolution":{"observed_at":"2026-05-11T03:15:55.415572Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.07343/citation-record","integrity":"/paper/2303.07343/integrity","json":"/paper/2303.07343/citation-record.json","paper":"/paper/2303.07343"},"outbound":[],"paper":{"arxiv_id":"2303.07343","last_updated":"2023-03-13T17:59:43Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T09:11:18.759526Z","submitted_at":"2023-03-13T17:59:43Z","title":"Building Krylov complexity from circuit complexity"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2303.07343."}