{"as_of":"2026-08-16T20:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:023397cc25ad2b3a722333d89710f5474937825d1257287b94c1d04b3344b06b","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:20:05.949791Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.08128/citation-record","integrity":"/paper/2412.08128/integrity","json":"/paper/2412.08128/citation-record.json","paper":"/paper/2412.08128"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.741290Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.741290Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:b2b479d3be899d25736a24058d37332531d1576370d2201789baaa0668554fa6","observation_id":"50740073-6606-4332-ba6c-2cdff11826e2","resolution":{"observed_at":"2026-08-11T18:20:05.741290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.746859Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.746859Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:71abff51cd48751a8794eb221eaac00d1e1fffc3b4b33726aba4cc84e06d7e2f","observation_id":"1af39033-7834-4054-8509-1e450756d66b","resolution":{"observed_at":"2026-08-11T18:20:05.746859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.573921Z","title":null,"venue":null,"work_id":"604d0300-f698-4111-bd97-f9106bdcd559","year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.751704Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:323e90949cc07e79c435543fcd2e05125c4017e6c7921da502675902cde9c1a1","observation_id":"d3c5faab-ce17-4f46-8e38-2ed5fe406b58","resolution":{"observed_at":"2026-08-11T18:20:06.578689Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.555242Z","title":null,"venue":null,"work_id":"82d85263-f832-46f3-915d-e7a0954cba74","year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.757054Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:e970842eab0bc991bc4707efe45fa9f1f8b81d667bd4fb6a0f27d4119ab16605","observation_id":"47e3a67b-77c2-43fe-aa8c-7e42dbec0a60","resolution":{"observed_at":"2026-08-11T18:20:06.561743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.504540Z","title":null,"venue":null,"work_id":"9895dc1b-7817-4b91-84ef-ce1918c0880a","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.761316Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:743eda67ebe5c9e9e933fa68dda27a451320b052ce266001009b7bf6c6a562d3","observation_id":"826ff51b-535f-491a-b14a-06d7e6a13423","resolution":{"observed_at":"2026-08-11T18:20:06.522283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.484368Z","title":"S.; Ribeiro, A.; and Sadler, B","venue":null,"work_id":"cb641079-7b60-4e00-ade8-17000a21dcd9","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.765510Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:feac1b33589fb8edc780d8bb4ae0ac071bffaa1d0a3077ea023407e5e08838df","observation_id":"a330ee93-6b27-40bb-828c-ab00de61e6cf","resolution":{"observed_at":"2026-08-11T18:20:06.491131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.770210Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.770210Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:3df29f0e07093a2d6e414b2d230a4494e9ccf0413c4bc86ed33299d6be2a18a9","observation_id":"3673f7dc-e2f4-4be0-b5d5-9ff490ea24e3","resolution":{"observed_at":"2026-08-11T18:20:05.770210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.774212Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.774212Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:861ec6cdf834d83fbde91beceb0179116f64aaf4c222070b69b015fe50bd5d7b","observation_id":"4c20af34-dd99-4112-baea-7c340e824a8e","resolution":{"observed_at":"2026-08-11T18:20:05.774212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.780241Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.780241Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:5978e35bfd3c76b7a7a1ab772450ffcffe309fa0b18fc7e657ae8520fed3685d","observation_id":"dc8e882e-ceea-4e47-9d0d-cd9b464499f2","resolution":{"observed_at":"2026-08-11T18:20:05.780241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.785016Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.785016Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:baccb9292b92850a639b9e2b96e0d60bfd184002ddf2c30b42a140bb5f197a00","observation_id":"7b629542-99d9-41b9-b0cf-fc2e1a9c1078","resolution":{"observed_at":"2026-08-11T18:20:05.785016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.789683Z","title":"N.; and Welling, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.789683Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:bc9056783ab73eaf8bd94b1f1246a061c8e68869bd55d5d2c3c9dd93078fd7a8","observation_id":"0e0d55bf-bfe7-48e9-bdec-9049e11f2bfb","resolution":{"observed_at":"2026-08-11T18:20:05.789683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.803681Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.803681Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:0663d16ed677d998c21ebef462c440d393f225f446e950cab691f752400a1971","observation_id":"414deaf7-149c-4a0f-a1c7-266437f4ca56","resolution":{"observed_at":"2026-08-11T18:20:05.803681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.406836Z","title":"C.; and Pan, S","venue":null,"work_id":"fa1ba4bf-ca24-4a67-bc42-3ffba0596666","year":2023},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.809328Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:98b17d13d2883a80b6d553e45eda6370fe2f7a7c1b7b15fbea8b0e6187c13759","observation_id":"ff6e40fc-29d6-4577-9de5-7de7fafc1f61","resolution":{"observed_at":"2026-08-11T18:20:06.411358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-08-09T07:12:13.529182Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-11T18:20:05.814049Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.814049Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:be3d7a467eff2fcd7eca4b172299fd42102bb0a220648a22e83c4f46fe2c7031","observation_id":"e07bf3de-dbe5-4024-8eef-3a568da749ac","resolution":{"observed_at":"2026-08-11T18:20:05.814049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.819248Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.819248Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:37a6e25195b1efe0a7deae10ed8d71c621a7a97f3a8873d971b88f411d68701d","observation_id":"0a7288f5-9314-4459-aecf-8c2d23b49d63","resolution":{"observed_at":"2026-08-11T18:20:05.819248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.381018Z","title":null,"venue":null,"work_id":"3ad43942-8a6e-4280-84c6-51e525893013","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.823421Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:b77dfa95c0f96043113a2d43701707cde79d3512b5c8d3b8a6bd4b4260f727e0","observation_id":"08f3e431-d6a2-4def-ac53-ff276d6e7a4c","resolution":{"observed_at":"2026-08-11T18:20:06.385031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.364317Z","title":"W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; Krueger, G.; and Sutskever, I","venue":null,"work_id":"951ec76f-a692-4b0a-b1e6-273634ca1b08","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.827577Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:31e6bfcf28a1a16409b5d622d29396375808fbec619dc2ae78768cd70cdd3f68","observation_id":"40a04f9c-583e-4a8f-8ac9-18d221d4882e","resolution":{"observed_at":"2026-08-11T18:20:06.370449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.348352Z","title":null,"venue":null,"work_id":"f2436e44-3b32-4eb4-baea-5d2f3d6c5648","year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.831652Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:c3f3af02e6e7eb3273359036bf328f3b1c82f37b18e4035f96c54e61c375e806","observation_id":"157f7e48-13fa-4472-b001-3539a505b98f","resolution":{"observed_at":"2026-08-11T18:20:06.353784Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.333033Z","title":null,"venue":null,"work_id":"a8e75901-a5c9-46f8-a42a-337cdb79beee","year":2008},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.835713Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:b0f8bc37c86aeed2873216361a86dbf34463481d2af96477010e26bce654dad4","observation_id":"4851698b-90fa-4b0c-83d6-49603c5e4d22","resolution":{"observed_at":"2026-08-11T18:20:06.337960Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-11T18:20:05.840215Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.840215Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:a5b06ce04d470ae2b11ce48ada57a510f8778139a6b67e7dd6749ce29a4a7f36","observation_id":"25515764-4b9d-4d27-a704-c64ca7e4a605","resolution":{"observed_at":"2026-08-11T18:20:05.840215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.318006Z","title":null,"venue":null,"work_id":"f8234353-71d3-4e52-a44e-ac3b65b3cacf","year":2023},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.845016Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:f3a8d68cf1a60e9f75326f14410bfa66514e237331b0330559560a748a18f322","observation_id":"5232976e-c56f-4c1c-b8df-4fcbb9c4cfa0","resolution":{"observed_at":"2026-08-11T18:20:06.322429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.849304Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.849304Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:4150e0605d9641ebc2783378de02146cc17703973a4f11b3f95759b9e0226ed5","observation_id":"ed192ab4-8b50-4af4-977d-87b562f6056c","resolution":{"observed_at":"2026-08-11T18:20:05.849304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.292299Z","title":null,"venue":null,"work_id":"5076b713-7003-43ec-b6e5-337d05261697","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.853777Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:715f882c2379939385e1e702f4018b76c40540646f26fd0b4b1d334fea04a732","observation_id":"c7b1ae2b-b100-46c2-8a86-071e70a2667a","resolution":{"observed_at":"2026-08-11T18:20:06.296868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.858630Z","title":"G.; Azabou, M.; Dyer, E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.858630Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:d5c1ae9700e86476c6e25447fb45d92c1250a1eb4612795b35b6ac4a69569cbd","observation_id":"dab1b20e-7280-422c-bc58-3a3747ede77b","resolution":{"observed_at":"2026-08-11T18:20:05.858630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.863630Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.863630Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:9834edb39cb220d641027518bf2de65fcbfb85ae600bcd7fcae1218f13d62977","observation_id":"9460985d-2900-40a7-8946-29ec38aa104d","resolution":{"observed_at":"2026-08-11T18:20:05.863630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.256635Z","title":"K.; Gelly, S.; and Lucic, M","venue":null,"work_id":"384778c6-50da-4a74-a906-2b26458693ab","year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.868363Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:a88a37e07ce7cfc9b634f46c7a6f7fe4b427ecc5252759f264edc0bb0653e289","observation_id":"88a88a61-678f-4fab-a7cd-70c3cfea934a","resolution":{"observed_at":"2026-08-11T18:20:06.261636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-11T18:20:05.872948Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.872948Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:06ceba88e403f312ee18dfa18ef2eeeafcb8c1e488c6815b7050c0df157b8375","observation_id":"79092e15-6858-4435-9018-493ea7a0a38d","resolution":{"observed_at":"2026-08-11T18:20:05.872948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.878176Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.878176Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:75fdb5d1b0365bc7cb6fee6f2a9159df113aacf00eea22477ac1e6e2c81175a5","observation_id":"1f0c1392-7be0-412c-a4a3-71686286960f","resolution":{"observed_at":"2026-08-11T18:20:05.878176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.883142Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.883142Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:cba3c5145edd84ce017171fe84db43d041ebca5edca3e375123258047b6dae54","observation_id":"02938d14-a6b2-4edb-bafd-38a344c675fe","resolution":{"observed_at":"2026-08-11T18:20:05.883142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.887649Z","title":"L.; Liò, P.; Bengio, Y.; and Hjelm, R","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.887649Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:d07b1b7498983c83ec59d94f1ff575fe465d300a0f6031e281edf9edeb96be86","observation_id":"6cf3e44a-3b90-412c-b5e1-6ad0bc9ee74d","resolution":{"observed_at":"2026-08-11T18:20:05.887649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.210008Z","title":null,"venue":null,"work_id":"b86be7b7-31b0-44ca-a543-d49c7101c656","year":2023},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.892345Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:7e5d51462f44f643acede30e6aa2be55f94ecb00d9ca3287dbf2fca5c98482a3","observation_id":"18a896d7-a57c-4703-8528-c678e43d1e65","resolution":{"observed_at":"2026-08-11T18:20:06.214912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.195108Z","title":"A.; et al","venue":null,"work_id":"bbb07bc1-6a48-40b1-b029-a7dbea8d2d2c","year":1970},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.897065Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:493bcc3458114857608a3c101b1bc886a3b17abc1b333d47efb729ed635818ec","observation_id":"a7ba436e-97d5-465e-af82-f13629572700","resolution":{"observed_at":"2026-08-11T18:20:06.199130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.13149","last_updated":"2020-06-05T16:39:20Z","snapshot_observed_at":"2026-08-08T09:42:23.200888Z","submitted_at":"2020-05-27T04:21:53Z","title":"On Mutual Information in Contrastive Learning for Visual Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.13149","snapshot_observed_at":"2026-08-11T18:20:05.901676Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.901676Z"},"links":{"cited_paper":"/paper/2005.13149","citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:b80656dc3b7230a31980c52a1dfc2f6ea287d62b2aa94207ad04988fc66ad43a","observation_id":"23a30d39-5305-432c-961a-f036083e1f46","resolution":{"observed_at":"2026-08-11T18:20:05.901676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.180820Z","title":null,"venue":null,"work_id":"bd7bf41d-a4b7-47a3-be88-67696dec03c0","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.905816Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:3ecfbb31f9ef0cf22bfbf0e58efadc9c9a1faaafbf73db9ee2ebe5e9b8b8112f","observation_id":"d47f14fa-c518-4c6a-b26d-632ff9aa7f1e","resolution":{"observed_at":"2026-08-11T18:20:06.185077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.909811Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.909811Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:65593980083ac8efe921943dbaf8d51d872eaae6097f870f5bf5c3526426ede0","observation_id":"5c6ab4b9-19b5-42fb-84ec-9143f82d02ad","resolution":{"observed_at":"2026-08-11T18:20:05.909811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.914313Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.914313Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:6ef372f733e00dd517630fea344e35b4dbc5b6ea1221bd1076c4f69e95893cf5","observation_id":"890a3a61-3fe4-43f7-8bc5-76a2f7992b58","resolution":{"observed_at":"2026-08-11T18:20:05.914313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.918604Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.918604Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:6f376439e955c088fa798b18e1dd7ed706c95197d94e3c51d9e2f40dc7f4fa48","observation_id":"12c02520-3a6e-42e2-baf9-1ce819a489fa","resolution":{"observed_at":"2026-08-11T18:20:05.918604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.134077Z","title":null,"venue":null,"work_id":"08166a64-23b8-4964-949f-6a6b0ce31369","year":2022},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.922599Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:b215495c0ff310802d8f10ceb69cf21d61944e495a889a194b44bf53d40a9ce8","observation_id":"31a94358-5e99-4d31-bcd5-b2ac1d8728a0","resolution":{"observed_at":"2026-08-11T18:20:06.138890Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.118373Z","title":null,"venue":null,"work_id":"135e8d8b-f692-44b1-a2f2-8c6eb5a17391","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.926793Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:417177e8ec6a83201d1996a72e88c762150c95b5a522061c70a858b1ef1b884f","observation_id":"43a5089f-da4d-45b7-ac15-46fa81d32b56","resolution":{"observed_at":"2026-08-11T18:20:06.122875Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09929","last_updated":"2026-05-08T06:19:21Z","snapshot_observed_at":"2026-08-14T10:23:55.169437Z","submitted_at":"2024-08-19T12:07:42Z","title":"Data Augmentation of Contrastive Learning is Estimating Positive-incentive Noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09929","snapshot_observed_at":"2026-08-11T18:20:05.930759Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.930759Z"},"links":{"cited_paper":"/paper/2408.09929","citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:35cbd5512350195d745a9310dedb2550d899db060f0ec419e2b998109598fbce","observation_id":"62784d0f-6918-455c-b97c-d64461b27fdc","resolution":{"observed_at":"2026-08-11T18:20:05.930759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.935774Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.935774Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:f30f4f9182cd8917c5b5f0f64726f392d1958f4130b57a9a66f3693d60744e1c","observation_id":"2a693ccb-8e66-44ee-8715-b1fd7b952952","resolution":{"observed_at":"2026-08-11T18:20:05.935774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.091525Z","title":null,"venue":null,"work_id":"918e23f3-80f9-4ab9-9645-1d1f3ab42f15","year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.940383Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:4f529f0a95596a3a86916d4060a4ca9e3516fe569b31bd2768fa1873d3856764","observation_id":"5b275d26-8325-4f1f-80f6-62129c33e285","resolution":{"observed_at":"2026-08-11T18:20:06.096262Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:06.074859Z","title":null,"venue":null,"work_id":"84b144a9-4558-49bb-bf94-9b7205059445","year":2020},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.944915Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:3596fc403b3dff50c5eeb5349b6a786d9851d8aa33aa7d5a65aa712a76209462","observation_id":"571feecb-bceb-4f64-a25c-94a7083a38fd","resolution":{"observed_at":"2026-08-11T18:20:06.080855Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:20:05.949791Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","version":4},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T18:20:05.949791Z"},"links":{"citing_paper":"/paper/2412.08128"},"observation_digest":"sha256:0f536200a7a0c28f6f779c8b49fde616e5077812b49d38bb2df66c74f8b99165","observation_id":"b71b1f18-6e1d-4c52-ab83-8f05352cd423","resolution":{"observed_at":"2026-08-11T18:20:05.949791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.08128","last_updated":"2025-01-08T06:35:45Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T19:40:47.649659Z","submitted_at":"2024-12-11T06:31:06Z","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":44},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"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."}