{"as_of":"2026-08-21T06:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:471c2090e141968f4e3db49abbd81f73d54ed4059af74e2765575d91ea1593a8","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-15T16:20:28.592769Z","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-10T19:58:54.818723Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.12008","last_updated":"2024-07-11T13:32:59Z","snapshot_observed_at":"2026-08-16T13:42:06.053361Z","submitted_at":"2024-06-17T18:21:03Z","title":"QC-Forest: a Classical-Quantum Algorithm to Provably Speedup Retraining of Random Forest","version":3},"cited_work":{"arxiv_id":"2406.12008","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.12008","snapshot_observed_at":"2026-08-10T19:58:54.818723Z","title":"QC-Forest: a Classical-Quantum Algorithm to Provably Speedup Retraining of Random Forest","venue":"quant-ph","work_id":"0cf7e054-4037-4202-9d7a-26028e9c602e","year":2024},"citing_paper":{"arxiv_id":"2501.09528","last_updated":"2025-01-16T13:25:49Z","snapshot_observed_at":"2026-08-11T08:15:54.553462Z","submitted_at":"2025-01-16T13:25:49Z","title":"Comprehensive Survey of QML: From Data Analysis to Algorithmic Advancements","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-10T19:58:51.376318Z"},"links":{"cited_paper":"/paper/2406.12008","citing_paper":"/paper/2501.09528"},"observation_digest":"sha256:91f5e31085b144dbdc5d0f8a36844e6f1d7cda1257e099b4e07fbc79814ba5c6","observation_id":"e206d53c-7b4b-4171-8c2a-4e506ff4eb8e","resolution":{"observed_at":"2026-08-10T19:58:54.823387Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12008","last_updated":"2024-07-11T13:32:59Z","snapshot_observed_at":"2026-08-16T13:42:06.053361Z","submitted_at":"2024-06-17T18:21:03Z","title":"QC-Forest: a Classical-Quantum Algorithm to Provably Speedup Retraining of Random Forest","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12008","snapshot_observed_at":"2026-08-15T16:20:28.592769Z","title":"arXiv preprint arXiv:2406.12008 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07040","last_updated":"2025-09-08T09:34:33Z","snapshot_observed_at":"2026-08-17T03:47:29.988029Z","submitted_at":"2025-09-08T09:34:33Z","title":"A Quantum Bagging Algorithm with Unsupervised Base Learners for Label Corrupted Datasets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:20:28.592769Z"},"links":{"cited_paper":"/paper/2406.12008","citing_paper":"/paper/2509.07040"},"observation_digest":"sha256:b80aafda15f5e28cffdb579f8ca4558a0b0a1e084946715f4fb317e759d8c1c3","observation_id":"f09ca26d-ce74-406c-903b-780c016ac35f","resolution":{"observed_at":"2026-08-15T16:20:28.592769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.12008/citation-record","integrity":"/paper/2406.12008/integrity","json":"/paper/2406.12008/citation-record.json","paper":"/paper/2406.12008"},"outbound":[],"paper":{"arxiv_id":"2406.12008","last_updated":"2024-07-11T13:32:59Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T13:42:06.053361Z","submitted_at":"2024-06-17T18:21:03Z","title":"QC-Forest: a Classical-Quantum Algorithm to Provably Speedup Retraining of Random Forest"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.12008."}