{"as_of":"2026-08-09T20:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed093c209b314ce17d720d72c72f1034dc0a9e02edd31d5bed625f251dba2784","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T20:24:17.557563Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2606.07285/citation-record","integrity":"/paper/2606.07285/integrity","json":"/paper/2606.07285/citation-record.json","paper":"/paper/2606.07285"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.08360","last_updated":"2026-05-08T18:15:14Z","snapshot_observed_at":"2026-08-08T12:47:30.456996Z","submitted_at":"2026-05-08T18:15:14Z","title":"Embeddings for Preferences, Not Semantics","version":1},"cited_work":{"arxiv_id":"2605.08360","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.08360","snapshot_observed_at":"2026-07-02T20:27:22.508724Z","title":"Embeddings for Preferences, Not Semantics","venue":"cs.AI","work_id":"1955594a-6f81-4343-b480-e91e18a20719","year":2026},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"cited_paper":"/paper/2605.08360","citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:c98134225bc8efac1078d2a7cd3c1a747b5ae681c5c979ea2f7c8ac606b90b70","observation_id":"9778ce09-134b-455b-a286-4e20accb493d","resolution":{"observed_at":"2026-07-02T20:27:22.510295Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T20:24:17.557563Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:08e28f1bbcd212995408ccb4d8a116bfc269bc792bb8a3f33349e15d2607245c","observation_id":"e95608c2-3959-417c-a437-ed2da3ded873","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence , articleno =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:ffa9db9da608939f82522ea251e0872a8f16ab3efb6c6354db45f8a5ff289351","observation_id":"2d295771-77e6-4f18-b6aa-fd5b588d39f5","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proportional Clustering, the","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:a7fad216340aae0447818235c0f89a1170cc7e3bb342c030ace3ea5c7c3f2f30","observation_id":"3f389cdb-3675-443f-8477-dde0b65f2442","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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":"10.1007/s00454-023-00619-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2024 , issue_date =","venue":"Discrete & Computational Geometry","work_id":"d356c2d0-fb73-4382-88f7-d9dfc53e02d9","year":2024},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:98137a6787998306dbcbbf654a272318b7d5e1e72d4689046457302eec7f5861","observation_id":"f7d3fbf1-2b05-453d-a9ed-6b70de21265a","resolution":{"observed_at":"2026-06-27T20:31:14.365355Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3459097","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2021 , issue_date =","venue":"ACM Transactions on Algorithms","work_id":"0e5086ed-00a4-46e3-bba9-7cd4905ed875","year":2021},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:4d4d3cc304f66b689d15b4de3e3113992bd1aeda3456db96504196a46a353931","observation_id":"457cfca4-7b2b-41fc-83e7-3d6ce98aef90","resolution":{"observed_at":"2026-06-27T20:31:14.367055Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.06776","last_updated":"2026-06-19T05:15:56Z","snapshot_observed_at":"2026-08-06T15:51:07.647261Z","submitted_at":"2026-02-06T15:31:02Z","title":"Fair Transit Stop Placement: A Clustering Perspective and Beyond","version":2},"cited_work":{"arxiv_id":"2602.06776","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.06776","snapshot_observed_at":"2026-07-02T20:27:22.507442Z","title":"Fair Transit Stop Placement: A Clustering Perspective and Beyond","venue":"cs.GT","work_id":"640f8abc-0aea-41e9-b24a-0c80199525d3","year":2026},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"cited_paper":"/paper/2602.06776","citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:45f615ad402b82abde058de2ecaf8b91b71c45f448be723f8f09a9efaf8eaa0e","observation_id":"6beb45ec-6cad-46fe-bc2a-cdde27bf14b0","resolution":{"observed_at":"2026-07-02T20:27:22.508605Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T20:24:17.557563Z","title":"Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems , pages =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:b65b2e82ee9b62ec3e1a352d7c281c2f557ba3bc2580fd29f91c9ff1af0c3669","observation_id":"236f7e3e-dacd-45f2-8749-27fb219fe166","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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":"2511.19107","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T20:27:22.509832Z","title":"arXiv preprint arXiv:2511.19107 , year=","venue":null,"work_id":"ece6ba18-578c-4cc3-a5dd-e2278c1d1fee","year":null},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:d7576923e3818fffe0546cf87979551ba6461ea8854de9f2d07e31a446db1cd8","observation_id":"f3547ea7-2bad-416d-a018-4f83fa97f398","resolution":{"observed_at":"2026-07-02T20:27:22.511384Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T20:24:17.557563Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:077f9e76f0fe3f50c6bda7a23bfe29d1a72f37385b102b2f3b28c2639532dfaf","observation_id":"b4507f67-db8f-4706-b333-5c0218517909","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:4cd61c9aab8fadb9fcf181d55677da6f5b8854ba573660d4d3163bf292abbbb8","observation_id":"89ffa52d-98b1-440f-a51b-36b411c9896d","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:c6f143efc617fd470f81bad408f3d6050b9213f34348569c8936e372c5657f1f","observation_id":"804a59f1-be11-4808-acf7-eab622744060","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proceedings of the 36th International Conference on Machine Learning (ICML'19) , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:c8ffe7cb33fcf1d49eb81b6c08f7a2f24f42729689fd05d982c70fcd4640d160","observation_id":"104b4a1e-b8be-4a38-a31e-928a47727f3a","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) , series =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:0fa7fe3a7f37ff341a13233a41a63c49e600afc5bd5ce9a54d38b0c3f6df13b8","observation_id":"f5c61b91-65b0-451b-81c5-f6b7b26e9be3","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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":"10.1007/978-3-032-08560-3_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Chu, Sean Morota and Vollen, Jeremy , title =","venue":"Lecture notes in computer science","work_id":"09870fac-48eb-41a9-9ea7-e15504d80903","year":2024},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:11a44d5a02139cf6ac236641a5b18fb1c68334dcd2b1c937ccb0d35091d0cc84","observation_id":"9d2e0e33-5322-461d-ba5c-cb99d4b46223","resolution":{"observed_at":"2026-06-27T20:31:14.366335Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T20:24:17.557563Z","title":"Computing and Testing Pareto Optimal Committees , journal =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:9004abab1bbc0b5ec5b479498b77562b1aa97209a69f9a36fb306f7a59fd6dd1","observation_id":"ff59866d-3f2f-405f-a7a5-ae6221404f3f","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proceedings of the 38th International Conference on Neural Information Processing Systems , articleno =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:72ee025b745e74964e491ae09835012fc9b725bb552bdec0ff52d47a631e981d","observation_id":"5817452d-23da-43ff-906c-acb079384a83","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proceedings of the 38th International Conference on Neural Information Processing Systems , articleno =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:7eaf1768a71224a8a6a8e599701826d7c04391e00af99a06ad87041737b2afa3","observation_id":"4157306a-2cb2-41b6-b2ae-4c89fdaf6b49","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","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-06-27T20:24:17.557563Z","title":"Proportionale Clusterings auf Graphen , url=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T20:24:17.557563Z"},"links":{"citing_paper":"/paper/2606.07285"},"observation_digest":"sha256:2e3bdb37fc0dec7f7bc76f8f83bb3c5693381e77055750dcd38475b7444f3a62","observation_id":"c0babe45-a82c-480a-bc24-7bbc286e45c3","resolution":{"observed_at":"2026-06-27T20:24:17.557563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.07285","last_updated":"2026-06-05T13:57:45Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-03T12:51:33.808556Z","submitted_at":"2026-06-05T13:57:45Z","title":"Improved Lower Bounds for Proportionally Fair Clustering"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":13,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":19},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2606.07285."}