{"as_of":"2026-08-16T15:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cba7e1e381c2edb623254bd18057ee12b699efbfdd5f17b54771d757424209a7","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-16T06:30:59.297886+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-14T10:39:57.620019Z","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-12T04:23:41.003093Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.10598","snapshot_observed_at":"2026-08-14T10:39:57.620019Z","title":"arXiv preprint arXiv:1903.10598 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.11451","last_updated":"2019-08-28T15:08:34Z","snapshot_observed_at":"2026-08-16T02:40:39.827151Z","submitted_at":"2019-08-28T15:08:34Z","title":"Fairness-Aware Process Mining","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:39:57.620019Z"},"links":{"cited_paper":"/paper/1903.10598","citing_paper":"/paper/1908.11451"},"observation_digest":"sha256:ec8de2be8e9368bdd64da6ea4a963cac90f0148ba548807b6818374b39248dd7","observation_id":"227260a2-c386-4f73-b27e-7cb1441b9b2d","resolution":{"observed_at":"2026-08-14T10:39:57.620019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:5dec36c85167436808ef2868423b4ffe7df784d0aab3e47d45b54c42329d0411","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1903.10598/citation-record","integrity":"/paper/1903.10598/integrity","json":"/paper/1903.10598/citation-record.json","paper":"/paper/1903.10598"},"outbound":[],"paper":{"arxiv_id":"1903.10598","last_updated":"2019-03-25T21:16:39Z","latest_version":1,"primary_category":"cs.LG","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"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1903.10598."}