{"as_of":"2026-08-10T13:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a957697637fa6175a3a8728de8ed7f3389d027087bbb61df02743ce18ac402b","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:28:35.805437Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:05:22.198820Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T12:43:44.319074Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19024","snapshot_observed_at":"2026-08-07T15:05:22.198820Z","title":"Huang, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16463","last_updated":"2025-06-18T18:55:01Z","snapshot_observed_at":"2026-08-09T12:15:34.632825Z","submitted_at":"2025-05-22T09:44:44Z","title":"AnchorFormer: Differentiable Anchor Attention for Efficient Vision Transformer","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:22.198820Z"},"links":{"cited_paper":"/paper/2505.19024","citing_paper":"/paper/2505.16463"},"observation_digest":"sha256:b3df5fb3533940b5cfb28b50371f903f418f4ca3beaf5f492216a132cd3873f1","observation_id":"18d9bb00-30da-49e3-882c-c46e90d7b08a","resolution":{"observed_at":"2026-08-07T15:05:22.198820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19024","snapshot_observed_at":"2026-08-06T22:21:13.290940Z","title":"arXiv preprint arXiv:2505.19024 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21853","last_updated":"2025-09-07T09:44:32Z","snapshot_observed_at":"2026-08-08T23:09:09.540288Z","submitted_at":"2025-06-27T02:08:40Z","title":"Skill-Nav: Enhanced Navigation with Versatile Quadrupedal Locomotion via Waypoint Interface","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T22:21:13.290940Z"},"links":{"cited_paper":"/paper/2505.19024","citing_paper":"/paper/2506.21853"},"observation_digest":"sha256:c43e13b51f55a2241ed26c94abafe0649ff3b987c17da55dd2c51fd1e8557d96","observation_id":"c780d8f5-a149-49de-9bfa-57b0541af426","resolution":{"observed_at":"2026-08-06T22:21:13.290940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"cited_work":{"arxiv_id":"2505.19024","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.19024","snapshot_observed_at":"2026-08-05T12:43:44.319074Z","title":"Learn Beneficial Noise as Graph Augmentation","venue":"cs.LG","work_id":"98b4c4a0-68d6-464c-8ef6-050b9b3916b4","year":2025},"citing_paper":{"arxiv_id":"2509.01312","last_updated":"2025-09-01T09:53:01Z","snapshot_observed_at":"2026-08-07T08:06:47.773467Z","submitted_at":"2025-09-01T09:53:01Z","title":"TableZoomer: A Collaborative Agent Framework for Large-scale Table Question Answering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:33.233410Z"},"links":{"cited_paper":"/paper/2505.19024","citing_paper":"/paper/2509.01312"},"observation_digest":"sha256:f937a7e44673fc7e28c968f05d5a409dee956186330e11b46e688d4a00790c01","observation_id":"2fd88e7c-74d5-4b26-9af2-75bcd56416e7","resolution":{"observed_at":"2026-08-05T12:43:44.412810Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.19024/citation-record","integrity":"/paper/2505.19024/integrity","json":"/paper/2505.19024/citation-record.json","paper":"/paper/2505.19024"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.06667","last_updated":"2019-06-10T08:35:03Z","snapshot_observed_at":"2026-08-09T17:39:02.416243Z","submitted_at":"2019-02-13T09:58:44Z","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","version":4},"cited_work":{"arxiv_id":"1902.06667","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.06667","snapshot_observed_at":"2026-08-07T14:28:36.023369Z","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","venue":"cs.SI","work_id":"deccb9be-d6b8-439a-8ace-fd82ca5a48d7","year":2019},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.160038Z"},"links":{"cited_paper":"/paper/1902.06667","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:85ba8df628ba52745be7473251d8800a5ee937f3252f5b158973ec50828cb516","observation_id":"cbf41ae4-b6d7-428a-83e5-f896a5c24a4f","resolution":{"observed_at":"2026-08-07T14:28:36.170469Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-07T14:28:34.444667Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.444667Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:38475847ad4d5d55b0b0e42f67ffa5ca5e7afc5ec51734f0a434aa9442e86a96","observation_id":"3b8f338d-0570-4b59-a11e-6645d0627c93","resolution":{"observed_at":"2026-08-07T14:28:34.444667Z","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-07T14:28:36.748535Z","title":"We evaluate our proposed framework in the semi-supervised learning setting on graph classification on the benchmark TUDataset (Morris et al., 2020)","venue":null,"work_id":"14e5b487-c532-4fb5-be72-cda3b93cbb49","year":2020},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.632148Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:32a703136ec84240549a0661d84e7762b7c771b1b3c8d7dc8a4fafedbd21b2f0","observation_id":"053f5683-97d1-45ef-9ab8-3c15ebeec71c","resolution":{"observed_at":"2026-08-07T14:28:36.842769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-09T20:27:52.092668Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T14:28:34.696094Z","title":"C.-C., Lei, Y ., and Yang, B","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.696094Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:066015024fcd58db2bb4a93da80d35717805ea2024f75591637f4143e458650a","observation_id":"581ed39f-7ad8-445c-8a80-f54b69911c2e","resolution":{"observed_at":"2026-08-07T14:28:34.696094Z","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-07T14:28:37.480346Z","title":"Dropout: a simple way to prevent neural networks from overfitting","venue":null,"work_id":"80b09505-ff70-4e1f-84a8-400341e0cc93","year":1929},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.806652Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:464b3271e9625a9023236a3c959004300d34125b33220cb96fcf616587905247","observation_id":"d4ffcbea-3116-45cb-b5c1-3b150800b466","resolution":{"observed_at":"2026-08-07T14:28:37.582098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:28:36.433180Z","title":"Specifically, we carry out grid search for the hyper-parameters on the following search space: • Number of training epochs: {500, 1000, 1500, 2000, 3000}","venue":null,"work_id":"ddb6f1b4-f170-42fa-b898-3657f148b1e5","year":2000},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.805437Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:f52b2b63c215513ec62eda21aa207eb142c44d1041d76972b1d1784f88966192","observation_id":"8b7543a3-f367-41e8-be4f-090235610d55","resolution":{"observed_at":"2026-08-07T14:28:36.514728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07651","last_updated":"2025-05-28T15:07:08Z","snapshot_observed_at":"2026-08-04T13:50:58.922895Z","submitted_at":"2023-06-13T09:43:32Z","title":"Variational Positive-incentive Noise: How Noise Benefits Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.07651","snapshot_observed_at":"2026-08-07T14:28:35.253981Z","title":"Graph contrastive learning automated","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.253981Z"},"links":{"cited_paper":"/paper/2306.07651","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:b52b902171659167de6a1362083e945cfb39f4dd9b6efdd1d52b5b274e01229a","observation_id":"e0bb31d1-52b7-4c4d-94a6-8d5c91f8b766","resolution":{"observed_at":"2026-08-07T14:28:35.253981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09929","last_updated":"2026-05-08T06:19:21Z","snapshot_observed_at":"2026-08-02T14:52:34.680562Z","submitted_at":"2024-08-19T12:07:42Z","title":"Data Augmentation of Contrastive Learning is Estimating Positive-incentive Noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09929","snapshot_observed_at":"2026-08-07T14:28:35.307034Z","title":"Data augmentation of contrastive learning is estimating positive-incentive noise","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.307034Z"},"links":{"cited_paper":"/paper/2408.09929","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:2668dc9d87046fe30b3ded237a4b084e935993c0677591a759b51c04e82a4147","observation_id":"dc3da9a9-e450-4558-bb63-41b3d20dc033","resolution":{"observed_at":"2026-08-07T14:28:35.307034Z","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-07T14:28:37.268807Z","title":"Graph contrastive learning with adaptive augmentation","venue":null,"work_id":"f7d51184-74c6-444f-8ca9-fd9a0bf30833","year":2021},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.366798Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:faaaf90e9454893ebb7b09ff794766373a2d47a347adb9fe63d89f49b37f7d91","observation_id":"a439eddb-5264-43e4-996c-d1f1cb202c89","resolution":{"observed_at":"2026-08-07T14:28:37.374242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:28:36.889644Z","title":"The detailed statistics of the datasets are summarized in Table","venue":null,"work_id":"cad7b66f-69bc-431e-a40c-c1c743520fa3","year":2020},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.551060Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:5887cec4cacdcb351896ef87096b2ca293221e878412231364bdbc1535ef58dd","observation_id":"c0011200-7e2f-4b74-bb1b-3731577e3f59","resolution":{"observed_at":"2026-08-07T14:28:36.994253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:28:36.592306Z","title":"Dataset Graphs Avg","venue":null,"work_id":"bbf02415-05af-4135-9699-ba18c76885b9","year":2000},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":256,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.711677Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:c6127b6b3ccaca1fa8725d59db0f1b04b38b93a15adceb7c7ff2657213f116fc","observation_id":"1d6f47ef-0c1e-4238-b3c1-fb3de728f0a6","resolution":{"observed_at":"2026-08-07T14:28:36.648098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.05584","last_updated":"2018-04-10T15:26:32Z","snapshot_observed_at":"2026-07-06T05:59:59.763065Z","submitted_at":"2017-09-17T00:19:33Z","title":"Representation Learning on Graphs: Methods and Applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.05584","snapshot_observed_at":"2026-08-07T14:28:34.040621Z","title":"Inductive repre- sentation learning on large graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.040621Z"},"links":{"cited_paper":"/paper/1709.05584","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:48cda6cdc53df6da2728486e22214aa0b64211a9b986781695cd2e3a7c2c1475","observation_id":"5701de91-013d-4370-b1b3-0a3a567404ad","resolution":{"observed_at":"2026-08-07T14:28:34.040621Z","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-07-06T07:05:24.565760Z","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-07T14:28:35.179306Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.179306Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:188f76fddbcc925ac9866153a9fca02e6799aea92be2ed8e7af0c6f44d921b78","observation_id":"61372527-58fb-498b-b976-242eac5ab5d6","resolution":{"observed_at":"2026-08-07T14:28:35.179306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.00104","last_updated":"2020-08-31T21:11:48Z","snapshot_observed_at":"2026-07-06T09:51:38.679778Z","submitted_at":"2020-08-31T21:11:48Z","title":"A Framework For Contrastive Self-Supervised Learning And Designing A New Approach","version":1},"cited_work":{"arxiv_id":"2009.00104","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.00104","snapshot_observed_at":"2026-08-07T14:28:36.275309Z","title":"A Framework For Contrastive Self-Supervised Learning And Designing A New Approach","venue":"cs.CV","work_id":"3774e540-69d7-496b-868b-85752f6c5906","year":2020},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:33.923722Z"},"links":{"cited_paper":"/paper/2009.00104","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:1c7ac497844be76a2c663f5043dc63577361ccd2e9e1981492068a188a5149f0","observation_id":"fc37ff59-d331-44de-9699-eed998b72aa4","resolution":{"observed_at":"2026-08-07T14:28:36.328528Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","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-07T14:28:35.063523Z","title":"Representa- tion learning with contrastive predictive coding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.063523Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:1c7d9c7974492965d8565588f7f43e93bf251c2ffe280bc590b459b0fcc7936e","observation_id":"b3915efa-74c8-4c19-8544-90f98a886332","resolution":{"observed_at":"2026-08-07T14:28:35.063523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06514","last_updated":"2023-02-20T10:48:57Z","snapshot_observed_at":"2026-08-03T20:49:08.151344Z","submitted_at":"2021-02-12T13:36:39Z","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06514","snapshot_observed_at":"2026-08-07T14:28:34.915423Z","title":"Adversarial graph augmentation to improve graph contrastive learn- ing, 2021a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.915423Z"},"links":{"cited_paper":"/paper/2102.06514","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:cef70e0f404fc3400595f5549df02f408762ccdfe5332c12d28254f6c558a441","observation_id":"fb1953ee-3147-471a-a21c-d47977c69a9e","resolution":{"observed_at":"2026-08-07T14:28:34.915423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T14:28:34.567236Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.567236Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:131e4c361739489664b959a94bf21e25f7a2d579ae5d56bc2dc0e5e1bd425069","observation_id":"0821edb3-541e-46df-9aeb-4b09348b9dcf","resolution":{"observed_at":"2026-08-07T14:28:34.567236Z","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-07T14:28:37.074813Z","title":"Derivation of Eq","venue":null,"work_id":"7ce6fcf4-982e-418d-8598-f8991d589bba","year":2008},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:35.469811Z"},"links":{"citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:2b328cd6ee34d688c2ec20f16fdc73188de15c713f75e7ba5e03e53d9976255c","observation_id":"0961ecea-09f5-4226-a193-6c55f5421b14","resolution":{"observed_at":"2026-08-07T14:28:37.154731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-01T18:34:23.156273Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-07T14:28:34.293682Z","title":"Categorical repa- rameterization with gumbel-softmax","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.293682Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:2987d397dc1bca0d2b871c6d0ce6b3baa559ad3e2df628e3e4322abad10e3839","observation_id":"b2d6806c-cba5-43ac-a16b-bbeff3916ff5","resolution":{"observed_at":"2026-08-07T14:28:34.293682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":7},"total_outbound_references":19},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 3 inbound Pith citation observations for arXiv:2505.19024."}