{"as_of":"2026-08-08T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:358a477317f0916d7d680f2d8589b6e6d82e6301979c089cfd125c03984d6b97","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-08T06:32:00.761636+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-07T05:24:48.130121Z","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-07T05:24:48.168452Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.10761","last_updated":"2022-01-26T06:05:04Z","snapshot_observed_at":"2026-07-06T12:31:20.231019Z","submitted_at":"2022-01-26T06:05:04Z","title":"An Efficient and Robust System for Vertically Federated Random Forest","version":1},"cited_work":{"arxiv_id":"2201.10761","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.10761","snapshot_observed_at":"2026-08-07T05:24:48.168452Z","title":"An Efficient and Robust System for Vertically Federated Random Forest","venue":"cs.LG","work_id":"c5155099-013f-4edf-8996-a6754e7f555c","year":2022},"citing_paper":{"arxiv_id":"2506.08176","last_updated":"2025-06-09T19:39:22Z","snapshot_observed_at":"2026-08-08T19:53:22.977266Z","submitted_at":"2025-06-09T19:39:22Z","title":"FedGA-Tree: Federated Decision Tree using Genetic Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:48.130121Z"},"links":{"cited_paper":"/paper/2201.10761","citing_paper":"/paper/2506.08176"},"observation_digest":"sha256:db92f643285cc42d1e925c1e342a87672ac1a4047c2aa8b98342ec10c73aa8b4","observation_id":"feb1a7b5-fd82-4cde-8c61-043611cb515c","resolution":{"observed_at":"2026-08-07T05:24:48.174470Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.10761/citation-record","integrity":"/paper/2201.10761/integrity","json":"/paper/2201.10761/citation-record.json","paper":"/paper/2201.10761"},"outbound":[],"paper":{"arxiv_id":"2201.10761","last_updated":"2022-01-26T06:05:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:31:20.231019Z","submitted_at":"2022-01-26T06:05:04Z","title":"An Efficient and Robust System for Vertically Federated 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2201.10761."}