{"as_of":"2026-08-19T22:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:258cef272517db4cf449f63c652d5704303bc49c078488ae592e14e1927831d2","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-15T20:15:58.877013Z","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-19T06:32:44.657259+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/2505.13650/citation-record","integrity":"/paper/2505.13650/integrity","json":"/paper/2505.13650/citation-record.json","paper":"/paper/2505.13650"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:15:59.304767Z","title":"Information network or social network? the structure of the twitter follow graph,","venue":null,"work_id":"c37fd73b-2c91-4477-a606-63173b2a40d5","year":2014},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.716093Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:6cecb8faf04f82ad8a257e99ad79302ca6eb11c9eda1d4f9d0732a05fe2b3b1d","observation_id":"630b155e-7f73-41f5-af30-14f7423d7b3e","resolution":{"observed_at":"2026-08-15T20:15:59.308329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.294526Z","title":"Protein function prediction via graph ker- nels,","venue":null,"work_id":"40a30723-ffd6-4b48-9ff5-c478c557067f","year":2005},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.720295Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:8beedad7e7395aca8e762aebfc9d0afe1668eaf3485e738301ad83128f5f42ec","observation_id":"fd529c9e-a56a-4c29-b4fc-34bc81d1b20f","resolution":{"observed_at":"2026-08-15T20:15:59.298075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.283757Z","title":"Knowledge graphs,","venue":null,"work_id":"70938f4e-566d-4bd0-8918-793aa51c45f0","year":2021},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.723580Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:d7c3a6110cc3e1a08a01b6541979833799fbd459b228a87310e52e040f4606d6","observation_id":"d2aa5e11-7f8e-4f35-9706-9a9e85e73dcb","resolution":{"observed_at":"2026-08-15T20:15:59.287582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.273339Z","title":"Graph neural networks for social recommendation,","venue":null,"work_id":"397cbc3f-b36f-4ccb-ac32-a49fcf3db378","year":2019},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.727465Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:dd4d7f1e1d67a2205f1ae6233f19beb4ac6be6ca3f68a8601f4d7b851fc9154e","observation_id":"3be10ffb-ffd8-4dd8-a697-ff8c749bc25e","resolution":{"observed_at":"2026-08-15T20:15:59.276911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:58.731388Z","title":"Graph con- trastive learning with augmentations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.731388Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:aaeb649a5b1466fdeccdc28014e207b092a1b90cfb942d8f54539edaafb4f84c","observation_id":"affa1d86-42e5-4117-bbed-fda062d096e2","resolution":{"observed_at":"2026-08-15T20:15:58.731388Z","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-15T20:15:58.735508Z","title":"Contrastive multi-view represen- tation learning on graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.735508Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:9e6a3c503da000c4deb811fc8ecf8645c788972f259c2afac5fb4066976f42fa","observation_id":"94b86fb8-f783-406a-bbe0-ef91a8423b2e","resolution":{"observed_at":"2026-08-15T20:15:58.735508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-15T20:15:58.739423Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.739423Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:8b91539b460882930d09a924df5eb502658997953606f3f216c4f1cb15015367","observation_id":"ed22ad1e-755b-4baf-b554-a1fcd030fecb","resolution":{"observed_at":"2026-08-15T20:15:58.739423Z","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-15T20:15:58.744042Z","title":"Simgrace: A simple framework for graph contrastive learning without data augmentation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.744042Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:854832e61233ac480ae1b5c9f10bd0f9a82ea88566debf247d1e7bfb6082590b","observation_id":"559896ae-88e9-41f7-9bbd-40f77cfdf001","resolution":{"observed_at":"2026-08-15T20:15:58.744042Z","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-15T20:15:59.242584Z","title":"Graph contrastive learning automated,","venue":null,"work_id":"d86da0c3-b18a-4457-bf8b-31c2ccbbcc25","year":2021},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.748450Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:db820add0ddfb3c812474dcc585587b91480aeef133621c454a8895fb850be7c","observation_id":"fbd59bbb-59b8-4b7c-92ff-0abac2f876ee","resolution":{"observed_at":"2026-08-15T20:15:59.246347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.231148Z","title":"Adversarial graph augmentation to improve graph contrastive learning,","venue":null,"work_id":"ad76e28c-ccd9-478e-9202-34e7f1601d1b","year":2021},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.752074Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:43eb9071082d930ed0ba6c2f352f349deff8371249ffcaaf301c2f29a7f677c3","observation_id":"001c4a83-86c2-414b-ad89-06ca10389a77","resolution":{"observed_at":"2026-08-15T20:15:59.234974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.219688Z","title":"Autogcl: Automated graph contrastive learning via learnable view generators,","venue":null,"work_id":"a20a4c00-e823-4d48-b41c-320b34babb53","year":2022},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.755847Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:efd45bcfda42b87b2a5bacb00f87e08ce0d4994ccffb13c3639da5a112aaa357","observation_id":"53e67b7f-ebb4-4550-b58b-8c8c8dfdaa1c","resolution":{"observed_at":"2026-08-15T20:15:59.223327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.209010Z","title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity,","venue":null,"work_id":"ece72a82-7273-4ff3-b9a3-911499c98b50","year":1991},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.759401Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:15de8a41d1f02632eb41621c0cc43bdffb2ce994212eee6ae8fcc0c58e3b63d7","observation_id":"78786fee-cd6f-4626-a89c-9af6ae6108a7","resolution":{"observed_at":"2026-08-15T20:15:59.212990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:58.763283Z","title":"Momentum contrast for unsupervised visual representation learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.763283Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:93700c9b1ecdb46b686202357299806c20887bdc07da30cd8c0218d25a13af9b","observation_id":"5a21abe0-9e23-499e-820c-45741dd006e5","resolution":{"observed_at":"2026-08-15T20:15:58.763283Z","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-15T20:15:58.766678Z","title":"A simple framework for contrastive learning of visual representations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.766678Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:4745d0e84b7d67f4a5ecef52d9642967e63e5f74ad0f03977605fee3fdcccc36","observation_id":"409cd98a-7126-43b4-a8e2-8b1b0a26ca23","resolution":{"observed_at":"2026-08-15T20:15:58.766678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T20:15:58.770565Z","title":"Representation learning with contrastive predictive coding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.770565Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ff08b6493e1d5d4f23e6c5f9cfb7a75ca4b53cbdca3d04b16abf97b9f8930bc2","observation_id":"4550a5a7-4556-42c6-82c5-f978bb2864f5","resolution":{"observed_at":"2026-08-15T20:15:58.770565Z","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-15T20:15:58.774110Z","title":"A global geometric framework for nonlinear dimensionality reduction,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.774110Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:3b034e9a38b86c6fefcaad11c2ba3aa17f0543cf7cc5c91e6341628a9639430e","observation_id":"6f315081-698d-4b16-ad77-912f4028d2d3","resolution":{"observed_at":"2026-08-15T20:15:58.774110Z","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-15T20:15:58.777411Z","title":"Representation learning: A review and new perspectives,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.777411Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:7e9f5ce7f9f0b90194e9938b1a7b75f8689598dc042e53c59706b62041f22f04","observation_id":"2e8948c1-dbc0-4180-ba10-94c32ff701eb","resolution":{"observed_at":"2026-08-15T20:15:58.777411Z","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-15T20:15:59.171403Z","title":"Manifold structure in graph embeddings,","venue":null,"work_id":"78003c58-7857-4198-b92f-eae04e2b20a4","year":2020},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.781064Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:85d70073b26c1fcce8fd77e934047599df2b581c590a1a51510d1fcf18839195","observation_id":"ff01ef2b-d24a-4588-a937-76f2e4ae1e4f","resolution":{"observed_at":"2026-08-15T20:15:59.175281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05225","last_updated":"2025-06-06T22:52:34Z","snapshot_observed_at":"2026-08-18T22:54:29.930881Z","submitted_at":"2024-06-07T19:25:02Z","title":"A Manifold Perspective on the Statistical Generalization of Graph Neural Networks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05225","snapshot_observed_at":"2026-08-15T20:15:58.784808Z","title":"A manifold perspective on the statistical generalization of graph neural networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.784808Z"},"links":{"cited_paper":"/paper/2406.05225","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:19ed98230e6a8348e829ab4c2f20a4d6ae4c4c0e3e73bc5cda9d9f6f910e3d0b","observation_id":"61a00f3c-7299-47c4-aae1-769543a83b74","resolution":{"observed_at":"2026-08-15T20:15:58.784808Z","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-15T20:15:59.159956Z","title":"An experimental study of the decay of temperature fluctuations in grid-generated turbulence,","venue":null,"work_id":"49985d88-dc13-48b8-b2a6-78b8823fec0b","year":1978},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.788458Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:420471759787c368f3d4344a2e89d14e470b868f2790689ef9d22bd0e0641f65","observation_id":"22d3c38e-02b0-41c7-98e3-683cea1382ba","resolution":{"observed_at":"2026-08-15T20:15:59.163915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:58.791906Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.791906Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:d0fdedfa3e5447e936380f1bab4f0b25862acec33e2659e5545ef4bfdf6a456d","observation_id":"77954573-45c7-42be-a245-b414e540c759","resolution":{"observed_at":"2026-08-15T20:15:58.791906Z","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-15T20:15:58.795925Z","title":"On upstream differencing and godunov-type schemes for hyperbolic conservation laws,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.795925Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:635ffe95a6840a3d2fbe2f4251480bfa680f653aa3e36246e6864dae36d527b5","observation_id":"44892ae0-6e7a-4ef3-bf47-b9125607bec1","resolution":{"observed_at":"2026-08-15T20:15:58.795925Z","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-15T20:15:59.136678Z","title":"Statistical guarantees for the em algorithm: From population to sample-based analysis,","venue":null,"work_id":"48a2d67c-1c2d-4b79-8570-1b91901f08fd","year":2017},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.799425Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:4179c8409e31cd6081f34273977c8f5286ac91766a0a04726293361c974fa149","observation_id":"6516ef19-acc2-487e-8785-c2be0365e240","resolution":{"observed_at":"2026-08-15T20:15:59.140635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.124846Z","title":"Weakly- and semi-supervised learning of a deep convolutional network for semantic image segmentation,","venue":null,"work_id":"e4be72fa-b3f4-4cb8-9572-d07f21865148","year":2015},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.802719Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:94df0d16d131de0bb2bcb81699e2856a3181fa4cc7d333e686d19d44bc01f955","observation_id":"2839ddc8-190f-4d83-879e-d676ebdb1397","resolution":{"observed_at":"2026-08-15T20:15:59.128540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.112745Z","title":"High-dimensional variance- reduced stochastic gradient expectation-maximization algorithm,","venue":null,"work_id":"5efce99d-649f-4afc-ae8f-a25cd75a542d","year":2017},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.806028Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:fb5c2c4d437973723ce0b883329638481edff1dd710c78956372c8d82c8350ab","observation_id":"1f455da2-d9c5-4f2d-b4cd-d9497692bd29","resolution":{"observed_at":"2026-08-15T20:15:59.116988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08663","last_updated":"2020-07-16T21:46:33Z","snapshot_observed_at":"2026-08-13T19:42:12.787378Z","submitted_at":"2020-07-16T21:46:33Z","title":"TUDataset: A collection of benchmark datasets for learning with graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08663","snapshot_observed_at":"2026-08-15T20:15:58.809475Z","title":"Tudataset: A collection of benchmark datasets for learning with graphs,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.809475Z"},"links":{"cited_paper":"/paper/2007.08663","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:7d8533a1103631be65503c27b35c805bfd461d0d0ae0f68e5c3d6c6697d5558f","observation_id":"2796dd6c-8fec-493f-8ae9-2727bcddbd3b","resolution":{"observed_at":"2026-08-15T20:15:58.809475Z","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-15T20:15:58.813285Z","title":"Pytorch: An imperative style, high-performance deep learning library,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.813285Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:a5fac7daaaee41eb8fccd78425f2d818c988069ac6fc9317e91f5ceacf42f63d","observation_id":"96385c8c-db9e-4d5e-9425-f81048906662","resolution":{"observed_at":"2026-08-15T20:15:58.813285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-15T20:15:58.816955Z","title":"Fast graph representation learning with pytorch geometric,","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.816955Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ec3f050c2421fbd8125c195a1b18033fe0f44820b6c3eef65218fc8e20519d69","observation_id":"afa4f420-ca07-4da9-82a2-f59f389d0c27","resolution":{"observed_at":"2026-08-15T20:15:58.816955Z","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-15T20:15:59.095667Z","title":"Learning convolutional neural networks for graphs,","venue":null,"work_id":"4a3bf3ca-3644-4c5d-8a93-fc7aa5d53b29","year":2016},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.822107Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:0807884ef701ea892ed10f75301eb4c3552574b920a9da23a6e6dc0eb91ba3ca","observation_id":"5cfe4431-bcd2-483e-930b-f9e63c6a1dff","resolution":{"observed_at":"2026-08-15T20:15:59.099319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.084220Z","title":"Support vector machines for classifi- cation and regression,","venue":null,"work_id":"77631ff8-4698-4ffa-ad51-9947fef8a500","year":2010},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.825257Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ccb827a2d903fef43dc9ebe51099f04ea8eac5108534c41ffa08818d55dd3162","observation_id":"9bf1a8cc-d84e-4498-b545-16aaa9357b80","resolution":{"observed_at":"2026-08-15T20:15:59.087948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.072705Z","title":"Efficient graphlet kernels for large graph comparison,","venue":null,"work_id":"bdc5cac1-9f6d-4535-afae-441549f76c8a","year":2009},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.828865Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ef1b5c7a19a7c870e590b3222af2b305a46290b462eee630610a927a1c8c0379","observation_id":"ff7b8194-da6f-44b2-9eb9-55044f4e2bb5","resolution":{"observed_at":"2026-08-15T20:15:59.076644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:59.060969Z","title":"Weisfeiler-lehman graph kernels","venue":null,"work_id":"ecbb6b0e-95a7-4a07-bbc6-ad8b437666ed","year":2011},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.832225Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:824af63ca18200003d1157ccff8ff6076954c59ca5f1fa439f0d05e2ace0115d","observation_id":"55638569-5e3f-4f59-832c-d3e0bfad3ad1","resolution":{"observed_at":"2026-08-15T20:15:59.065326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:58.835721Z","title":"Deep graph kernels,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.835721Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ab105f7a64528dad25b06b3aa3f514cf1ae798e2fc2b7627a8336eee10d4f1ab","observation_id":"ad647cb0-f44d-435e-ad3b-4284448da87d","resolution":{"observed_at":"2026-08-15T20:15:58.835721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T20:15:58.838888Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.838888Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:883b9765d74049eb257fc92a849de43bd8edadebb94356ff876b9a657060bf92","observation_id":"2ce90622-e412-431c-a24d-7d0016f83a9a","resolution":{"observed_at":"2026-08-15T20:15:58.838888Z","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-15T20:15:58.842977Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.842977Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:f2b0b42ca2b6417de0f3584c061f0c21d414bb0624c7fb6933c39b7f0e874fff","observation_id":"5cddc172-1441-4ead-ae72-fcce11addfca","resolution":{"observed_at":"2026-08-15T20:15:58.842977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-15T20:15:58.847243Z","title":"How powerful are graph neural networks?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.847243Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:91a03c144da499042faf65b110ffbe55a87459eaefabaeebf3f4c549d8167732","observation_id":"de4d36ce-e897-4cf9-b202-8d613d65dc77","resolution":{"observed_at":"2026-08-15T20:15:58.847243Z","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-15T20:15:58.851303Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.851303Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ec2c1039c4ca9da3c12da9cfacd1352d63b08d96362bafd7256aaf7a8894a930","observation_id":"a5f4d316-bc69-4f92-b2ab-6a3e95cabfec","resolution":{"observed_at":"2026-08-15T20:15:58.851303Z","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-15T20:15:58.854748Z","title":"node2vec: Scalable feature learning for networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.854748Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:854b0b0434d392512218cb729ed014195d3b4c719288d43b5cbc38d57c574c12","observation_id":"c3e84393-6c58-4d68-b71f-50f7d1613178","resolution":{"observed_at":"2026-08-15T20:15:58.854748Z","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-15T20:15:59.023476Z","title":"Sub2vec: Feature learning for subgraphs,","venue":null,"work_id":"d2e45842-dc5b-4591-a3e6-523c6f31f051","year":2018},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.858856Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:38c84e11e67bbee7d45f8a398935811ad5ea17f2aa71d105d26401b4e5e59345","observation_id":"dda46fa1-3e48-4cdd-8226-5b61cf4cefe9","resolution":{"observed_at":"2026-08-15T20:15:59.027305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.05005","last_updated":"2017-07-17T05:09:03Z","snapshot_observed_at":"2026-08-14T20:47:18.548060Z","submitted_at":"2017-07-17T05:09:03Z","title":"graph2vec: Learning Distributed Representations of Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.05005","snapshot_observed_at":"2026-08-15T20:15:58.862209Z","title":"graph2vec: Learning distributed representations of graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.862209Z"},"links":{"cited_paper":"/paper/1707.05005","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:90cd8afea721d1ec881655e522f6c62d446665b569fc7702330c42aa2a14533e","observation_id":"2b691a89-e02f-490c-9b14-29b2d0bf857e","resolution":{"observed_at":"2026-08-15T20:15:58.862209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-19T02:35:40.814401Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-15T20:15:58.866011Z","title":"A fair compari- son of graph neural networks for graph classification,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.866011Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:ba534dffd368c6858dfddca2ac068ec9681e5e2e2623a36f6156616ab7516b63","observation_id":"c08c5ba7-8cd9-4f0c-afd8-714495ce4714","resolution":{"observed_at":"2026-08-15T20:15:58.866011Z","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-15T20:15:59.012203Z","title":"Autogcl github repository","venue":null,"work_id":"66025ebf-609c-49e6-9200-a7c1528f200f","year":null},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.869715Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:52c97076d9cc1ecbe43a648e2de232154c5668ae5259145e5e2b2b181cff7a7d","observation_id":"52d5361d-4f26-4d72-a951-6950c3fae754","resolution":{"observed_at":"2026-08-15T20:15:59.015844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:58.997765Z","title":"I-divergence geometry of probability distributions and min- imization problems,","venue":null,"work_id":"fba6071e-0224-4837-9e46-8c4020b2d16e","year":1975},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.873320Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:5a61725c829969b34ef2e2c49caddfb340d868a90ae55d3cf88b0e0547dc0d2d","observation_id":"ba03ac74-e8c5-4dc6-a62e-fd2eda5e4b0c","resolution":{"observed_at":"2026-08-15T20:15:59.003982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T20:15:58.877013Z","title":"Markov processes over denumerable products of spaces, describing large systems of automata,","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.877013Z"},"links":{"citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:a55219770d6d6528e9a7719983c857ad3a878812278381fc20f497a68d4acbb6","observation_id":"df19d90d-6c00-47bc-ac6e-a43bb39869c5","resolution":{"observed_at":"2026-08-15T20:15:58.877013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":20},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2505.13650."}