{"as_of":"2026-08-18T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29718ca7e8c7b8a90e8fb6f3879f3894a62e43f9413bc34ecfa13452c54a80a3","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:54:16.364678Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.11210","last_updated":"2022-06-22T16:57:17Z","snapshot_observed_at":"2026-08-16T16:51:07.272441Z","submitted_at":"2022-06-22T16:57:17Z","title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.11210","snapshot_observed_at":"2026-08-11T20:15:03.083088Z","title":"Constant-factor approximation algorithms for socially fair k -clustering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-18T18:06:21.282806Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.083088Z"},"links":{"cited_paper":"/paper/2206.11210","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4b7b0fb2e2397dd8becfbb2dfbd12df6fd68eed6cec2356ae3ae8fa3da4438e8","observation_id":"7d3c3f43-7476-4def-a376-7f4c2bd51ca7","resolution":{"observed_at":"2026-08-11T20:15:03.083088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.11210","last_updated":"2022-06-22T16:57:17Z","snapshot_observed_at":"2026-08-16T16:51:07.272441Z","submitted_at":"2022-06-22T16:57:17Z","title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.11210","snapshot_observed_at":"2026-08-16T11:54:16.364678Z","title":"Constant-factor approximation al- gorithms for socially fair k-clustering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.14683","last_updated":"2025-08-01T04:12:22Z","snapshot_observed_at":"2026-08-17T23:40:20.982621Z","submitted_at":"2025-04-20T17:19:03Z","title":"Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:54:16.364678Z"},"links":{"cited_paper":"/paper/2206.11210","citing_paper":"/paper/2504.14683"},"observation_digest":"sha256:e9a8ee49583433a500f93f9d80cba3cc51fa9b29a0f3658e258f2eedc580a303","observation_id":"e69d1fb8-3c93-4eb0-b35e-417def3488f9","resolution":{"observed_at":"2026-08-16T11:54:16.364678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.11210","last_updated":"2022-06-22T16:57:17Z","snapshot_observed_at":"2026-08-16T16:51:07.272441Z","submitted_at":"2022-06-22T16:57:17Z","title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","version":1},"cited_work":{"arxiv_id":"2206.11210","doi":"10.48550/arxiv.2206.11210","metadata_source":"arxiv_reference","pith_arxiv_id":"2206.11210","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"month = jun, year =","venue":"arXiv (Cornell University)","work_id":"f78fab0b-fc32-468e-b6d4-25b2d070da2b","year":null},"citing_paper":{"arxiv_id":"2605.06656","last_updated":"2026-05-07T17:57:58Z","snapshot_observed_at":"2026-08-12T17:20:46.232380Z","submitted_at":"2026-05-07T17:57:58Z","title":"Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML","version":1},"reference_index":228,"source":"arxiv_source","source_observed_at":"2026-05-08T12:05:32.881629Z"},"links":{"cited_paper":"/paper/2206.11210","citing_paper":"/paper/2605.06656"},"observation_digest":"sha256:9452cbe99050aa106b20ef5a1a8c0412341d6fe816d533b83ddcf45fe87bed53","observation_id":"38dd9898-32bf-4571-8bd9-2b55de1d72df","resolution":{"observed_at":"2026-05-08T21:44:15.432595Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.11210/citation-record","integrity":"/paper/2206.11210/integrity","json":"/paper/2206.11210/citation-record.json","paper":"/paper/2206.11210"},"outbound":[],"paper":{"arxiv_id":"2206.11210","last_updated":"2022-06-22T16:57:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T16:51:07.272441Z","submitted_at":"2022-06-22T16:57:17Z","title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2206.11210."}