{"as_of":"2026-08-18T10:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4273a2f9e2d03686794c1ce12f78756992b0172180ebf84bf57b349447465208","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:19:31.137340Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.10307/citation-record","integrity":"/paper/2505.10307/integrity","json":"/paper/2505.10307/citation-record.json","paper":"/paper/2505.10307"},"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-15T21:19:31.805665Z","title":"An introduction to single-user information theory","venue":null,"work_id":"3aa67524-3ee1-438c-9217-33aa7eba374f","year":2018},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.928414Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:8c321d2ebac48040129cce50c5c704905dbe3fda2dc2fadf68f7c4333a8ca923","observation_id":"02d87a09-c7ee-4f3b-9cc6-8419b1eea94c","resolution":{"observed_at":"2026-08-15T21:19:31.809678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.760501Z","title":"Enhancing contrastive learning on graphs with node similarity","venue":null,"work_id":"3fbc6ef3-f18b-49a7-917f-2ddb9f568e6a","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.944593Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:99e5541c672d7720ecf9e99064b48f4165399390560bea1c0ec123d5374f4dbf","observation_id":"78136f84-e4c5-4c70-8391-89c2b1052242","resolution":{"observed_at":"2026-08-15T21:19:31.765737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.736300Z","title":"Neighborhood-based hard negative min- ing for sequential recommendation","venue":null,"work_id":"c9cd58b9-c400-4cbd-92e9-7d152194ac6a","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.952809Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:68bd3a0a75c9f8285de7991d9856898db5bf0e2d7ca6716da0764314245d733a","observation_id":"0d7b25ff-462e-45b9-a822-c7ea48776a6e","resolution":{"observed_at":"2026-08-15T21:19:31.741205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.684807Z","title":"Graph representa- tion learning","venue":null,"work_id":"a8080596-096d-4bff-a31f-b32fe31cf8f6","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.968515Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:6bfa4cfd832e1a87f6984380ca73af2a4dc607b4a1d2d29c262ad915e6f61862","observation_id":"273c1bdf-f766-443f-b2b7-1248f2c6380c","resolution":{"observed_at":"2026-08-15T21:19:31.689307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.673225Z","title":"Topology-aware debiased self-supervised graph learning for recommendation","venue":null,"work_id":"98ca295f-c2c4-4faf-9032-2dd0c695bfb6","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.972295Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:4fb32674c5db53b0e2d6becb94653bfe9f1d622b9bd4b4df50cd77d286314bf7","observation_id":"6e208a7c-e223-40e2-8c96-054f7cf18c48","resolution":{"observed_at":"2026-08-15T21:19:31.677089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.659436Z","title":"Towards expansive and adaptive hard negative mining: Graph con- trastive learning via subspace preserving","venue":null,"work_id":"8daf117e-4e21-4af9-bd49-0f71d3683197","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.975929Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:47a3edbf534f20ff0738308ea185d0c75e900bba74d38afca273bc586ac1982e","observation_id":"3ab2dc46-e548-4820-bb18-6ede1dc835e2","resolution":{"observed_at":"2026-08-15T21:19:31.664198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.646569Z","title":"Contrastive multi-view repre- sentation learning on graphs","venue":null,"work_id":"e43d5528-e020-4787-9e8c-c0f9e521f21d","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.979559Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:86596cf165a98eef03d923e3b2c0f0bbfe1eaf2867f5e2891ba66c986c80f9ed","observation_id":"266248f7-3b49-44ac-b5df-af535a6e2023","resolution":{"observed_at":"2026-08-15T21:19:31.651263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04051","last_updated":"2021-06-08T02:07:21Z","snapshot_observed_at":"2026-08-18T04:29:11.129321Z","submitted_at":"2021-06-08T02:07:21Z","title":"Graph-MLP: Node Classification without Message Passing in Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04051","snapshot_observed_at":"2026-08-15T21:19:30.983769Z","title":"Graph-mlp: Node classification without message passing in graph","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.983769Z"},"links":{"cited_paper":"/paper/2106.04051","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:04c814099b66514a7cb17b1c22b2348d70ce599d33cc8171ea5c45bfca1ff9e3","observation_id":"c2caa200-6e34-48f8-8878-4ec723e742c1","resolution":{"observed_at":"2026-08-15T21:19:30.983769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-15T21:19:30.991483Z","title":"Variational graph auto-encoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.991483Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:c3cf1dab7032830b486b6b576bad9a97f899c31dc9c19b5c43942ce16646baed","observation_id":"b65db685-9267-4c22-8d92-1995ab241337","resolution":{"observed_at":"2026-08-15T21:19:30.991483Z","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-15T21:19:31.614702Z","title":"Homogcl: Rethinking ho- mophily in graph contrastive learning","venue":null,"work_id":"cc039681-91b1-4a1b-86cf-fcfa18c59d97","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.998928Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:411b6fe5183a1bcaa4edb6f9a2801595253bebc77466f3394ab0a1723637026c","observation_id":"15244c3a-1aa5-40bc-af33-83ac682c9790","resolution":{"observed_at":"2026-08-15T21:19:31.618956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.601662Z","title":"Spectral augmentation for self-supervised learning on graphs","venue":null,"work_id":"15ce398b-201f-43ae-9d94-d44d13602f20","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.002555Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:61acceeba6ae203f3786ac7d1638abda97a6c6c5d691c7a43140507ad55c00f0","observation_id":"899ad543-8442-4b2a-8d85-00ba9e9fd6c3","resolution":{"observed_at":"2026-08-15T21:19:31.607006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.588930Z","title":"Prototypical graph contrastive learning","venue":null,"work_id":"99f13cff-e370-42dc-ae56-390ab6e4a7b5","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.006099Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:43b20b1f12c22bb407f30c3e9733bcf2526bae0801b9a842949a361ecda42c60","observation_id":"0d3e2f70-5452-48dd-b337-80f5f1484295","resolution":{"observed_at":"2026-08-15T21:19:31.593562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.575934Z","title":"B2-sampling: Fusing balanced and biased sampling for graph contrastive learning","venue":null,"work_id":"f73f93f4-3b52-4fa5-9d33-df1bce286c13","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.009634Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:96b92a27cfc26361efe7abdf6014c33fac7fc3d07e4d050b478370f4d55ad022","observation_id":"bb93618b-81ea-47ae-8591-00f00af217cb","resolution":{"observed_at":"2026-08-15T21:19:31.580714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.562911Z","title":"Seeking false hard negatives for graph contrastive learning","venue":null,"work_id":"4cf2e7d8-3e43-4354-b5e3-b4433547d5c5","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.013175Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:e02c3a340a6a47f134cf591e8757257c7ff2e3060132c68b846d0d5414e87d2c","observation_id":"c9fb733d-3d14-42b7-b615-45fa29a5f20d","resolution":{"observed_at":"2026-08-15T21:19:31.567734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.016817Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.016817Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:9c0ded083c117d7d9885bf52474340d632ad300a85a14c85b94e25f4ebcf4b5f","observation_id":"cbfe3cbc-1ce1-4be9-bf9d-1679f09c3373","resolution":{"observed_at":"2026-08-15T21:19:31.016817Z","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-15T21:19:31.549853Z","title":"Estimating divergence functionals and the likelihood ratio by convex risk min- imization","venue":null,"work_id":"f9070c49-0954-49bf-b759-c27377a72917","year":2010},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.020858Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:47b803fd5efa2ebce077dd875e5cc18b148f3a7c37e7acb464705f6798005938","observation_id":"f8d5076a-0c57-459f-b218-a77d628e87bf","resolution":{"observed_at":"2026-08-15T21:19:31.554646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.523136Z","title":"Graph representation learning via graphical mutual information maximization","venue":null,"work_id":"7aa3ae46-5cc3-457a-9acb-481a896ab30d","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.027694Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:a479573b0f9378325aceffc0f684a2dc461936625360500b6af6faa235df816a","observation_id":"2edaee24-c566-4458-be60-54771c448424","resolution":{"observed_at":"2026-08-15T21:19:31.527578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.031334Z","title":"Deepwalk: Online learning of social repre- sentations","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.031334Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:de6e3466bb1976d71f1965e2551ba9d09d8298a10414b3ae638f8b123ce23d74","observation_id":"bc5538c7-a6d1-4820-aa9d-599aba4c6744","resolution":{"observed_at":"2026-08-15T21:19:31.031334Z","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-15T21:19:31.481024Z","title":"Dropedge: Towards deep graph con- volutional networks on node classification","venue":null,"work_id":"3017f7f7-8574-438e-a0a7-984515a5f46d","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.042443Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:94976c07a5f445927d4fe92134679d84f60422eb3df09a2361a8d4b91cb6779c","observation_id":"7bb4075f-acfc-4192-a6d8-41e93eca3908","resolution":{"observed_at":"2026-08-15T21:19:31.485472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.469941Z","title":"Pitfalls of graph neural network evalu- ation","venue":null,"work_id":"5c400407-1a26-4859-be36-dfb7711fb37d","year":2018},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.046074Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:1d041452ab21c117763bd3de0c8c1a65056b485f12d289df778e9ac82f565e00","observation_id":"c1e0fa7d-32b3-4a85-8190-e76933551ba0","resolution":{"observed_at":"2026-08-15T21:19:31.473740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.457761Z","title":"Properties of the hubert- arable adjusted rand index","venue":null,"work_id":"b7f8b358-b3f2-47e4-8aa8-a69a1a8a5ac5","year":2004},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.049687Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:10870776730459538777c16e12338438a96b8ea24e0877ce093cb6c5051e83d7","observation_id":"2a870386-bab5-43fd-a5ca-ad8d551cf949","resolution":{"observed_at":"2026-08-15T21:19:31.461758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.431790Z","title":"Adversarial graph augmentation to im- prove graph contrastive learning","venue":null,"work_id":"6e6c2a43-89a0-4244-baa6-24c2e8c5e008","year":2021},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.057744Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:00d9fde875d7fe0ae81cde92631dd2d0aa7b7992532481ab22542420e91de6ce","observation_id":"d78aae0b-526f-4f60-810f-3ffb5aa37585","resolution":{"observed_at":"2026-08-15T21:19:31.435362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.420540Z","title":"Bootstrapped representa- tion learning on graphs","venue":null,"work_id":"4b076a44-a2a7-47d8-b0cf-b77054958ba4","year":2021},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.061537Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:103da75ac8e758199fe84cdc68eb17434e990868689e7cba4ead062bc9bedf94","observation_id":"985f55af-bcf3-46da-88db-51069b5fffba","resolution":{"observed_at":"2026-08-15T21:19:31.424361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.408486Z","title":"Large- scale representation learning on graphs via bootstrapping","venue":null,"work_id":"70ac5c12-289d-4584-af29-a58049f54708","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.065485Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:4cc2bcf04fefe343dd9a8e439818b1dcdab7481cb9a03dbdf26952d5c447343f","observation_id":"43346667-629a-46fc-bb0a-729469f07808","resolution":{"observed_at":"2026-08-15T21:19:31.412918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.069240Z","title":"Visualizing data using t-sne.Journal of machine learning research, 9(11),","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.069240Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:22c4286d2db88b95930122adc12903c1749d01faa034ca346b4d2d37f5a6d415","observation_id":"333f29c5-73b6-4c7c-84df-110047c369db","resolution":{"observed_at":"2026-08-15T21:19:31.069240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10341","last_updated":"2018-12-21T15:44:59Z","snapshot_observed_at":"2026-08-14T18:22:57.330140Z","submitted_at":"2018-09-27T04:53:24Z","title":"Deep Graph Infomax","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10341","snapshot_observed_at":"2026-08-15T21:19:31.076973Z","title":"Deep graph infomax","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.076973Z"},"links":{"cited_paper":"/paper/1809.10341","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:3cb101414a574f1ed7159dc651a8953b73f8dfe64fec77d3fc9bfbe057bd94b3","observation_id":"5029313c-d9ec-4341-8aad-201f35d423fd","resolution":{"observed_at":"2026-08-15T21:19:31.076973Z","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-15T21:19:31.390766Z","title":"Boosting graph contrastive learning via adaptive sampling","venue":null,"work_id":"24bd0088-6648-4894-821c-d6f9bc6e287f","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.081014Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:11cafe552e0e31ffd6fdd3b772b8a59c45ed78304adb6a2f51bc24ebd36406be","observation_id":"b4fa1d67-2964-4854-8407-d1d26b85c262","resolution":{"observed_at":"2026-08-15T21:19:31.394671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.03622","last_updated":"2022-04-20T22:07:18Z","snapshot_observed_at":"2026-08-16T19:15:07.300661Z","submitted_at":"2020-10-07T19:43:55Z","title":"Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Data","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.03622","snapshot_observed_at":"2026-08-15T21:19:31.085053Z","title":"Theoretical analysis of self-training with deep networks on unlabeled data","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.085053Z"},"links":{"cited_paper":"/paper/2010.03622","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:7f65f7d2904d17bf699f7514a250e95f7af24e1ac9bd7f0e5ba21e9ebf1107c6","observation_id":"ce60dcd4-281a-4461-a69e-74785fdea39b","resolution":{"observed_at":"2026-08-15T21:19:31.085053Z","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-15T21:19:31.377892Z","title":"Graph contrastive learning via interventional view generation","venue":null,"work_id":"12d3ae24-6395-44d8-b7de-54e64b3732e5","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.089232Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:c74fedd3431accb342a0903b112c07f176e8917ce4a76d44e2975aab8a1c43ca","observation_id":"8485c75c-1809-4d52-82b6-e38f2f494e8b","resolution":{"observed_at":"2026-08-15T21:19:31.382933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.366815Z","title":"Progcl: Rethinking hard nega- tive mining in graph contrastive learning","venue":null,"work_id":"b073f693-c373-4876-aa5c-c6cb4c9bb9e9","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.093414Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:108d0ddc5854d2a95121cca846394f9f7f7e16ad222fe1ae4603cae552d25627","observation_id":"9c9dfc5e-5548-474f-8f68-c386572e8969","resolution":{"observed_at":"2026-08-15T21:19:31.370862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.097286Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.097286Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:e4c11301db9d09db88954e45fce0ca1898a4f2bbed32efe39378dd89d92db7d4","observation_id":"cd1bc828-8b30-4c1e-ab7a-1d65bd7e596a","resolution":{"observed_at":"2026-08-15T21:19:31.097286Z","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-15T21:19:31.349039Z","title":"Region or global? a principle for negative sampling in graph-based recommendation","venue":null,"work_id":"c627ac86-0747-49ff-9c78-4ce331e61d23","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.100758Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:f1adedf956919438ce5316ff8fd20d4f8ad83caa5d7f095ffcc80723bbd85e8a","observation_id":"1fa6fbb0-44d8-44ed-b7ef-90da03f9615c","resolution":{"observed_at":"2026-08-15T21:19:31.352659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.336148Z","title":"Graph con- trastive learning with augmentations","venue":null,"work_id":"ddf7ad8c-f92c-4277-a427-2f032c9e7a76","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.104546Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:751171d76fceba45ad8e8c7c2990322217b6394311f2cb6a8afb2d0f27fbfa53","observation_id":"2ba83bd2-a6bc-45c9-a221-93993e761f7a","resolution":{"observed_at":"2026-08-15T21:19:31.341528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16726","last_updated":"2024-07-23T13:55:33Z","snapshot_observed_at":"2026-08-16T13:31:46.074750Z","submitted_at":"2024-07-23T13:55:33Z","title":"Topology Reorganized Graph Contrastive Learning with Mitigating Semantic Drift","version":1},"cited_work":{"arxiv_id":"2407.16726","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.16726","snapshot_observed_at":"2026-08-15T21:19:31.179262Z","title":"Topology Reorganized Graph Contrastive Learning with Mitigating Semantic Drift","venue":"cs.LG","work_id":"5814a65e-9061-48a0-b22c-6ac8d0b1e167","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.107993Z"},"links":{"cited_paper":"/paper/2407.16726","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:78f294986d95f504756195947616b91eaf475f923e4749fb9e660d0b1c74838b","observation_id":"3a7946b7-9860-4bf6-b40e-ae7bf73b2de4","resolution":{"observed_at":"2026-08-15T21:19:31.185316Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.324807Z","title":"From canonical correlation analysis to self-supervised graph neural networks","venue":null,"work_id":"6a25cf10-2d94-4a98-9c37-be55812622b2","year":2021},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.112078Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:9305986207f9e54ab30256a97e2a95a75338e6dfa605d6901fdd32e7ab5a7754","observation_id":"99c995b1-68d7-4186-9b7c-ebc0e6dd2d1c","resolution":{"observed_at":"2026-08-15T21:19:31.328881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04604","last_updated":"2022-12-08T23:36:00Z","snapshot_observed_at":"2026-08-16T16:09:54.991364Z","submitted_at":"2022-12-08T23:36:00Z","title":"Localized Contrastive Learning on Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04604","snapshot_observed_at":"2026-08-15T21:19:31.115573Z","title":"Lo- calized contrastive learning on graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.115573Z"},"links":{"cited_paper":"/paper/2212.04604","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:a541d07fb5b2a0d00f4646dfc6b0281b28dba054f5b287864aa981a6643d1155","observation_id":"00161c8d-3df6-4ff1-9265-1bb578d10b1a","resolution":{"observed_at":"2026-08-15T21:19:31.115573Z","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-15T21:19:31.313081Z","title":"Empowering collabo- rative filtering with principled adversarial contrastive loss","venue":null,"work_id":"28160c55-b446-480a-b7bb-db73bc0c385e","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.119373Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:174ab3f40b3773b48b0030b44076a0bac15b5931900b3f88e6d19ee4c06a6198","observation_id":"a8f1f57a-bc95-4501-9afe-d6cfc223616a","resolution":{"observed_at":"2026-08-15T21:19:31.317096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.301268Z","title":"Deep graph contrastive representation learning","venue":null,"work_id":"77b18afb-7a48-4900-aa36-eb5987a74e5a","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.123016Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:6a416b8a8ce4f88404e188b870e2feec1ef322f3c2e51b0c1c07b7c725c3e73f","observation_id":"86da4851-54b1-4f0c-821c-dfa20bfc12cc","resolution":{"observed_at":"2026-08-15T21:19:31.305041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.289566Z","title":"Graph contrastive learning with adaptive augmentation","venue":null,"work_id":"9493430c-b150-4fcb-802e-3d6e9e6db532","year":2021},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.126928Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:367c15e681deb5b00f25dc086c8d13f4b6ca0b435f3b755b1b3f80c905119789","observation_id":"c901bb6d-b968-40d1-b3e3-7bc0626c8015","resolution":{"observed_at":"2026-08-15T21:19:31.293438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.279317Z","title":"Graph con- trastive learning reimagined: Exploring universality","venue":null,"work_id":"70877107-e284-4ce8-8626-1b17cad41109","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.130345Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:b234b7e857bce0cb6889424abeeec825ef2fbbf1e7ac1a2e0a00708858537b43","observation_id":"427ff980-1357-462f-b6b7-ed7d914547d4","resolution":{"observed_at":"2026-08-15T21:19:31.282661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.269205Z","title":", 2020a; Huynh et al","venue":null,"work_id":"77231c96-1f75-4fef-b704-4957a3e53572","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.133801Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:39ce6f7a03c8994a20df95e977a13489e7db51836cc1c80ebc21141c185506fb","observation_id":"d685c5ce-b0fa-4b00-9380-e01229cfa321","resolution":{"observed_at":"2026-08-15T21:19:31.272761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.258459Z","title":"The best result on each dataset is highlighted in boldface and the runner-up results are underlined","venue":null,"work_id":"914a40c9-2274-4549-bb69-f470f0e76c0f","year":2000},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.137340Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:646bdba09f2ab39a5b0ee8923d53ef4d9f66d86378f7728118282430612df4c3","observation_id":"a93d1d43-c8ea-4811-81da-3c48a3974e1f","resolution":{"observed_at":"2026-08-15T21:19:31.262374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.443319Z","title":"Progressive hard negative masking: From global uniformity to local tolerance.IEEE Transactions on Knowledge and Data Engineering , 35(12):12932–12943,","venue":null,"work_id":"2e19c4ee-1a53-4e1f-a3dd-dd9636472fa4","year":2023},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.054047Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:e816b9d5f9163aa1d9ccc12a523293040f44f7610122d5b144781e4aeea246df","observation_id":"a513aec7-f547-4876-b42e-ef3ec8becd12","resolution":{"observed_at":"2026-08-15T21:19:31.449188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:30.940570Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.940570Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:221cd63d04155e859351b805485b5964e36e09868aadc784d9d141c74b0785d1","observation_id":"e6f47a9d-e6d6-4517-a84a-0a86c3c557be","resolution":{"observed_at":"2026-08-15T21:19:30.940570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-15T21:19:31.072672Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.072672Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:f624b9a2a282e47e803b160c712a7c000876491fbe90245a393c59951dfbb3a7","observation_id":"a589b651-2bab-49d5-814a-7d4143f51a3c","resolution":{"observed_at":"2026-08-15T21:19:31.072672Z","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-15T21:19:31.535907Z","title":"Affinity uncertainty-based hard negative mining in graph contrastive learning","venue":null,"work_id":"e2793db0-32f5-4e4b-bd2d-698522a3845f","year":2024},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.024393Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:f0a633f133a1db4eb72124ae59e08a7f6ed1f8cd2ec7e1cf6e25bc51d89daa24","observation_id":"de824d40-10d0-4eea-a16c-6cca0f46be20","resolution":{"observed_at":"2026-08-15T21:19:31.541724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.504672Z","title":"On variational bounds of mutual information","venue":null,"work_id":"72c5f8ab-34e7-4bea-86bf-7783f2ea7a72","year":2019},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.035080Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:2fffd7f583dc59997f6eb52106ad4e633d79d1e4e8e58ac40fd6fcc4183e5a79","observation_id":"bbe87350-2e70-46ca-88af-04c6c46f10cc","resolution":{"observed_at":"2026-08-15T21:19:31.509532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:30.995419Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.995419Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:eae769a939f15569a24540210b79e0bf3e7e2a76816b3bc0cfa48f453ccc1527","observation_id":"54d82561-6a13-4b1f-9986-96d64b386002","resolution":{"observed_at":"2026-08-15T21:19:30.995419Z","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-15T21:19:31.698166Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"3b48b1fc-1fba-47fe-8659-cebd2f0bb5e6","year":2017},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.964499Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:997a9e44c0e1a26f92ad592bed83af7dba56fcfcbaa3198c5d65952bdf63f48c","observation_id":"c461b1ed-e764-4673-b832-1296b27dc14f","resolution":{"observed_at":"2026-08-15T21:19:31.703627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.791858Z","title":"Learning from positive and unlabeled data: A survey","venue":null,"work_id":"ea19b4f1-b1f1-4eee-b594-08c08760214e","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.932777Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:484bf668a33d3dda07c5e38ad853e888a1c6466883f0726893f3ac74b55a000b","observation_id":"bb03bcbe-92ad-416b-b195-5ffc1e399fdb","resolution":{"observed_at":"2026-08-15T21:19:31.796908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.492529Z","title":"Contrastive learning with hard negative samples","venue":null,"work_id":"b6cc58ff-ee0f-4221-9d9d-e484591f0911","year":2021},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:31.038912Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:66261b28ab29b6cd294785bf51ba508b6bae4fed923dfbaa7bd6eca4da693dea","observation_id":"30f89eb7-74fd-4f49-991c-26adad054d78","resolution":{"observed_at":"2026-08-15T21:19:31.496306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.780658Z","title":"A fuzzy extension of the rand index and other related indexes for clustering and classification assessment","venue":null,"work_id":"29eff144-308c-4938-8938-fe3d3cadbeed","year":2007},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.936561Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:2dc4191c9219f7120c416a08f02edec262686778266a08a29e203545bc35db88","observation_id":"5953f37c-ae5a-46ab-b77f-76adb2431d45","resolution":{"observed_at":"2026-08-15T21:19:31.784319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.633962Z","title":"Boosting contrastive self-supervised learning with false negative cancellation","venue":null,"work_id":"d4bdd7e8-855c-42b3-a3ce-478b12af41c5","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.987799Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:2cff6a7266a220efce75a94b8e9f8f1c12194b6b9ebc82a9c67b7b86859b2876","observation_id":"5fb9a94e-d1e6-4204-81df-5a75574e775b","resolution":{"observed_at":"2026-08-15T21:19:31.638546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.711255Z","title":"Neu- ral message passing for quantum chemistry","venue":null,"work_id":"4e145067-e68d-442a-ad57-bc119f194a80","year":2017},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.961056Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:3edf1104dd3ffb61ad61e9794bdd85769407e23fd8dc944ea883e5ef9e064a3e","observation_id":"648cdcec-e7e6-4998-9777-c0b29f5ac41b","resolution":{"observed_at":"2026-08-15T21:19:31.716129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.723987Z","title":"Adversarial graph contrastive learn- ing with information regularization","venue":null,"work_id":"42b9d1db-88a8-4d87-8174-d469b18cfdb3","year":2022},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.956442Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:a4d63ea2755bd4519a8f7147e92098de233f959035a44e42192b986e85d705f2","observation_id":"c865e9dd-cb1c-4fdc-819b-649470064314","resolution":{"observed_at":"2026-08-15T21:19:31.728662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:19:31.748673Z","title":"Debiased contrastive learning","venue":null,"work_id":"62085f64-13d4-42d9-9b70-666dfc921906","year":2020},"citing_paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T21:19:30.948736Z"},"links":{"citing_paper":"/paper/2505.10307"},"observation_digest":"sha256:8ce5ab9937da2c76ab6b905a8bcb61b050e1c9611cc8e51e76c7a4c62602ae6f","observation_id":"4530bbe0-89bc-437f-a9f3-30a3eb61db77","resolution":{"observed_at":"2026-08-15T21:19:31.753315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.10307","last_updated":"2025-05-15T13:53:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T20:19:25.693330Z","submitted_at":"2025-05-15T13:53:48Z","title":"Negative Metric Learning for Graphs"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":56},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2505.10307."}