Paper Citation Record · LEDGER

Learning Augmented Graph $k$-Clustering

As of 19 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.13533.

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

pith.paper-citation-record.v1
2506.13533 v1

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T20:11:31.139350Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

15 of 15 outbound references displayed

verified exact1
verified fuzzy1
unresolved9
parse uncertain0
malformed identifier0
metadata mismatch4

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation fab89cad-5933-4ff3-ad5d-9f3ef4ce2a54 · outbound

This paper cites Sandeep Silwal.

Learning Augmented Graph $k$-Clustering Sandeep Silwal

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.129388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee183250-c048-4545-9d6f-49ed98f37cb4 · outbound

This paper cites Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.

Learning Augmented Graph $k$-Clustering Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Reference 16

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T20:11:31.497746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation fcf9cdf5-f931-4ac3-92fe-dd602a6b32b2 · outbound

This paper cites GraphLearner: Graph Node Clustering with Fully Learnable Augmentation.

Learning Augmented Graph $k$-Clustering GraphLearner: Graph Node Clustering with Fully Learnable Augmentation

Reference 17

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T20:11:31.196696Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 46a420e4-70c8-43e1-ae95-98b7a45e9642 · outbound

This paper cites Edward W.

Learning Augmented Graph $k$-Clustering Edward W

Reference 1962

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.103723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 47bad72b-64e5-4d08-84d4-d73e4d643428 · outbound

This paper cites Mary Inaba, Naoki Katoh, and Hiroshi Imai.

Learning Augmented Graph $k$-Clustering Mary Inaba, Naoki Katoh, and Hiroshi Imai

Reference 1979

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.111873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adbe7f03-98a3-4bf2-83cf-a514b299c307 · outbound

This paper cites Mario Lucic, Olivier Bachem, and Andreas Krause.

Learning Augmented Graph $k$-Clustering Mario Lucic, Olivier Bachem, and Andreas Krause

Reference 1982

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.122649Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67a6eb70-5549-459e-a078-83f1b7e2053a · outbound

This paper cites an unresolved cited work.

Learning Augmented Graph $k$-Clustering Unresolved cited work

Reference 2010

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.109157Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90cbe4c1-59e9-46e2-ab72-4b91f6a15c5a · outbound

This paper cites Approximating $k$-Median via Pseudo-Approximation.

Learning Augmented Graph $k$-Clustering Approximating $k$-Median via Pseudo-Approximation

Reference 2012

Resolution: verified exact; local_arxiv, observed 2026-08-15T20:11:31.345224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation aac1b3c1-96d0-4ac6-bbc4-b8bbf4ea447d · outbound

This paper cites Robert W.

Learning Augmented Graph $k$-Clustering Robert W

Reference 2014

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.100692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc283415-1674-48e4-ad03-c2993e558bcc · outbound

This paper cites X-ray and Ultraviolet Properties of AGN in Nearby Dwarf Galaxies.

Learning Augmented Graph $k$-Clustering X-ray and Ultraviolet Properties of AGN in Nearby Dwarf Galaxies

Reference 2016

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.125909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3e80863-f264-499f-86c7-ede8781801fa · outbound

This paper cites an unresolved cited work.

Learning Augmented Graph $k$-Clustering Unresolved cited work

Reference 2017

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.082330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cbc940f-06e1-44d4-9a06-232df9dc739d · outbound

This paper cites On Approximability of Clustering Problems Without Candidate Centers.

Learning Augmented Graph $k$-Clustering On Approximability of Clustering Problems Without Candidate Centers

Reference 2020

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T20:11:31.484895Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 3f3b65a2-e998-464c-8488-ed3901ffb22c · outbound

This paper cites Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics.

Learning Augmented Graph $k$-Clustering Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics

Reference 2021

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T20:11:31.467664Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c3d9cab1-2796-40b5-9888-0add30d652e0 · outbound

This paper cites Making k-means even faster.Proceedings of the 2010 SIAM International Conference on Data Mining , pages 130–140,.

Learning Augmented Graph $k$-Clustering Making k-means even faster.Proceedings of the 2010 SIAM International Conference on Data Mining , pages 130–140,

Reference 2022

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:11:31.508289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation dd20ad55-88c8-415d-9d4e-984e4c5188a7 · outbound

This paper cites A Rapid Review of Clustering Algorithms.

Learning Augmented Graph $k$-Clustering A Rapid Review of Clustering Algorithms

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-15T20:11:31.139350Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.