Pith. sign in

Paper Citation Record · LEDGER

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm

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

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

pith.paper-citation-record.v1
2601.06351 v2

Coverage vector

measured 2 of 2 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T11:31:18.596719Z

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+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-01T10:07:59.401967Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

2 of 2 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a0220de4-95be-4878-acb9-9a0ae6dc833d · outbound

This paper cites Strong bounds for large-scale minimum sum-of- squares clustering.arXiv preprint arXiv:2502.08397,.

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm Strong bounds for large-scale minimum sum-of- squares clustering.arXiv preprint arXiv:2502.08397,

Reference 1986

Resolution
unresolved
no resolver link, observed 2026-08-03T11:31:18.508915Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T11:31:18.508915Z digest=sha256:2c1d8fa2a98e2264bc9b6e913bc503fe9d188739a948f873db52be5e5a3ea69b

Observation 0b9b2de5-deb5-4dd2-b7aa-276814153fa4 · outbound

This paper cites Submodular Batch Selection for Training Deep Neural Networks.

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm Submodular Batch Selection for Training Deep Neural Networks

Reference 2023

Resolution
unresolved
no resolver link, observed 2026-08-03T11:31:18.596719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T11:31:18.596719Z digest=sha256:9575de4b5fa3d55f38cb03a09b03e620f5d24f862b1adf20010645b9d20a6c37

Pith citing papers

Observation c3cfa12d-7017-4c01-a5cc-bae6f405e4b2 · inbound

Variance-reduced Domain Adaptation using Paired Sampling cites this paper.

Variance-reduced Domain Adaptation using Paired Sampling A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm

Reference 2026

Resolution
unresolved
no resolver link, observed 2026-08-01T10:07:59.401967Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T10:07:59.401967Z digest=sha256:14a461c4d0fd7d1842e6ebc0676478613f925b84a27cf374f032eba83b81839a

Observation 01abbe62-103a-4b3c-8240-28815010949c · inbound

Online Variance Reduction for Domain Adaptation on Streaming Data cites this paper.

Online Variance Reduction for Domain Adaptation on Streaming Data A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm

Reference 2026

Resolution
unresolved
no resolver link, observed 2026-08-01T10:04:11.207916Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T10:04:11.207916Z digest=sha256:ba4f5d94819efebcec9cb8f48d25facbee663a2337377df5d8c18274b22068a1