{"as_of":"2026-08-18T14:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35d650d8a14a5cfc2b991fc5c10374edc132ca53c1b9d71cbc0af4b9ad348897","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:15:03.204282Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.06063/citation-record","integrity":"/paper/2412.06063/integrity","json":"/paper/2412.06063/citation-record.json","paper":"/paper/2412.06063"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:02.984350Z","title":"Abernethy, Pranjal Awasthi, Matth \\\" a us Kleindessner, Jamie Morgenstern, Chris Russell, and Jie Zhang","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-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:02.984350Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:5a8fa4299e444d8b45bd2d769cf83d0974b3f72291f23f854bb66d9f027739fb","observation_id":"45ad124c-8694-485d-8f0f-cec4160ad295","resolution":{"observed_at":"2026-08-11T20:15:02.984350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:02.987191Z","title":"Fair clustering via equitable group representations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:02.987191Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:e4f839b8f0b7a88652b0af77b56113c865867203de90389ebc4135a38cb84103","observation_id":"5bc3d4d5-2350-469d-b83c-f03fef9887d9","resolution":{"observed_at":"2026-08-11T20:15:02.987191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:02.989410Z","title":"Fair regression: Quantitative definitions and reduction-based algorithms","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:02.989410Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:a19e965ff7b2d0ccedc07119b4676111a4c90217daff6ce7c670033a00374f14","observation_id":"f20f9a14-d622-49cd-b68e-103b5510d3d4","resolution":{"observed_at":"2026-08-11T20:15:02.989410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:02.991942Z","title":"Fair hierarchical clustering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:02.991942Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:1b552b3f459f8e5bfa602e98691bfdced657738dcbdb018b0628758ec75b40cd","observation_id":"93db3e12-ee7c-44e1-8cd7-a03246e36801","resolution":{"observed_at":"2026-08-11T20:15:02.991942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:02.994637Z","title":"Fair and fast k-center clustering for data summarization","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-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:02.994637Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:efb905d0eb6c397baccacc07932dbdb13497a21d678a68f3ccd84e70f681ff1e","observation_id":"d1864536-daf9-4c22-a154-41eec939a9f2","resolution":{"observed_at":"2026-08-11T20:15:02.994637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:02.997441Z","title":"Fair algorithms for clustering","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:02.997441Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:9aef2880e0bfc2f401664b6c1baf8c1e4ab6ab0d44a64485d9132f913e0267c5","observation_id":"8ad1ab9d-8244-44b8-ad08-10b25ef46e0d","resolution":{"observed_at":"2026-08-11T20:15:02.997441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.765231Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":"355742b7-7b1f-4e42-988b-bdb7d69d3172","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.000301Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:c16de7bcc0363493ae3c5d0541df7fcd9f35e3da8b0f93f5c7f73fb2a9eb8b82","observation_id":"9281b00c-2985-4064-87a6-3d4ad4957c8a","resolution":{"observed_at":"2026-08-11T20:15:03.768304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.757725Z","title":"Gender shades: Intersectional accuracy disparities in commercial gender classification","venue":null,"work_id":"a218881c-70a0-4bd5-ad45-86bd537d1d73","year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.002760Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:7b385af9c2f8578270516e212526b372dcbc9b6076d7474f5f1b7568da685267","observation_id":"95fbe2a4-e34e-4038-920e-95d0d2149ee0","resolution":{"observed_at":"2026-08-11T20:15:03.760322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.751084Z","title":"Inapproximability of some geometric and quadratic optimization problems","venue":null,"work_id":"38892811-dd04-4954-ad56-f47fc6034197","year":2000},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.005371Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:973478f8d0126f2e2ac8ee85255e4a8a0a25627724548f4ea7f434f9e9a25435","observation_id":"4eb99994-bd02-43dd-8bdb-ad64b3211aed","resolution":{"observed_at":"2026-08-11T20:15:03.753737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10319","last_updated":"2018-11-26T12:25:35Z","snapshot_observed_at":"2026-08-14T17:53:22.954743Z","submitted_at":"2018-11-26T12:25:35Z","title":"On the cost of essentially fair clusterings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10319","snapshot_observed_at":"2026-08-11T20:15:03.007812Z","title":"On the cost of essentially fair clusterings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.007812Z"},"links":{"cited_paper":"/paper/1811.10319","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:349e0c3aa71d5990dd56ac347bc6b9092518fa0735385ed0e28689406500140a","observation_id":"33fc95e2-79af-4461-ac24-c3b5cf10f71e","resolution":{"observed_at":"2026-08-11T20:15:03.007812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T20:15:03.010515Z","title":"A convex framework for fair regression","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.010515Z"},"links":{"cited_paper":"/paper/1706.02409","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4a3a4ee8f6d3a521864d721bc74aa0232c07ff385dc358ee06bd9c888e39f0fe","observation_id":"43104cf4-84ca-4b34-a90f-5cde9b738698","resolution":{"observed_at":"2026-08-11T20:15:03.010515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.744278Z","title":"Fairness in criminal justice risk assessments: The state of the art","venue":null,"work_id":"917dfb61-e8ec-46c7-a1f8-be2c961f1cae","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.013376Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:fbeefdd394e7493cec547ab0606f7657763f07a81e992dff6707ec3bffddb3aa","observation_id":"5576293f-fa05-47c7-9d4e-ba2bc6f1561a","resolution":{"observed_at":"2026-08-11T20:15:03.747036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.737843Z","title":"Scalable fair clustering","venue":null,"work_id":"d72c31f6-b95e-4c18-8839-ccfa3766dad1","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.015832Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4fd57a3bf94b3fa81eff25c1edc147734f6e8a08b196c01ded858976b7f1ad88","observation_id":"8ac28412-394a-4d03-884e-291b27b2cc92","resolution":{"observed_at":"2026-08-11T20:15:03.740222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.730324Z","title":"On the combinatorial and algebraic complexity of quantifier elimination","venue":null,"work_id":"2d545e40-13da-44b9-9671-49ba14ac953e","year":1996},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.018990Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:7ec0562ef1b69b56b1ac073c797f1bde44775b03f27c0d85005e64b6a1b314c0","observation_id":"a47ef517-ae72-48b8-b3af-1f2ce7566c69","resolution":{"observed_at":"2026-08-11T20:15:03.733510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.722685Z","title":"Big data's disparate impact","venue":null,"work_id":"0b30132e-d3e1-4c0b-96d2-f827d8b9e972","year":2016},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.021471Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:b6b61856f8eb20f7c0c6484fd17e15a95374b04f267fcfb4edaa2414674c91f4","observation_id":"cc763932-4c7f-4cdb-8732-833ab1bbd8cf","resolution":{"observed_at":"2026-08-11T20:15:03.725163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.714849Z","title":"Woodruff, and Qiuyi (Richard) Zhang","venue":null,"work_id":"da9ed455-a6bc-4214-ab76-f035d597bade","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.023910Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:31f94f3d07b9f8f855604857164e69b50ca9322257085838d21e4e1f14814e14","observation_id":"784002d4-7a8b-4640-a51d-640ad99abaa8","resolution":{"observed_at":"2026-08-11T20:15:03.717496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.709154Z","title":"Woodruff","venue":null,"work_id":"b8ee3e66-077d-43ae-8b48-59a8304d868f","year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.026968Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:e396186b74c598ab335e2678e0a42a3f0520d5d94a62aa38bc86e4e2ace3d77d","observation_id":"c2957f30-cd0b-486f-b20f-e26614af44f5","resolution":{"observed_at":"2026-08-11T20:15:03.711192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.702956Z","title":"Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu","venue":null,"work_id":"673368a9-3665-4571-9196-908c4a045427","year":2015},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.029544Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:fa2425637d34e8e346cd05836f0121a0a5182d5b5a06813568d331125945f412","observation_id":"ae15711c-a66f-4f0c-bdda-b11a36602770","resolution":{"observed_at":"2026-08-11T20:15:03.705120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.696238Z","title":"Woodruff","venue":null,"work_id":"d5438248-13ac-4797-bce9-e387f4ffb9f4","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.031779Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:86ee81cbaceeed85e192b465e91206b90fa5035beca5423056364fca302f7561","observation_id":"8fe85e48-b10f-423f-b740-cd531107ede4","resolution":{"observed_at":"2026-08-11T20:15:03.699341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.688445Z","title":"Fair prediction with disparate impact: A study of bias in recidivism prediction instruments","venue":null,"work_id":"def87b16-bd0e-4bb1-9078-707642c350d0","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.034677Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:d25b418cea3fab1a4cb4720cf526e27e0f1150e5aaaa792b1ce70f0fcabd58ee","observation_id":"b4199ebc-cef9-4cee-9e7d-9bfb0a88a4a5","resolution":{"observed_at":"2026-08-11T20:15:03.691984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.681784Z","title":"Fair clustering through fairlets","venue":null,"work_id":"cd01d888-ffe2-4ec0-8f05-8896f1ad32fa","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.037095Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:6b4ebd5279b64d251797cda7963164f5fcfc95c703f52fc95053985650a14db5","observation_id":"617e7321-fbaf-4f31-b2b7-5f1accc6cc03","resolution":{"observed_at":"2026-08-11T20:15:03.684382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.674786Z","title":"Solving linear programs in the current matrix multiplication time","venue":null,"work_id":"e0155e3a-3402-43a7-95c4-f52fbce81229","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.040206Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:adca2bea07831a075b651db9cb33389baac277bd98d123eb47fc61a79e1cd13b","observation_id":"a7787dfd-af4f-4ebc-bdad-6fbc43435eae","resolution":{"observed_at":"2026-08-11T20:15:03.677525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.666610Z","title":"Cohen, Cameron Musco, and Christopher Musco","venue":null,"work_id":"1f5fae8c-1dee-43fb-8312-1e5bd4cd3cf6","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.042562Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:b892304b149155a58c359b749d5225cc1d413669fab634e4d08a96b0c1394e42","observation_id":"1e25331b-3012-4c5b-a122-6585cc77c747","resolution":{"observed_at":"2026-08-11T20:15:03.669239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.659458Z","title":"Approximating fair clustering with cascaded norm objectives","venue":null,"work_id":"8d59f6b8-0f29-4547-baf2-4e60f9041205","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.044953Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:e143d68f6fcb9b9c5ced1279b0dd1601f891157014a4eaaa2ee40dfa6732cc0d","observation_id":"5c501441-8b07-4c2f-bdba-ba205f0f2c0a","resolution":{"observed_at":"2026-08-11T20:15:03.662190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.652355Z","title":"Cohen and Richard Peng","venue":null,"work_id":"fa3a304f-bbd1-44bf-a235-671571c26a4f","year":2015},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.048480Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:8db5ba667513cb9a60b4f2eba7b422f03ee45254740158a0e3377e6a00b0365d","observation_id":"36e24683-bf69-4c91-b1f6-c91c66b40959","resolution":{"observed_at":"2026-08-11T20:15:03.654894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.645905Z","title":"Active regression via linear-sample sparsification","venue":null,"work_id":"7d545476-22e7-4af5-bfb5-bf4dd7463c4b","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.051822Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:5e29751328eefa2c2918ddd5f73da89da9a380ab01f7ec43c08bc875de2f773b","observation_id":"35ba0749-1b1e-416b-b78e-16c5cce07f04","resolution":{"observed_at":"2026-08-11T20:15:03.648135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.639202Z","title":"Algorithmic decision making and the cost of fairness","venue":null,"work_id":"2f395c57-af93-4718-b8cc-a0fd4b55dca9","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.055176Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:7cdaa2ecb0454f18736dfea5c27a7a5e648796129a2d6dff3128b9f1346718ce","observation_id":"30de289a-72b2-4639-9b18-5c6edcf00d0f","resolution":{"observed_at":"2026-08-11T20:15:03.641800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04804","last_updated":"2024-07-05T18:37:09Z","snapshot_observed_at":"2026-08-16T13:36:41.049703Z","submitted_at":"2024-07-05T18:37:09Z","title":"Fair Submodular Cover","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.04804","snapshot_observed_at":"2026-08-11T20:15:03.058576Z","title":"Crawford","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.058576Z"},"links":{"cited_paper":"/paper/2407.04804","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:6929313a2df62bfae1fa6c759b3ea501f23cf1b25b9b954006c7e7a2684c7a89","observation_id":"1ad89e5a-2ae8-4661-99e7-6999bf1c4126","resolution":{"observed_at":"2026-08-11T20:15:03.058576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.632151Z","title":"Mahoney, and S","venue":null,"work_id":"ced27cce-091a-4011-98e7-144ccf863fc6","year":2006},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.061699Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:ce34092de257834e8f234eba3435e2bb0cffddb431e3fbcb48755b97002469c5","observation_id":"ed083cec-8d29-4679-8f80-e69cb3ed0366","resolution":{"observed_at":"2026-08-11T20:15:03.634818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.623725Z","title":"Mahoney, and S","venue":null,"work_id":"ac2331d9-0d62-470f-91c5-5906c9e4312b","year":2006},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.063931Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:212ed01253e396bc650c99845321717f07c3397c126d21872081f3b884e0b159","observation_id":"e5140757-663e-4f1f-b1bc-65f11e360295","resolution":{"observed_at":"2026-08-11T20:15:03.626782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.615283Z","title":"Fair representation clustering with several protected classes","venue":null,"work_id":"9e964948-2b9c-4c5e-b551-3ef0e839df66","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.066103Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:c25e7b6195de1376ae2bc13c5dcdacdf1c93444d69c0159266ea32f4533e9a7a","observation_id":"355c7233-9893-44d7-92ea-2e357d3aa4b1","resolution":{"observed_at":"2026-08-11T20:15:03.618547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.607943Z","title":null,"venue":null,"work_id":"ad0fae47-bbdd-4424-a371-169ad50797b9","year":2011},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.068533Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:22c516e68c97da67b62d9b4722859d929a49a355714a7d856e3621350348a9c6","observation_id":"fd455b5f-049d-4770-af9b-67d28dc12f7e","resolution":{"observed_at":"2026-08-11T20:15:03.610545Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.600846Z","title":"Esmaeili, Brian Brubach, Leonidas Tsepenekas, and John Dickerson","venue":null,"work_id":"a8108f8b-abb7-4332-b104-b60127eb0b73","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.070877Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:cfa0007ad8de14915ab700989751cf5a3838f4ef7c5bcd9902f736cd6258ead8","observation_id":"6fdaa121-b84c-4efc-bb9b-1af6a0417304","resolution":{"observed_at":"2026-08-11T20:15:03.603404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.072945Z","title":"The approximation of one matrix by another of lower rank","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.072945Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:fb266f6b49f0ac0687c473e213aa5549309b6e98e855fdb16796083f09d76348","observation_id":"9173aada-f82c-4105-9159-c1d091c2c2cf","resolution":{"observed_at":"2026-08-11T20:15:03.072945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.589957Z","title":"On the stochastic matrices associated with certain queuing processes","venue":null,"work_id":"29403177-24bd-400e-a221-7665dd1f5313","year":1953},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.075068Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:7c92a4c8af5a77b810904f7e2c1d48be9ea8dcd8fb7ecc7cc71d1b47c41ee8d7","observation_id":"4d187550-58b8-48f1-95d0-d975149b7433","resolution":{"observed_at":"2026-08-11T20:15:03.592598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.582374Z","title":"Tight FPT approximation for socially fair clustering","venue":null,"work_id":"d21ea40b-e2af-450f-9bf6-bed9001e5d86","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.077281Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:de22557297c7857f3c0ee214e64726ad6eb24e70b88dcf53b6ca52e46fa258e4","observation_id":"c486d382-4e53-493f-8c0f-53f3f356b716","resolution":{"observed_at":"2026-08-11T20:15:03.585819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.575223Z","title":"Socially fair k -means clustering","venue":null,"work_id":"c627aa8f-6d1d-4f47-9380-0e705b823c06","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.080664Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:66fbb47ef0eb35ccac1f03449be1b2f1f9e6938ca4ccaf6b9ba5180464272613","observation_id":"f93f1343-97b1-4109-b3d5-5720a556cd29","resolution":{"observed_at":"2026-08-11T20:15:03.577954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"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-17T06:11:40.618083Z","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:7ffeafeed725c7e8f38cc1992b0e8dc2810a6b59d166b99a6d1ab0d37fd74648","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.567212Z","title":"Solving SDP faster: A robust IPM framework and efficient implementation","venue":null,"work_id":"2249a06d-4df9-4787-a65a-7e403baa3ee2","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.085721Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:9c8c901ca11fb9b6cf9d15ab64101dd8ffa48339f8762568354aebc9c213c306","observation_id":"15bf05f9-26ee-4bb9-83f6-908f8a175713","resolution":{"observed_at":"2026-08-11T20:15:03.570830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.560502Z","title":"Approximation algorithms for fair range clustering","venue":null,"work_id":"a5c7ed66-7782-444f-a13c-8aeaf6362510","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.088154Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:fe99c80b8a2919d5bd1638eeb1faf325d98ca774a65ebd6431535a5302368431","observation_id":"3ff34ce4-688a-4541-9e09-890cbe5550aa","resolution":{"observed_at":"2026-08-11T20:15:03.563006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.554428Z","title":"Equality of opportunity in supervised learning","venue":null,"work_id":"aaaa0863-1204-44b6-8142-26c8271378af","year":2016},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.091118Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:d7c9f46016fd533d2cf6a2d0d9ee61af41481ab470d1bc707cddce7eae895c03","observation_id":"b654af28-e564-4269-884e-4ffc88f8706b","resolution":{"observed_at":"2026-08-11T20:15:03.556537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.548380Z","title":"On the complexity of k - SAT","venue":null,"work_id":"9935e49b-9c14-4a9c-ac5b-c6844566048b","year":2001},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.093953Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4d3ec98c281d1278f0f74458b4f5da6a4cc3e76eb2f3532b00df938fa0a13308","observation_id":"b2160d8f-e7c6-4f09-ab58-965ee3b22638","resolution":{"observed_at":"2026-08-11T20:15:03.550420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.542705Z","title":"A faster interior point method for semidefinite programming","venue":null,"work_id":"785effb5-2b75-4095-b3ec-26fd086f3d53","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.096691Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:0fca3f0838e0ae2c3c575632bcfa64f1e9509035d7a110bca6f9f86d81a43429","observation_id":"ff1f04e7-bb77-475a-8ab6-39e2f5eec19d","resolution":{"observed_at":"2026-08-11T20:15:03.544781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.535902Z","title":"Service in your neighborhood: Fairness in center location","venue":null,"work_id":"9ce00361-0113-4793-93ab-116ec8bcc3e8","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.099294Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:d397e3d32c188b614899fb665c44099a0661eb70acf8888d89f1ae04ba8faab7","observation_id":"617db602-7e80-4081-bbaf-b8b9f27f86d8","resolution":{"observed_at":"2026-08-11T20:15:03.538499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.529363Z","title":"Mahankali, and David P","venue":null,"work_id":"3f4c652e-e275-4e56-992d-c54b5080906f","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.101841Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:8407478caed99c6324171ba3fa470e07e40773e8f68af1908f5dec1f8f4dee97","observation_id":"810dd105-6647-4e08-a861-cdf4c4379967","resolution":{"observed_at":"2026-08-11T20:15:03.531883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.522525Z","title":"Liu, and Aaron Sidford","venue":null,"work_id":"5103b70c-3b31-422f-8126-504893baeade","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.104432Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:1ff065c57817ba6386a3e10299233fcf51eeba085c48d1b6dd343e46860fa30c","observation_id":"c5f7ef61-903e-4c5b-bb60-8a0812e06ae2","resolution":{"observed_at":"2026-08-11T20:15:03.525121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.514975Z","title":"An improved cutting plane method for convex optimization, convex-concave games, and its applications","venue":null,"work_id":"ee465808-bc52-48c6-8d57-dc982ca9734e","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.106948Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:c6b8cef5e4f70a00544c755d9a1fbe9ea73e98dba7e297298d78c98716be68a1","observation_id":"994ae342-20be-4214-885f-c809cfaf5d50","resolution":{"observed_at":"2026-08-11T20:15:03.517590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.508117Z","title":"Fair k -centers via maximum matching","venue":null,"work_id":"2501a830-1a6c-4dcf-9b55-e5ea32bfa144","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.109720Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:0ecdbb4f39ba3b47b685f857633ff440e0860d7bf9ee61ad912be8a9646070da","observation_id":"ec672cd8-2875-44bf-8bec-93a8368c9dcb","resolution":{"observed_at":"2026-08-11T20:15:03.510707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.501527Z","title":"Tsigaridas","venue":null,"work_id":"59a2229b-7147-4755-ae58-1368354fca68","year":2013},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.112210Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:86e1fe27b66aa2a00eb2394a3fd572431788bf8a5b6a7b204183c187fc82d9d7","observation_id":"b0cdb9e7-74e2-4b1d-8164-dac59f4bbd7e","resolution":{"observed_at":"2026-08-11T20:15:03.503901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.493950Z","title":"A faster algorithm for solving general lps","venue":null,"work_id":"2b63fcfa-9d2d-4135-b18d-7fd732bba94b","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.114590Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:fd1cf16c8ae53c3f452481182dbaa89830659b638a457257d1eaa42f849e622f","observation_id":"992a1fac-2e5a-46ad-9cae-f51a445b6f12","resolution":{"observed_at":"2026-08-11T20:15:03.496428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.486880Z","title":"Fair k -center clustering for data summarization","venue":null,"work_id":"76bbfca0-c073-4b67-b8da-bfd08b168adc","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.117403Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:9b18fcaf72ab26a5670d3fefcbc6500c90f4db9bd1cdb85e9d414c5ccd37c68f","observation_id":"2a2276fd-34a3-4493-88da-08cba6e14214","resolution":{"observed_at":"2026-08-11T20:15:03.489942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.478910Z","title":"Efficient fair pca for fair representation learning","venue":null,"work_id":"6c178e39-a7f5-4c0f-a126-94cd5171a4a7","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.120010Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:1b62d1884b50e9c06964147fd2a5714e8dd8ea8efefc3053c462fdb03c130052","observation_id":"8d367b25-333b-4c10-bb84-13ae7de09569","resolution":{"observed_at":"2026-08-11T20:15:03.481598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.472041Z","title":"Human decisions and machine predictions","venue":null,"work_id":"5f93ac54-b3de-46f0-b0f2-d770d5317094","year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.122400Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:2411820be43d956daec803868582f36f43f3db9d9f5e27b3c4ab8a5f66edc885","observation_id":"c765892b-5d03-4c3d-94ba-55f6d8da9c64","resolution":{"observed_at":"2026-08-11T20:15:03.474676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.465993Z","title":null,"venue":null,"work_id":"848a06b4-adc2-4f83-959b-73df7a6beaf2","year":2015},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.125576Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:7339f6cb6f3f051f55fb75a91bb76e60b5741e440bf3bc5eaf1bb2412d612735","observation_id":"e44d29a7-cf55-4b72-bf22-42204fceb917","resolution":{"observed_at":"2026-08-11T20:15:03.468311Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.460137Z","title":"Kleinberg, Sendhil Mullainathan, and Manish Raghavan","venue":null,"work_id":"f9a5127f-bbe0-4421-a9f2-38b5e13cd4d2","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.128125Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:72ef30fca24486c7dd34f989e83b738a3b23e935c08ff9a14b14a04b5c315f02","observation_id":"20ff0bc1-5b7d-4135-aaf8-60316a5a0215","resolution":{"observed_at":"2026-08-11T20:15:03.462264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.453354Z","title":"Woodruff","venue":null,"work_id":"99e1142e-dd08-4c3b-a0fc-785c352c1ec3","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.130556Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:e3f9a20ca7bf110780c3470f5418775748be1e75e61b0b1f74c6d72df5d8f85e","observation_id":"f3c94b8f-8aea-47a2-9d20-aac60c701afd","resolution":{"observed_at":"2026-08-11T20:15:03.455976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.445831Z","title":"Faster algorithms for convex and combinatorial optimization, 2016","venue":null,"work_id":"99f6fe8b-aa44-4e2c-a534-471bd01ea083","year":2016},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.132990Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:59c9bc85bcc7027a9e3925b470d30ee389ef4ce6392d45f536dc0949ef855883","observation_id":"1d2c1709-9ddc-4464-af2e-27840d8397d0","resolution":{"observed_at":"2026-08-11T20:15:03.448437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.438189Z","title":"Fast and efficient mmd-based fair pca via optimization over stiefel manifold, 2022","venue":null,"work_id":"5657324f-7c06-447c-a176-ff0ef2175908","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.135356Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:550bb48aae0bbd3ad15d14aaf2e0af26452a52d99338e51320bced4213ff32a2","observation_id":"c8eef274-a13f-441c-b9d7-7602e1b791df","resolution":{"observed_at":"2026-08-11T20:15:03.440974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.431443Z","title":"A faster cutting plane method and its implications for combinatorial and convex optimization","venue":null,"work_id":"2fec15d6-1416-479a-9736-ba3ebd7e7254","year":2015},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.137701Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4f84e3c7ecabf5c5a9d52f3d5b309f5cce45a7fdd50c044651cbd240ce9c84a1","observation_id":"906c44e1-bbb5-4f4e-9d2e-89805a61fe3d","resolution":{"observed_at":"2026-08-11T20:15:03.433995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","snapshot_observed_at":"2026-08-18T08:15:30.082444Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1008.0587","snapshot_observed_at":"2026-08-11T20:15:03.140200Z","title":"Row sampling for matrix algorithms via a non-commutative bernstein bound","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.140200Z"},"links":{"cited_paper":"/paper/1008.0587","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:1c047a2315f76255bf7a6627752a92f9b14ab066a9a3442052cc9f416e13e588","observation_id":"a996f1b8-273c-421c-8374-8e84d1e79faa","resolution":{"observed_at":"2026-08-11T20:15:03.140200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.424690Z","title":"Meyer, Cameron Musco, Christopher Musco, David P","venue":null,"work_id":"29ec68c2-fdad-40cd-898e-ec8a3d603176","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.142916Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:0475c2d77c071ccbd9f9e373036b028a4d9dcdfb5feab876f2fb3885d10c2a79","observation_id":"aabac81b-20e8-4e80-838f-b4829bbccd89","resolution":{"observed_at":"2026-08-11T20:15:03.427263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.417913Z","title":"Meyer, Cameron Musco, Christopher Musco, David P","venue":null,"work_id":"e7e0d0bf-a1c7-4c48-a332-0d61032212a7","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.145479Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:db2963f0a64cb413cf4413542f5c56263daa92dddc262fe55e3535d938482d21","observation_id":"0713c20f-3c71-46dc-a817-c57f8904b2ec","resolution":{"observed_at":"2026-08-11T20:15:03.420634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.411263Z","title":"Woodruff, and Taisuke Yasuda","venue":null,"work_id":"9667386f-3dde-4ecb-8d94-fd1737d88943","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.147548Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:731ca901339f2fe9f3746124fbb7d3eeb62cebff56e9d9f240eee28603c1cf22","observation_id":"2a90f107-225e-4f26-a525-30530727c915","resolution":{"observed_at":"2026-08-11T20:15:03.413810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.404630Z","title":"Fair column subset selection","venue":null,"work_id":"903cd98f-26f8-4710-9991-07a37160e3f6","year":2024},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.149551Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:b7c5305797fe5d0c2083d0f8e78a0ce25252aabf2fa5602cb7c898ca4d023942","observation_id":"7b825ed8-dfa0-4acd-a17b-7a769b2ba50b","resolution":{"observed_at":"2026-08-11T20:15:03.407122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.398063Z","title":"Individual fairness for k -clustering","venue":null,"work_id":"8a0a2903-4337-437b-b4d7-6d0c9429c71d","year":2020},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.151597Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:208072e424fbcf77293cb311ecb43211ef4f957aca8bd5a3e321a2c24356c81c","observation_id":"32eb75ec-779d-4530-a57d-87cfd612e8fb","resolution":{"observed_at":"2026-08-11T20:15:03.400585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.391530Z","title":"Approximation algorithms for socially fair clustering","venue":null,"work_id":"0e5bfbbc-46f6-44e8-b52f-5789429f3331","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.153899Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:8809f7ee5a8cbee8da9aacb4a3e9cdde046e8491e8f22d851eca4d80df00c05d","observation_id":"35234695-7b21-4725-bb04-8b2e6ba435d1","resolution":{"observed_at":"2026-08-11T20:15:03.394020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.385285Z","title":"Better algorithms for individually fair k-clustering","venue":null,"work_id":"5ea43348-906d-4c19-b8f9-f7806fceef9e","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.156336Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:9d2e84c7a5b9229ccfb7b8b309a49d77c6b8c3088a8f7a3e200020b7cf9c84eb","observation_id":"a73e875e-6d1a-4ce0-a2eb-78d8e6f1868d","resolution":{"observed_at":"2026-08-11T20:15:03.387472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2207.11337","last_updated":"2022-07-22T21:07:07Z","snapshot_observed_at":"2026-08-16T16:43:57.337495Z","submitted_at":"2022-07-22T21:07:07Z","title":"Fair Range k-center","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.11337","snapshot_observed_at":"2026-08-11T20:15:03.158601Z","title":"Fair range k-center","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-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.158601Z"},"links":{"cited_paper":"/paper/2207.11337","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:5b6e193742955f71891476bf7dfa5ffd7a0abcdf359d52081907f42c723af512","observation_id":"a1017825-e0e1-421f-a6ca-f8ca8ba11c48","resolution":{"observed_at":"2026-08-11T20:15:03.158601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.379256Z","title":"Convex formulations for fair principal component analysis, 2019","venue":null,"work_id":"2d2463da-6aea-4510-a034-a6eb2d1d75c9","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.161237Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:85fc32701a3b55f23be30c7ecfd441a79c1e3e0224cf680fc8f8a6121d5269d4","observation_id":"c5879074-aa9f-4c6b-a174-aa7f19337d91","resolution":{"observed_at":"2026-08-11T20:15:03.381397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.372876Z","title":"L_1 regression with lewis weights subsampling","venue":null,"work_id":"bb4c2ec6-fee1-4237-9b57-d15d1257e4a7","year":2021},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.163603Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4bbb7af447b4de6d89f0a81fec89898a4d210adeb7a855a3ff3f93ec3197c276","observation_id":"bccdcb80-e888-4280-b6c7-7a4d98a8afe6","resolution":{"observed_at":"2026-08-11T20:15:03.375339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.365966Z","title":"Random version of dvoretzky’s theorem in _p^n","venue":null,"work_id":"8c4c2f1d-558a-46cf-bbcf-b92a512c2b20","year":2017},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.167165Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4263f5d5131f98fba263d98c29e13e47b5be4ba60421be8c0c14544e0d194035","observation_id":"50406b68-4ed0-4b54-b60a-56a091bf4719","resolution":{"observed_at":"2026-08-11T20:15:03.368839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.359004Z","title":"On the computational complexity and geometry of the first-order theory of the reals","venue":null,"work_id":"1628e8fa-e0ab-4940-8fca-051f0c995841","year":1992},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.169682Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:242b4d1fb3f17bb285c51238411dc26c1d3d80edc356aa2ec533fdcf6586ea8b","observation_id":"fd3691a3-db1e-479b-8e9b-1f2ae738a496","resolution":{"observed_at":"2026-08-11T20:15:03.361742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.351153Z","title":"On the computational complexity and geometry of the first-order theory of the reals","venue":null,"work_id":"ca536c8f-2709-4db7-8b9b-8b0047e5debf","year":1992},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.172024Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:70aa4751e37c74e7868558490730c50e84440fd290e4e58b2427b73f6ec6b4b7","observation_id":"bfb362d6-fcb5-4e40-9635-c78f3296aa7e","resolution":{"observed_at":"2026-08-11T20:15:03.354906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.344281Z","title":"Privacy preserving clustering with constraints","venue":null,"work_id":"1233122d-7560-4fe8-a067-39e59fe0742b","year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.174279Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:c90428136fcb75c8aa5d7e6f1d24739279fdd42b52c7bcdf926ac16d413c1f21","observation_id":"00c1ffc5-c0f8-4feb-8765-86efb4318070","resolution":{"observed_at":"2026-08-11T20:15:03.346978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.337269Z","title":"Razenshteyn, Zhao Song, and David P","venue":null,"work_id":"772728e8-c59d-4165-9265-0f3308ed3447","year":2016},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.176603Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:a0cfe45fbfdddb3785b5865ab23cbdb1a6903f0f25ca8c572ea6982d6ce2b17d","observation_id":"d8e8530f-9a79-488b-8234-99b5112262d6","resolution":{"observed_at":"2026-08-11T20:15:03.339867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.330286Z","title":"The price of fair pca: One extra dimension","venue":null,"work_id":"faaa6d03-5aa0-466f-8871-127b32bb00f6","year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.179418Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:ee61deba1328bccfcac3e263ece54bb65defa141822bf3ffaf16ee1d7b1ca31f","observation_id":"4b362e2a-ed84-460d-bb05-e357d94f106b","resolution":{"observed_at":"2026-08-11T20:15:03.332973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.323399Z","title":"Woodruff","venue":null,"work_id":"3278fb06-5696-4930-ba72-ab6620efccff","year":2018},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.181949Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:5bf710fc01cdd49fd35f0605e00ebff37d2e9ced5047792bd65d94fd18e26c6e","observation_id":"d7d19626-163c-42e4-a25a-6caf44c356b2","resolution":{"observed_at":"2026-08-11T20:15:03.325879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.316221Z","title":"Clustering with fair-center representation: Parameterized approximation algorithms and heuristics","venue":null,"work_id":"a50257e7-51b5-400c-bac1-546e7fac33b1","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.184701Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:a430c7b4efb2bd15798cd8633cf76bc3e1d90a9b197e26ed18fad6d2ba3035a1","observation_id":"9a79fdb6-fcea-437b-ae4a-562e6a13e8b4","resolution":{"observed_at":"2026-08-11T20:15:03.318978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.309120Z","title":"Multi-criteria dimensionality reduction with applications to fairness","venue":null,"work_id":"ba70474b-082f-48e9-9a08-de2ed4a8f10a","year":2019},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.187037Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:fa8f1b766cfda119d352fc47029ecd331a2018f575459ae7edf085127cd23035","observation_id":"31a02ae2-d293-4dec-97ea-96553943a9d8","resolution":{"observed_at":"2026-08-11T20:15:03.311846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.301425Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":"69b77cfd-f74b-47e6-8910-527b085f88a8","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.189505Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:cb6cf465582081f15155f477ccd24208c9e8f2d33c64648fb773459b7f669c1f","observation_id":"91a6cc58-c7b3-4aa6-b351-6d78a7a2f59a","resolution":{"observed_at":"2026-08-11T20:15:03.304169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.293067Z","title":"Improved approximation algorithms for individually fair clustering","venue":null,"work_id":"bae10402-38af-4165-9b11-dff0f233aaea","year":2022},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.191841Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:4313d3ab50f504bd7f5aa76f862e7c6b77e99079fa8cda5920a4c93b10ed28a4","observation_id":"0af62042-91f8-4a91-907a-10bcaa50ea2a","resolution":{"observed_at":"2026-08-11T20:15:03.295549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.286316Z","title":"Woodruff","venue":null,"work_id":"1ebfa7ea-258b-4973-a50e-5aac18df5f77","year":2014},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.194150Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:76838d9f7f0784b0f129bafd8f66ea2e801481efaaa0663f98b69d4b24f4e093","observation_id":"bce8a756-afee-40cb-90a6-9c1bbc608bc9","resolution":{"observed_at":"2026-08-11T20:15:03.288796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.279381Z","title":"Woodruff and Taisuke Yasuda","venue":null,"work_id":"e2102faf-5921-45a4-be7c-817c54b78ca8","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.196565Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:e455f140eb7cf7b5cd2795eaca37bf16dc5cc1b65ceb4751166305c131846e25","observation_id":"d96ea93a-57ec-47fb-9e44-5d5843fd6f4f","resolution":{"observed_at":"2026-08-11T20:15:03.281634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.271231Z","title":"Woodruff and Taisuke Yasuda","venue":null,"work_id":"253fa3f5-67a6-46ea-a0e0-8c4dd8a9af44","year":2023},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.199029Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:92c11891358c9f8d0a5e98b8f35805beab2c2ce36b804f9c75a04af91168e3d4","observation_id":"905b7164-0a82-474b-99f9-77c739a2642c","resolution":{"observed_at":"2026-08-11T20:15:03.274758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.201682Z","title":"Default of Credit Card Clients","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.201682Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:59f0ec7f2fc1d0e4049d76a0cfa5aea743649340db6da2d3748bd276ad6f4a7c","observation_id":"14c154c9-e85f-45da-ad59-bcc7c0b17606","resolution":{"observed_at":"2026-08-11T20:15:03.201682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:15:03.261978Z","title":"The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients","venue":null,"work_id":"8f08fc00-cc56-4eae-b76a-f7276a8f0574","year":2009},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.204282Z"},"links":{"citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:3a0a951fa7c955c4f57c23879fa8a1195d7dd01953b1a2277402e4a68be3ea4b","observation_id":"48302d61-64b0-4937-a2a5-dc02107029a3","resolution":{"observed_at":"2026-08-11T20:15:03.266351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":70},"total_outbound_references":86},"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 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2412.06063."}