{"as_of":"2026-08-20T23:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b137b100b35155bb12349742dd475bcc3f52e0c9e8a6fa2bd90c929c65e5549b","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:04:03.721615Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2504.16748/citation-record","integrity":"/paper/2504.16748/integrity","json":"/paper/2504.16748/citation-record.json","paper":"/paper/2504.16748"},"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-16T11:04:03.895897Z","title":"We focus on a special case defined as follows: eα(λ,t ) = ∞X n=0 (−1)n λntαn Γ(αn + 1), λ> 0, t≥","venue":null,"work_id":"4d57f516-75d4-49b4-a4a7-f7b9eb6c94b7","year":1903},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.696498Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:8f03e28201c77f62f231875e1c92ddba4af72c3cff51636ffd833bbf0f20355c","observation_id":"9e6bca83-c4e8-4744-992c-1faf5009c574","resolution":{"observed_at":"2026-08-16T11:04:03.899842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.974507Z","title":"HGRL relies on graph augmentations, while DSSL assumes a graph generation process, which may not always reflect real-world graphs","venue":null,"work_id":"955c65f0-42e6-414e-bf20-1eaf0803c973","year":2022},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.672899Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:8b67014cd522df72f04c44da94dd13523511bc413519043a14e02466140e9680","observation_id":"b33d1fd9-1e96-4c52-a8eb-efb3d2d6b5a0","resolution":{"observed_at":"2026-08-16T11:04:03.978686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.961802Z","title":"SP-GCL (Wang et al., 2023), on the other hand, effectively handles heterophilic graphs by capturing both low- and high-frequency components","venue":null,"work_id":"c812d763-ffab-488d-a447-f88c6dcd88ca","year":2023},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.677019Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:697c55f2a1c21fb20ef501c36651e6c85d238c4d3de08f7ded4bbaad748cfeb3","observation_id":"e7c9cb31-f928-4a79-b122-f8e5660086ee","resolution":{"observed_at":"2026-08-16T11:04:03.965990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.948392Z","title":"Building on the BGRL framework, AFGRL eliminates the need for augmentations by generating positive samples directly from the original graph for each node","venue":null,"work_id":"185c462e-cd97-4f44-9c12-5d6f59423abe","year":2021},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.680708Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:9b4f88e00a27afe63974855831ccb58cef04abe7e296dfd3a48df83d54ba5a59","observation_id":"5add08eb-2f84-4862-9670-185768389d3c","resolution":{"observed_at":"2026-08-16T11:04:03.952828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.934747Z","title":"It maximizes the correlation between two augmented views of the same input while decorrelating the feature dimensions within a single view’s representation","venue":null,"work_id":"1d997655-a8ad-470d-9747-36decc4d0afb","year":2024},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.684517Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:8ed8e71c7b3827dc5ebd73de3075c0dd7dc7619791fcf9c8e10b0b78b6f163f2","observation_id":"0bf26a36-5700-4718-aaeb-5d7428dfd481","resolution":{"observed_at":"2026-08-16T11:04:03.939132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.908677Z","title":"Replacing d/ dt withDα t , one obtains its FDE version as Dα t Y(t) =σ (Fθ(Z(t),t ))−γZ(t)−νY(t) Dα t Z(t) = Y(t)","venue":null,"work_id":"84c52474-9071-4cb8-9788-9a37975c32ba","year":2024},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.692927Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:c3dff9df2391936a21fd6ee548c11c1aea325d925801ffd50f04e7e88d4501cf","observation_id":"4d8719fb-7d1d-4d5a-b43c-b682a34c4aed","resolution":{"observed_at":"2026-08-16T11:04:03.912481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.882540Z","title":"(c) For fixed i andj, we havebα1,i,j >b α2,i,j","venue":null,"work_id":"00480df8-df07-4920-95e0-b2e3b1f4c1e7","year":2023},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.700307Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:2679a49b8f9da823cf8720dba431d045c35b9a0735a18c29f8bb11cc978aad52","observation_id":"f38f780c-20e8-4baf-928a-1bb3574517a4","resolution":{"observed_at":"2026-08-16T11:04:03.886718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.868907Z","title":"These datasets are among the most widely used benchmarks for node classification","venue":null,"work_id":"4fb49f80-994a-422d-8503-c33c12b4d90b","year":2022},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.704734Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:1f3f19b1dcdf1e9452665cab370eb2cb02ba70cde26435da5baa8ffa3171c4ad","observation_id":"1f1d09ed-7586-49c2-a6af-c53ee465694b","resolution":{"observed_at":"2026-08-16T11:04:03.873051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.854933Z","title":"Each node represents a word (possibly non-unique) in the text, with features based on word embeddings","venue":null,"work_id":"1dbddf49-5276-4d78-9890-d5ee3d6b0e85","year":2023},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.708890Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:d395c7c39ff7d490132beb6eaae4e51c12fa916708f139a2d972b3f210efe219","observation_id":"70ef7e20-4e5a-4250-a834-5e55dde673a5","resolution":{"observed_at":"2026-08-16T11:04:03.859579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.840892Z","title":"Nodes represent papers, and edges indicate citation relationships","venue":null,"work_id":"6f82676a-ef54-4ce3-9e2e-daf9f8f66b2a","year":2021},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.713132Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:ee946f9f3d6d78efebf38981f54ea5a86a1cb11242eed46b749f8e3a71805d09","observation_id":"c716c4a6-2c92-49f3-a189-5541a29bdd59","resolution":{"observed_at":"2026-08-16T11:04:03.845436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.826474Z","title":"Contrastive Loss Functions In the absence of explicit negative samples, non-contrastive methods focus on maximizing agreement among positive samples","venue":null,"work_id":"b5a81134-a21b-4d0b-9740-6d06b933fa29","year":null},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.717419Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:c2fbcc4f3c32802c20ee9fde9cce653a6e0ed901b8af19666f4a2daa953d7016","observation_id":"6a9484f1-89ed-4bf2-9c8a-b6f77dc847dc","resolution":{"observed_at":"2026-08-16T11:04:03.830653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.813175Z","title":"The definitions of Euclidean loss, Cosmean loss, Barlow Twins loss, and VICReg loss are provided below","venue":null,"work_id":"ea55ee80-5a2f-4f5e-a287-596966bedd80","year":2022},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.721615Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:d8bf18aaa98d00f772366bc71d5eda776d8612729774617f84241f2fc2d725ab","observation_id":"ab07dd09-0b87-4da3-956f-63900b274fe5","resolution":{"observed_at":"2026-08-16T11:04:03.817191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.921128Z","title":"One can find other approaches and more discussions in Tarasov (2011)","venue":null,"work_id":"04bf4d7a-95f1-4692-a9c3-7048f1e6d767","year":2011},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.688523Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:dac249d8b33517ebfa316aec16837abb1bbb97a7d6db135f5c4f9c87ffed8877","observation_id":"08bf9eea-154d-4ba9-9aa1-a946ec43fe31","resolution":{"observed_at":"2026-08-16T11:04:03.924815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.987172Z","title":"Graph contrastive learning with adaptive augmentation","venue":null,"work_id":"bf9bc31c-1129-4f2f-8d0f-ede562a39508","year":null},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.668736Z"},"links":{"citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:2376c67c9c71e598f1e9615de8be7cc7dcb89a569390664d635d3be5fc7b9c8d","observation_id":"00c58fdd-7db3-4304-b16c-3af74154b8e0","resolution":{"observed_at":"2026-08-16T11:04:03.991010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T11:04:03.659575Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.659575Z"},"links":{"cited_paper":"/paper/2212.04604","citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:06756dc7026c424d07bc62aa7efa2e3cdfaaa51a095822049e31a08b7bbbaa17","observation_id":"4c777bdf-039d-4176-9c8a-3745b0041769","resolution":{"observed_at":"2026-08-16T11:04:03.659575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13084","last_updated":"2023-10-31T14:45:25Z","snapshot_observed_at":"2026-08-19T10:39:55.538742Z","submitted_at":"2023-05-22T14:52:33Z","title":"A Fractional Graph Laplacian Approach to Oversmoothing","version":2},"cited_work":{"arxiv_id":"2305.13084","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.13084","snapshot_observed_at":"2026-08-16T11:04:03.798053Z","title":"A Fractional Graph Laplacian Approach to Oversmoothing","venue":"cs.LG","work_id":"56e549b3-c3b9-4774-882a-0d4275632a88","year":2023},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.650482Z"},"links":{"cited_paper":"/paper/2305.13084","citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:c81a93c3b724fe1edbf2d4617faa7fdb2447a138637f4af47f861e2478e752ca","observation_id":"9aa9f702-5545-4762-9568-9f07f5b68fbc","resolution":{"observed_at":"2026-08-16T11:04:03.803958Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5851","last_updated":"2014-03-06T23:27:18Z","snapshot_observed_at":"2026-08-19T09:54:39.555114Z","submitted_at":"2013-12-20T08:42:21Z","title":"Fast Training of Convolutional Networks through FFTs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5851","snapshot_observed_at":"2026-08-16T11:04:03.655332Z","title":"Fast training of convolutional networks through FFTs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.655332Z"},"links":{"cited_paper":"/paper/1312.5851","citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:610aaeb5eefeb541cfa7187921770c02729b01f488955fe0dfb95db464256931","observation_id":"ae0e94c4-32ed-442b-92bb-7396977f65d6","resolution":{"observed_at":"2026-08-16T11:04:03.655332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-18T19:43:01.466508Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-16T11:04:03.664004Z","title":"Deep graph contrastive representation learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T11:04:03.664004Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2504.16748"},"observation_digest":"sha256:d6d55e4314c5f1d5f6681495070cb1b74e0255dac1108570631b84a3fb2b4eaa","observation_id":"aa5dc74f-b3c6-419f-bbac-5b894866cf9a","resolution":{"observed_at":"2026-08-16T11:04:03.664004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.16748","last_updated":"2025-04-24T14:26:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T05:48:44.251848Z","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":14},"total_outbound_references":18},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2504.16748."}