Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:24:58.775022Z
Paper Citation Record · LEDGER
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:24:58.775022Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
15 of 15 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 2d45e53f-2b79-4d41-a37a-20723341ec0f · outbound
Accelerating Spectral Clustering under Fairness Constraints The results show that our algorithm outperforms the compared ones in terms of computational time for all tested sample sizes and cluster sizes
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation e1e3fbf3-c46a-450d-9ad4-28124bdc5627 · outbound
Accelerating Spectral Clustering under Fairness Constraints Unresolved cited work
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 573b7a8e-4342-4649-9ab8-c28ad852f5bb · outbound
Accelerating Spectral Clustering under Fairness Constraints Unresolved cited work
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 2e2baf97-2be5-4a70-81f2-eef82c2f207e · outbound
Accelerating Spectral Clustering under Fairness Constraints 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
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 34b7f76a-230b-4a50-8869-ae9db936f846 · outbound
Accelerating Spectral Clustering under Fairness Constraints Unresolved cited work
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 9792886e-01e3-4f43-b556-ef4ec8572768 · outbound
Accelerating Spectral Clustering under Fairness Constraints Since polynomial functions possess derivatives of all orders, each ψij is smooth (i.e., C ∞)
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation ed93f143-da00-4c01-a2b2-c88e653b2c41 · outbound
Accelerating Spectral Clustering under Fairness Constraints 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
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation eeadac17-afab-4818-832c-363d916b81cd · outbound
Accelerating Spectral Clustering under Fairness Constraints 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
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 536b3c8b-1a56-4770-ac1c-595cd729d1cd · outbound
Accelerating Spectral Clustering under Fairness Constraints Rösner, C
Reference 1987
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bb249449-3be0-427f-a68c-e322f8ec3938 · outbound
Accelerating Spectral Clustering under Fairness Constraints P., Schwarting, W., Bhatia, S
Reference 2008
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation a85c85be-42c6-4fdf-9ee4-981d3260292f · outbound
Accelerating Spectral Clustering under Fairness Constraints 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
Reference 2011
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation c71b234a-a336-4b3f-b3f4-b1d11befc547 · outbound
Accelerating Spectral Clustering under Fairness Constraints The K-modes algorithm for clustering
Reference 2018
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation e1201dc7-e217-4876-8ec1-f33f80a2235b · outbound
Accelerating Spectral Clustering under Fairness Constraints Evaluating the fairness of discriminative foundation models in computer vision
Reference 2019
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 7d6ce241-f88a-454b-a0e0-acfff2903467 · outbound
Accelerating Spectral Clustering under Fairness Constraints Another related work is (Zhang & Wang, 2024)
Reference 2024
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 4a318b3f-579c-41a9-99c9-bcca5bd063bd · outbound
Accelerating Spectral Clustering under Fairness Constraints These plots show that our method produces assignments comparable to exact algorithms (o-FSC,s-FSC)
Reference 7500
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
No inbound Pith citation observations are available.