{"as_of":"2026-08-09T01:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aab2d0052920b913a9f213da72ea8470df621f7b70a00d3318e4af807248e123","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-01T16:10:32.975323Z","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":[{"citation":{"cited_paper":{"arxiv_id":"1901.02393","last_updated":"2019-06-17T14:01:05Z","snapshot_observed_at":"2026-07-31T17:48:52.152273Z","submitted_at":"2019-01-08T16:39:16Z","title":"Fair Algorithms for Clustering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.02393","snapshot_observed_at":"2026-08-01T16:10:32.975323Z","title":"Flores, and Maryam Negahbani","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18119","last_updated":"2026-07-20T16:14:13Z","snapshot_observed_at":"2026-08-06T16:22:23.527481Z","submitted_at":"2026-07-20T16:14:13Z","title":"COVAriance-Induced Fairness Gap Penalty for Subgroup-Fair Clustering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T16:10:32.975323Z"},"links":{"cited_paper":"/paper/1901.02393","citing_paper":"/paper/2607.18119"},"observation_digest":"sha256:459a3a147dfc606dfdb44ea59322890f4edbe31760d814f53d16c3d1b15a21b7","observation_id":"06ff4b92-b273-403b-b8ff-7007ef26ba8f","resolution":{"observed_at":"2026-08-01T16:10:32.975323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1901.02393/citation-record","integrity":"/paper/1901.02393/integrity","json":"/paper/1901.02393/citation-record.json","paper":"/paper/1901.02393"},"outbound":[],"paper":{"arxiv_id":"1901.02393","last_updated":"2019-06-17T14:01:05Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-31T17:48:52.152273Z","submitted_at":"2019-01-08T16:39:16Z","title":"Fair Algorithms for Clustering"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1901.02393."}