Paper Citation Record · LEDGER

ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning

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

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

pith.paper-citation-record.v1
2110.02027 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 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 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:29:50.205352Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

44
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation d2b2d989-01dd-4aed-a77d-91c843222df4 · inbound

Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives cites this paper.

Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-07T15:29:50.205352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cf8a243-4289-4293-84a4-8f696d876cb9 · inbound

Dual-Center Graph Clustering with Neighbor Distribution cites this paper.

Dual-Center Graph Clustering with Neighbor Distribution ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-06T16:24:07.925617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64c0bf57-b0b8-4ade-8682-e3c980276c1f · inbound

Color2Struct: efficient and accurate deep-learning inverse design of structural color with controllable inference cites this paper.

Color2Struct: efficient and accurate deep-learning inverse design of structural color with controllable inference ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning

Reference 96

Resolution: verified exact; arxiv_id, observed 2026-05-22T12:11:31.215960Z

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.

Observation ef546acc-24f4-4333-abc3-320491aa7dab · inbound

UNICS: Multilingual Code Search via Unified Pseudocode and Contrastive Transfer Learning cites this paper.

UNICS: Multilingual Code Search via Unified Pseudocode and Contrastive Transfer Learning ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning

Reference 56

Resolution: verified exact; arxiv_id, observed 2026-06-29T04:13:04.978756Z

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.