Paper Citation Record · LEDGER

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?

As of 16 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2412.08128.

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

pith.paper-citation-record.v1
2412.08128 v4

Coverage vector

measured 44 of 44 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T18:20:05.949791Z

measured 44 of 44 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+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

44 of 44 outbound references displayed

verified exact0
verified fuzzy5
unresolved39
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 50740073-6606-4332-ba6c-2cdff11826e2 · outbound

This paper cites , " * write output.state after.block = add.period write newline.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? , " * write output.state after.block = add.period write newline

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.741290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1af39033-7834-4054-8509-1e450756d66b · outbound

This paper cites write newline.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? write newline

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.746859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3c5faab-ce17-4f46-8e38-2ed5fe406b58 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.578689Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 47e3a67b-77c2-43fe-aa8c-7e42dbec0a60 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 4

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.561743Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 826ff51b-535f-491a-b14a-06d7e6a13423 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.522283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a330ee93-6b27-40bb-828c-ab00de61e6cf · outbound

This paper cites S.; Ribeiro, A.; and Sadler, B.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? S.; Ribeiro, A.; and Sadler, B

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:20:06.491131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3673f7dc-e2f4-4be0-b5d5-9ff490ea24e3 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.770210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c20af34-dd99-4112-baea-7c340e824a8e · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.774212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc8e882e-ceea-4e47-9d0d-cd9b464499f2 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.780241Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b629542-99d9-41b9-b0cf-fc2e1a9c1078 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.785016Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e0d55bf-bfe7-48e9-bdec-9049e11f2bfb · outbound

This paper cites N.; and Welling, M.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? N.; and Welling, M

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.789683Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 414deaf7-149c-4a0f-a1c7-266437f4ca56 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.803681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff6e40fc-29d6-4577-9de5-7de7fafc1f61 · outbound

This paper cites C.; and Pan, S.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? C.; and Pan, S

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:20:06.411358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e07bf3de-dbe5-4024-8eef-3a568da749ac · outbound

This paper cites Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.814049Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a7288f5-9314-4459-aecf-8c2d23b49d63 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.819248Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08f3e431-d6a2-4def-ac53-ff276d6e7a4c · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 16

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.385031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 40a04f9c-583e-4a8f-8ac9-18d221d4882e · outbound

This paper cites W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; Krueger, G.; and Sutskever, I.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; Krueger, G.; and Sutskever, I

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:20:06.370449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 157f7e48-13fa-4472-b001-3539a505b98f · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 18

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.353784Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 4851698b-90fa-4b0c-83d6-49603c5e4d22 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.337960Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 25515764-4b9d-4d27-a704-c64ca7e4a605 · outbound

This paper cites Pitfalls of Graph Neural Network Evaluation.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Pitfalls of Graph Neural Network Evaluation

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.840215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5232976e-c56f-4c1c-b8df-4fcbb9c4cfa0 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 21

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.322429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation ed192ab4-8b50-4af4-977d-87b562f6056c · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.849304Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7b1ae2b-b100-46c2-8a86-071e70a2667a · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.296868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation dab1b20e-7280-422c-bc58-3a3747ede77b · outbound

This paper cites G.; Azabou, M.; Dyer, E.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? G.; Azabou, M.; Dyer, E

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.858630Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9460985d-2900-40a7-8946-29ec38aa104d · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.863630Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88a88a61-678f-4fab-a7cd-70c3cfea934a · outbound

This paper cites K.; Gelly, S.; and Lucic, M.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? K.; Gelly, S.; and Lucic, M

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:20:06.261636Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 79092e15-6858-4435-9018-493ea7a0a38d · outbound

This paper cites Representation Learning with Contrastive Predictive Coding.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Representation Learning with Contrastive Predictive Coding

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.872948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f0c1392-7be0-412c-a4a3-71686286960f · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.878176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02938d14-a6b2-4edb-bafd-38a344c675fe · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.883142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6cf3e44a-3b90-412c-b5e1-6ad0bc9ee74d · outbound

This paper cites L.; Liò, P.; Bengio, Y.; and Hjelm, R.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? L.; Liò, P.; Bengio, Y.; and Hjelm, R

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.887649Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18a896d7-a57c-4703-8528-c678e43d1e65 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 31

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.214912Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a7ba436e-97d5-465e-af82-f13629572700 · outbound

This paper cites A.; et al.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? A.; et al

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:20:06.199130Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 23a30d39-5305-432c-961a-f036083e1f46 · outbound

This paper cites On Mutual Information in Contrastive Learning for Visual Representations.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? On Mutual Information in Contrastive Learning for Visual Representations

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.901676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d47f14fa-c518-4c6a-b26d-632ff9aa7f1e · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 34

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.185077Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5c6ab4b9-19b5-42fb-84ec-9143f82d02ad · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.909811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 890a3a61-3fe4-43f7-8bc5-76a2f7992b58 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.914313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12c02520-3a6e-42e2-baf9-1ce819a489fa · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.918604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31a94358-5e99-4d31-bcd5-b2ac1d8728a0 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 38

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.138890Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 43a5089f-da4d-45b7-ac15-46fa81d32b56 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 39

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.122875Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 62784d0f-6918-455c-b97c-d64461b27fdc · outbound

This paper cites Data Augmentation of Contrastive Learning is Estimating Positive-incentive Noise.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Data Augmentation of Contrastive Learning is Estimating Positive-incentive Noise

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.930759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a693ccb-8e66-44ee-8715-b1fd7b952952 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.935774Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b275d26-8325-4f1f-80f6-62129c33e285 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 42

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.096262Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 571feecb-bceb-4f64-a25c-94a7083a38fd · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 43

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:20:06.080855Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b71b1f18-6e1d-4c52-ab83-8f05352cd423 · outbound

This paper cites an unresolved cited work.

Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-11T18:20:05.949791Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.