{"as_of":"2026-08-15T15:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97636b8ac13b451304533c4111475a29e3da369e35c414d0b4c609c8d4d3aca7","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:23:40.822732Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.01585/citation-record","integrity":"/paper/2412.01585/integrity","json":"/paper/2412.01585/citation-record.json","paper":"/paper/2412.01585"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.10598","last_updated":"2019-03-25T21:16:39Z","snapshot_observed_at":"2026-08-14T16:56:57.841800Z","submitted_at":"2019-03-25T21:16:39Z","title":"Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making","version":1},"cited_work":{"arxiv_id":"1903.10598","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.10598","snapshot_observed_at":"2026-08-12T04:23:41.003093Z","title":"Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making","venue":"cs.LG","work_id":"47d68bb5-650c-4ecc-86ad-1a9d40748d7c","year":2019},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.803001Z"},"links":{"cited_paper":"/paper/1903.10598","citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:299e9910ff9c6db5fc4ae8c9b9fe38747226cc6d29a0a198183d5955146d6e17","observation_id":"b978372a-0583-42b0-9a90-017ff49732ec","resolution":{"observed_at":"2026-08-12T04:23:41.006283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07850","last_updated":"2023-03-03T13:49:10Z","snapshot_observed_at":"2026-08-13T14:25:12.699449Z","submitted_at":"2022-09-16T10:43:10Z","title":"FairGBM: Gradient Boosting with Fairness Constraints","version":5},"cited_work":{"arxiv_id":"2209.07850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.07850","snapshot_observed_at":"2026-08-12T04:23:40.864917Z","title":"FairGBM: Gradient Boosting with Fairness Constraints","venue":"cs.LG","work_id":"71675d8f-eede-4cb3-bb46-1b08fb6ceac0","year":2022},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.815251Z"},"links":{"cited_paper":"/paper/2209.07850","citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:9844b419442ee96b8838f7702942e4e34d2dfeb2c4a66d4ddf5c8188196b3dda","observation_id":"9754dee2-fcbc-4109-bacc-f46d141118e7","resolution":{"observed_at":"2026-08-12T04:23:40.868018Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-12T04:23:41.011352Z","title":"Joint use of over-and under-sampling techniques and cross-validation for the development and assessment of prediction models","venue":null,"work_id":"faea5bdb-863f-4d42-90b8-2571dc6bd53e","year":2015},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.809995Z"},"links":{"citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:0ef999c2b9a3889be4b45dc6865517a2a5ee1c36fa4acec07ce4ced413162779","observation_id":"a689dbf6-38b7-48bb-b93e-dd50bdff9546","resolution":{"observed_at":"2026-08-12T04:23:41.014268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.66618","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:23:40.985294Z","title":"DataFrames.jl: Flexible and Fast Tabular Data in Julia","venue":null,"work_id":"a8c4a2dc-0bef-4d8c-b802-dd16565ff763","year":2023},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.812717Z"},"links":{"citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:5f45d46a3fb7397db9a74a086ac0cdb0480c75b85c56d2b049afdfe4072174f2","observation_id":"031fa54f-b65b-4ad5-871f-94c5a38a3e8a","resolution":{"observed_at":"2026-08-12T04:23:40.990151Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05809","last_updated":"2024-10-30T16:34:12Z","snapshot_observed_at":"2026-08-14T23:02:13.275891Z","submitted_at":"2024-05-09T14:48:17Z","title":"Aequitas Flow: Streamlining Fair ML Experimentation","version":2},"cited_work":{"arxiv_id":"2405.05809","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.05809","snapshot_observed_at":"2026-08-12T04:23:40.853501Z","title":"Aequitas Flow: Streamlining Fair ML Experimentation","venue":"cs.LG","work_id":"5235f0d1-e23a-4e64-b52b-6602182b5ee3","year":2024},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.819459Z"},"links":{"cited_paper":"/paper/2405.05809","citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:4fffb983d2abc18ea6b0af09022660ea574ff40d71888be9b990d9e82e248549","observation_id":"bc877a6b-6ab9-4016-9cff-71bfe665179f","resolution":{"observed_at":"2026-08-12T04:23:40.856981Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.02409","last_updated":"2017-06-07T23:09:28Z","snapshot_observed_at":"2026-08-14T20:55:24.828569Z","submitted_at":"2017-06-07T23:09:28Z","title":"A Convex Framework for Fair Regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02409","snapshot_observed_at":"2026-08-12T04:23:40.806711Z","title":"A convex framework for fair regression","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":671,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.806711Z"},"links":{"cited_paper":"/paper/1706.02409","citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:7be59425ecc089ab3ea2d57f5d8ca1a6c471853fc1ce517341333a195eed350f","observation_id":"fe21bbe1-996a-43d3-b249-d9d6ca6b3cd0","resolution":{"observed_at":"2026-08-12T04:23:40.806711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07403","last_updated":"2021-08-21T05:31:06Z","snapshot_observed_at":"2026-08-13T18:27:48.544800Z","submitted_at":"2021-08-17T02:06:54Z","title":"FARF: A Fair and Adaptive Random Forests Classifier","version":2},"cited_work":{"arxiv_id":"2108.07403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2108.07403","snapshot_observed_at":"2026-08-12T04:23:40.841760Z","title":"FARF: A Fair and Adaptive Random Forests Classifier","venue":"cs.LG","work_id":"d1caed37-0593-4bb8-ade5-ad30be94eb5d","year":2021},"citing_paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification","version":3},"reference_index":970,"source":"pdf_text","source_observed_at":"2026-08-12T04:23:40.822732Z"},"links":{"cited_paper":"/paper/2108.07403","citing_paper":"/paper/2412.01585"},"observation_digest":"sha256:0faa9b24192a84d5c9693ca6a5c5da62c13d13240dcf742acbf20cdcf52294e5","observation_id":"f44cc0b6-f1c6-4532-95b5-12947e039dd8","resolution":{"observed_at":"2026-08-12T04:23:40.846285Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.01585","last_updated":"2024-12-09T07:57:49Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T11:12:29.280508Z","submitted_at":"2024-12-02T15:04:51Z","title":"FairML: A Julia Package for Fair Classification"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":7},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2412.01585."}