{"as_of":"2026-08-15T03:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:636f9c1817c66f87bd756acaa7f1df7f023ba1bddff3a9f5a4b9a565132c62d9","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-14T06:32:32.682623+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-09T14:50:58.672354Z","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-09T14:50:59.274490Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.05567","last_updated":"2021-06-11T22:04:44Z","snapshot_observed_at":"2026-08-11T12:43:02.916370Z","submitted_at":"2020-09-11T17:53:20Z","title":"Machine Unlearning for Random Forests","version":2},"cited_work":{"arxiv_id":"2009.05567","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.05567","snapshot_observed_at":"2026-08-09T14:50:59.274490Z","title":"Machine Unlearning for Random Forests","venue":"cs.LG","work_id":"fd67a118-3d5f-4066-b974-bb7029139105","year":2020},"citing_paper":{"arxiv_id":"2502.01634","last_updated":"2025-02-03T18:59:04Z","snapshot_observed_at":"2026-08-13T16:51:45.788684Z","submitted_at":"2025-02-03T18:59:04Z","title":"Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Data","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-09T14:50:58.672354Z"},"links":{"cited_paper":"/paper/2009.05567","citing_paper":"/paper/2502.01634"},"observation_digest":"sha256:c764518da745f95182dcd7d6dff841b1caa1be7233667360726e54e9520c3f4b","observation_id":"49f1d81f-94eb-4b03-85da-b742bd2dd242","resolution":{"observed_at":"2026-08-09T14:50:59.279299Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.05567/citation-record","integrity":"/paper/2009.05567/integrity","json":"/paper/2009.05567/citation-record.json","paper":"/paper/2009.05567"},"outbound":[],"paper":{"arxiv_id":"2009.05567","last_updated":"2021-06-11T22:04:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T12:43:02.916370Z","submitted_at":"2020-09-11T17:53:20Z","title":"Machine Unlearning for Random Forests"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2009.05567."}