{"as_of":"2026-08-19T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99360a2bc5df9d75bfa92926850f0f87c0cbd9e08b196f9644c5f97264a170dc","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-19T06:32:44.657259+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-16T11:44:10.169668Z","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-16T11:44:10.384117Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.04373","last_updated":"2024-10-06T06:25:36Z","snapshot_observed_at":"2026-08-18T23:51:04.788030Z","submitted_at":"2024-10-06T06:25:36Z","title":"Computational Complexity of Learning Efficiently Generatable Pure States","version":1},"cited_work":{"arxiv_id":"2410.04373","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.04373","snapshot_observed_at":"2026-08-16T11:44:10.384117Z","title":"Computational Complexity of Learning Efficiently Generatable Pure States","venue":"quant-ph","work_id":"1ae21a33-6a86-4b86-a988-44baeacab3fa","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.169668Z"},"links":{"cited_paper":"/paper/2410.04373","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:00406583c843c3b9325ec75bc454004fb9bf3a56f23c6a8fdbf5123cfc27b415","observation_id":"bcb73a07-0e3a-4d4b-b12f-6f90b4f5c915","resolution":{"observed_at":"2026-08-16T11:44:10.387795Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.04373/citation-record","integrity":"/paper/2410.04373/integrity","json":"/paper/2410.04373/citation-record.json","paper":"/paper/2410.04373"},"outbound":[],"paper":{"arxiv_id":"2410.04373","last_updated":"2024-10-06T06:25:36Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T23:51:04.788030Z","submitted_at":"2024-10-06T06:25:36Z","title":"Computational Complexity of Learning Efficiently Generatable Pure States"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2410.04373."}