Pith. sign in

Paper Citation Record · LEDGER

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.10378.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2405.10378 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:54:16.250905Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-11T00:37:53.773330Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation b1000775-fb0f-4bbe-b8da-e158c17aac86 · inbound

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering cites this paper.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-16T11:54:16.250905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T11:54:16.250905Z digest=sha256:ef5914ce77c7696445d703a6ad1a2865a7f790703ccb0333658c4f582fbd5367

Observation 5a20c4aa-8a93-48be-8f78-568ca0251bb0 · inbound

Approximation Algorithms for Perfect Fair-Triangle Packing cites this paper.

Approximation Algorithms for Perfect Fair-Triangle Packing A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-11T00:37:53.781801Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-11T00:37:53.610226Z digest=sha256:44857e7ac1b349871934f12af3fa889b8a592afd5c391ee75713a2d799421949