{"as_of":"2026-08-06T16:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7bc89da33cb4537fcf97192f09aeae875946e5e22270b3bf5613a81682c964e","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T11:55:39.757540Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-02T13:34:55.465050Z","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-05-22T08:01:15.951708Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"cited_work":{"arxiv_id":"2604.15214","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.15214","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","venue":"quant-ph","work_id":"fc805985-2a68-43b6-b3c3-5993a5dc7358","year":2026},"citing_paper":{"arxiv_id":"2605.22275","last_updated":"2026-07-28T11:52:37Z","snapshot_observed_at":"2026-08-02T19:32:00.254465Z","submitted_at":"2026-05-21T10:19:23Z","title":"Adaptive Measurement Allocation for Learning Kernelized SVMs Under Noisy Observations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T07:57:01.429497Z"},"links":{"cited_paper":"/paper/2604.15214","citing_paper":"/paper/2605.22275"},"observation_digest":"sha256:c8f87c9647b4ad55849cf6986639310806ef9b03ecd6b0cfe839c0234bf82c64","observation_id":"6ab2847d-a454-4f10-aad2-853655d5c704","resolution":{"observed_at":"2026-05-22T08:01:15.954152Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.15214","snapshot_observed_at":"2026-08-02T13:34:55.465050Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.22275","last_updated":"2026-07-28T11:52:37Z","snapshot_observed_at":"2026-08-02T19:32:00.254465Z","submitted_at":"2026-05-21T10:19:23Z","title":"Adaptive Measurement Allocation for Learning Kernelized SVMs Under Noisy Observations","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T13:34:55.465050Z"},"links":{"cited_paper":"/paper/2604.15214","citing_paper":"/paper/2605.22275"},"observation_digest":"sha256:c862d7e87a6ef93c4df0932442e9ff149071eb43394502bb315ad9a90304a7ab","observation_id":"0d36261e-321c-4a32-97ac-1a28698fdc31","resolution":{"observed_at":"2026-08-02T13:34:55.465050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.15214/citation-record","integrity":"/paper/2604.15214/integrity","json":"/paper/2604.15214/citation-record.json","paper":"/paper/2604.15214"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Each measurement of the auxiliary register yields outcome|0⟩with probabilityp=a 2, so estimatinga reduces to estimating the Bernoulli parameterpand taking a square root","venue":null,"work_id":"fc09e260-0cd2-4b35-a1c8-47196d102d22","year":null},"citing_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T11:55:39.757540Z"},"links":{"citing_paper":"/paper/2604.15214"},"observation_digest":"sha256:f62e2e0fb01257a5dbb9c200046ee0629f49c257af803118d165a1bb641f27fe","observation_id":"5f926077-471b-48ab-b2aa-e9b3e9423cfb","resolution":{"observed_at":"2026-05-19T12:33:05.547493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23860","last_updated":"2025-06-30T12:33:19Z","snapshot_observed_at":"2026-08-06T09:01:11.002435Z","submitted_at":"2025-05-29T08:15:23Z","title":"Quantum computing and artificial intelligence: status and perspectives","version":3},"cited_work":{"arxiv_id":"2505.23860","doi":"10.48550/arxiv.2505.23860","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.23860","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Acampora, A","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"ae1a9ad2-1686-48ef-abae-5951932dc351","year":2025},"citing_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T11:55:39.757540Z"},"links":{"cited_paper":"/paper/2505.23860","citing_paper":"/paper/2604.15214"},"observation_digest":"sha256:02d49d062e6a7baebc9e429d20ffeae671e3ac5c24a62794519522c9c708ba71","observation_id":"833c1efd-a022-4b15-8225-8f275c7b28c4","resolution":{"observed_at":"2026-05-10T12:00:22.287596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"We next specialize the template into the four possible choices","venue":null,"work_id":"5da9f262-1eaa-4daf-afc2-b8dd3d6b0465","year":null},"citing_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T11:55:39.757540Z"},"links":{"citing_paper":"/paper/2604.15214"},"observation_digest":"sha256:6abf0c5f6314c0796dbde10a8d48a4b73fe153ecd36dc950c95dee30b642a12e","observation_id":"8d92c701-6ae1-4fb1-80c4-e65bf6b1d1e5","resolution":{"observed_at":"2026-05-19T12:33:05.544886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"M}:M∈ O(ε −2/rN∥α∥ 2/r 2 )","venue":null,"work_id":"4543dbce-00ec-4407-900d-caed541ea6ec","year":null},"citing_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T11:55:39.757540Z"},"links":{"citing_paper":"/paper/2604.15214"},"observation_digest":"sha256:6a4c16bc655a7086e4694f58a116b972350b8c7bb3252b5223ca33d7329db907","observation_id":"3912ffa2-1751-4872-89a0-e6d1373eba89","resolution":{"observed_at":"2026-05-19T12:33:05.537328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7a0d4857-0a09-4163-8932-57a614ecee28","year":null},"citing_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T11:55:39.757540Z"},"links":{"citing_paper":"/paper/2604.15214"},"observation_digest":"sha256:b452445189bab8e8a0834d7d953a69f36a4cc8f4f9fdbf52c63c88a752c1c12b","observation_id":"074c0e64-2e33-4de5-aabd-04049602fc7a","resolution":{"observed_at":"2026-05-19T12:33:05.539500Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unlike for the case of list-and-sum, there is no single template from which all results follow, but rather we present each scenario individually","venue":null,"work_id":"f334e3fd-4322-4e65-b18a-b3f2acbdc619","year":null},"citing_paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T11:55:39.757540Z"},"links":{"citing_paper":"/paper/2604.15214"},"observation_digest":"sha256:69b69ea5fe1f1d36a2ac212203645ab0b8bd07be4f2a90fd23287395ada1581e","observation_id":"7792631c-a6de-428c-9ca7-85df412ab9e0","resolution":{"observed_at":"2026-05-19T12:33:05.541994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.15214","last_updated":"2026-04-17T07:29:39Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T16:07:48.349398Z","submitted_at":"2026-04-16T16:45:02Z","title":"Optimal algorithmic complexity of inference in quantum kernel methods"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":6},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 2 inbound Pith citation observations for arXiv:2604.15214."}