{"as_of":"2026-08-08T19:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:602f3c742fd623ad9a083791e8cf0546351d753d62f53f82cfca1ac8361a4516","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:24:58.775022Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.08143/citation-record","integrity":"/paper/2506.08143/integrity","json":"/paper/2506.08143/citation-record.json","paper":"/paper/2506.08143"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:58.950486Z","title":"The results show that our algorithm outperforms the compared ones in terms of computational time for all tested sample sizes and cluster sizes","venue":null,"work_id":"68d3407d-c989-4bf7-9ff4-16292c8fc4fe","year":2023},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.736019Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:07044bc50e8f887e1e15b627ad2f0166579f79f74159f3dfe1c7d5ced0d211f1","observation_id":"2d45e53f-2b79-4d41-a37a-20723341ec0f","resolution":{"observed_at":"2026-08-07T05:24:58.954938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.963577Z","title":null,"venue":null,"work_id":"0883132a-e26a-402b-a5cd-893f1862de00","year":2023},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.731893Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:177512bfc0f98b7c9556d8d305b3fbcc490cad98d73f1c7aa5baac45ed43d2d8","observation_id":"e1e3fbf3-c46a-450d-9ad4-28124bdc5627","resolution":{"observed_at":"2026-08-07T05:24:58.967791Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.898242Z","title":null,"venue":null,"work_id":"b284fe49-d0ce-422f-bf39-90d6a4c47b69","year":2019},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.755193Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:90c0ff442dd6787f34b678adf353ca85e8b2b095b7684a5f203b1d93a8d1754b","observation_id":"573b7a8e-4342-4649-9ab8-c28ad852f5bb","resolution":{"observed_at":"2026-08-07T05:24:58.901931Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.884026Z","title":"However, extending the fairlet analysis, which relies on the k-median and k-center cost of the fairlet decomposition, to the spectral setting is not trivial","venue":null,"work_id":"fb32e1d5-782b-4645-88ba-a93b09245df9","year":2016},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.759262Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:d0ec967e20f58e5c0d4c8a3932dfad63e0727ab3d4e57c37fffe50134944feae","observation_id":"2e2baf97-2be5-4a70-81f2-eef82c2f207e","resolution":{"observed_at":"2026-08-07T05:24:58.888875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.870985Z","title":null,"venue":null,"work_id":"974f021e-3632-4968-affd-0e92a354d51e","year":2016},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.763253Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:02223953a9ea132a91b2c834493dac7965a6bfde5439180a5c44abb545c9f165","observation_id":"34b7f76a-230b-4a50-8869-ae9db936f846","resolution":{"observed_at":"2026-08-07T05:24:58.875424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.858131Z","title":"Since polynomial functions possess derivatives of all orders, each ψij is smooth (i.e., C ∞)","venue":null,"work_id":"24a36e28-7186-4ad4-b5bc-c81286141e95","year":2016},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.767334Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:d0fb376ece9d5ee21762709be393984a33f9fc6d11c01cec38963050ad2676da","observation_id":"9792886e-01e3-4f43-b556-ef4ec8572768","resolution":{"observed_at":"2026-08-07T05:24:58.862523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.844775Z","title":"Therefore, the only linear combination of the gradients ∇xψij(¯x)that equals zero is the trivial one, which proves thatC(¯x)is linearly independent","venue":null,"work_id":"2791f141-51fc-4ae2-a7b3-0ab786d099f0","year":2023},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.771119Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:5434d3983cedc5465efded6920719df977496a5b3f90324eb3b35edb3991e2ae","observation_id":"ed93f143-da00-4c01-a2b2-c88e653b2c41","resolution":{"observed_at":"2026-08-07T05:24:58.848914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.831107Z","title":"Proof of Proposition 3.2 Proof.Expandingϕ(M H)to recover the expression of the augmented Lagrangian shows thatH7→ϕ(M H)is convex as long asα <1","venue":null,"work_id":"1895c10d-705b-4f24-bf62-f14a5e40bc33","year":2023},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.775022Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:a4d153a15792ca86014a1d592b464be520ec3c7a9e50669169f15208bd5c85cb","observation_id":"eeadac17-afab-4818-832c-363d916b81cd","resolution":{"observed_at":"2026-08-07T05:24:58.835939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.725926Z","title":"Rösner, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":1987,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.725926Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:905d1a6e81ed2f1db56a846e6cc2f05049f5a5a44f4c986fea9870ea38f1cd68","observation_id":"536b3c8b-1a56-4770-ac1c-595cd729d1cd","resolution":{"observed_at":"2026-08-07T05:24:58.725926Z","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-07T05:24:58.976036Z","title":"P., Schwarting, W., Bhatia, S","venue":null,"work_id":"08c25c66-8830-4b04-a71b-0354e0b1c12e","year":2019},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.717015Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:c527885762445bd543e2a400de14906ac74bfc5bae4cbdfef0491acf4337c846","observation_id":"bb249449-3be0-427f-a68c-e322f8ec3938","resolution":{"observed_at":"2026-08-07T05:24:58.980183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.923096Z","title":"The parameters τ and µ are set to 2 16 Accelerating Spectral Clustering under Fairness Constraints Table 10: Description of the real-world datasets used for the experiments","venue":null,"work_id":"e1d47518-12ec-41ec-b7cd-a48884abb0d9","year":2019},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.745173Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:369cb000987282c0c835966a22d50de179f325c56709fb6d8889c39bc7f5e6f6","observation_id":"a85c85be-42c6-4fdf-9ee4-981d3260292f","resolution":{"observed_at":"2026-08-07T05:24:58.927600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.6478","last_updated":"2013-04-24T03:59:39Z","snapshot_observed_at":"2026-07-06T03:11:51.813034Z","submitted_at":"2013-04-24T03:59:39Z","title":"The K-modes algorithm for clustering","version":1},"cited_work":{"arxiv_id":"1304.6478","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.6478","snapshot_observed_at":"2026-08-07T05:24:58.816663Z","title":"The K-modes algorithm for clustering","venue":"cs.LG","work_id":"40bcbb94-104b-412e-99e8-b5b0757d7f20","year":2013},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.721367Z"},"links":{"cited_paper":"/paper/1304.6478","citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:f2b65eeee81893d41cfe221b8c0f9ceedd0c18f4b1cfab0ed20295c02231558d","observation_id":"c71b234a-a336-4b3f-b3f4-b1d11befc547","resolution":{"observed_at":"2026-08-07T05:24:58.822355Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.988445Z","title":"Evaluating the fairness of discriminative foundation models in computer vision","venue":null,"work_id":"705b89ca-aeb9-4d58-ba31-579d06487513","year":2023},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.712194Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:c52b02909fa6f3f3fb89f8cff7db7b63f4471917294aa0b3b4ea244d0a0b2c05","observation_id":"e1201dc7-e217-4876-8ec1-f33f80a2235b","resolution":{"observed_at":"2026-08-07T05:24:58.992471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.910146Z","title":"Another related work is (Zhang & Wang, 2024)","venue":null,"work_id":"828c09e6-6383-46b8-8866-da4411998971","year":2024},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.750416Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:c55314cb3a3fc3126cbdbe8f5d3aaa397778885a45a813ff94749cba789ad6eb","observation_id":"7d6ce241-f88a-454b-a0e0-acfff2903467","resolution":{"observed_at":"2026-08-07T05:24:58.914193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-07T05:24:58.936434Z","title":"These plots show that our method produces assignments comparable to exact algorithms (o-FSC,s-FSC)","venue":null,"work_id":"f87f2c81-1768-49b8-ace8-a1a6d8707a26","year":2019},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":7500,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.740295Z"},"links":{"citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:d315b7e998a8d6d52c49876c8628c71b2b45a1c890045ce7f3e9154ddb2b88b6","observation_id":"4a318b3f-579c-41a9-99c9-bcca5bd063bd","resolution":{"observed_at":"2026-08-07T05:24:58.941541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.08143."}