{"as_of":"2026-08-20T07:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3c6e3c827d58749df7cf40858cf948f329591c095a41fb70cf7d243930abb852","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-16T11:00:08.806517Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T05:03:55.575382Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.09932","last_updated":"2023-07-25T14:41:05Z","snapshot_observed_at":"2026-08-19T00:54:20.059568Z","submitted_at":"2022-01-24T19:47:10Z","title":"Learning Optimal Fair Classification Trees: Trade-offs Between Interpretability, Fairness, and Accuracy","version":5},"cited_work":{"arxiv_id":"2201.09932","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.09932","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c926a8d1-4720-459d-8b7c-d51312af6190","year":2022},"citing_paper":{"arxiv_id":"2312.08413","last_updated":"2023-12-13T14:54:48Z","snapshot_observed_at":"2026-08-15T15:55:12.044286Z","submitted_at":"2023-12-13T14:54:48Z","title":"Privacy Constrained Fairness Estimation for Decision Trees","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T05:00:06.381840Z"},"links":{"cited_paper":"/paper/2201.09932","citing_paper":"/paper/2312.08413"},"observation_digest":"sha256:78afaec507586b75878bd885d6ee2934dc932904eff7d340adfc9b1031e0e2fd","observation_id":"1ba42c18-444c-40ac-8d36-78cd826d366b","resolution":{"observed_at":"2026-05-24T05:03:55.577800Z","resolver_source":"arxiv_id","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":"2201.09932","last_updated":"2023-07-25T14:41:05Z","snapshot_observed_at":"2026-08-19T00:54:20.059568Z","submitted_at":"2022-01-24T19:47:10Z","title":"Learning Optimal Fair Classification Trees: Trade-offs Between Interpretability, Fairness, and Accuracy","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.09932","snapshot_observed_at":"2026-08-16T11:00:08.806517Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16969","last_updated":"2025-04-23T13:41:17Z","snapshot_observed_at":"2026-08-19T00:52:58.869927Z","submitted_at":"2025-04-23T13:41:17Z","title":"Engineering the Law-Machine Learning Translation Problem: Developing Legally Aligned Models","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:08.806517Z"},"links":{"cited_paper":"/paper/2201.09932","citing_paper":"/paper/2504.16969"},"observation_digest":"sha256:893a5da1d49b1732056fa629c507b690fb0065fed890d350c6a86da8018ca5b4","observation_id":"1eba08a0-ca41-4e8d-9276-f643b5dbf7c8","resolution":{"observed_at":"2026-08-16T11:00:08.806517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.09932/citation-record","integrity":"/paper/2201.09932/integrity","json":"/paper/2201.09932/citation-record.json","paper":"/paper/2201.09932"},"outbound":[],"paper":{"arxiv_id":"2201.09932","last_updated":"2023-07-25T14:41:05Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T00:54:20.059568Z","submitted_at":"2022-01-24T19:47:10Z","title":"Learning Optimal Fair Classification Trees: Trade-offs Between Interpretability, Fairness, and Accuracy"},"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 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.09932."}