{"as_of":"2026-08-22T08:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:299d8c8c8bb773099c42d03d9f8d7035ebff83f2b01d5e7e3e709249d78476f4","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:23:46.577193Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T09:04:27.194613Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T09:07:39.235976Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"cited_work":{"arxiv_id":"2505.04956","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04956","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graffe: Graph representation learning via diffusion probabilistic models.arXiv preprint arXiv:2505.04956, 2025a","venue":null,"work_id":"83217d13-f98f-436f-bd1a-3a33f257d026","year":null},"citing_paper":{"arxiv_id":"2602.00656","last_updated":"2026-05-07T10:06:18Z","snapshot_observed_at":"2026-08-15T22:28:47.921723Z","submitted_at":"2026-01-31T11:05:35Z","title":"DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T09:04:27.194613Z"},"links":{"cited_paper":"/paper/2505.04956","citing_paper":"/paper/2602.00656"},"observation_digest":"sha256:b1686fc0c3f8778e621f9a2afdc7f8c59052c330c685406992ef1904e58724c0","observation_id":"a3061aac-0be2-4259-ba71-350fd70a54a7","resolution":{"observed_at":"2026-05-16T09:07:39.237882Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.04956/citation-record","integrity":"/paper/2505.04956/integrity","json":"/paper/2505.04956/citation-record.json","paper":"/paper/2505.04956"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.287090Z","title":"Reducing the dimensionality of data with neural networks,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.287090Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:730c089a5f66f67782c1485db3a2c81052845a84f068c191e6c2e3c4439c0452","observation_id":"bb3e3f97-773a-4066-b089-ce7d264cfba3","resolution":{"observed_at":"2026-08-15T23:23:46.287090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","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-15T23:23:46.292434Z","title":"Auto-encoding variational bayes,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.292434Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:10671aff7a52feefede7a73cf43efc24656c3346162980a3e3207949361acb85","observation_id":"77834efe-3099-4539-826c-34a3170e5e0f","resolution":{"observed_at":"2026-08-15T23:23:46.292434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.297428Z","title":"Improving language understanding by generative pre- training,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.297428Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:41951f99cb47d59b94490b7168e3b18c02d3cb288f04e277afe4a2a7f8932add","observation_id":"fe659483-a685-4cd4-ab02-17ccd7109120","resolution":{"observed_at":"2026-08-15T23:23:46.297428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.302191Z","title":"Generative adversarial networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.302191Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:2431192d21266304f9660e5cf01807d614f6012f0024d85139db600e32f3b24a","observation_id":"f40ad50c-6ff0-4009-a25e-682d5e885d6b","resolution":{"observed_at":"2026-08-15T23:23:46.302191Z","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-15T23:23:47.423707Z","title":"Generative pretraining from pixels,","venue":null,"work_id":"df06cf88-77dc-4cb8-8232-1f60eb32ed03","year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.306658Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:db5e0792a41f658c6b84fe96bac5df09a1e986b564c27ce9bca632d4a92b52d8","observation_id":"47453911-2de3-4a09-ae66-b7cce7bd8ce4","resolution":{"observed_at":"2026-08-15T23:23:47.428222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.409416Z","title":"Large scale adversarial representation learning,","venue":null,"work_id":"fe01a7a2-1bba-426c-982a-9b7c32785d97","year":2019},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.311334Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:631c61c869733265a861cde908a27c57f15cb2464bf53ae38c53572890bf7867","observation_id":"c821063a-9e9e-4ef3-9909-7e63314faaff","resolution":{"observed_at":"2026-08-15T23:23:47.413860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.316360Z","title":"Denoising diffusion probabilistic models,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.316360Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:3daa506a890d0c560b490039a3609e483c264822f92287066b7869b8f11c6df7","observation_id":"74e3dc5c-e862-41ea-8cc7-65a0dbc4b8c7","resolution":{"observed_at":"2026-08-15T23:23:46.316360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13456","last_updated":"2021-02-10T18:17:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-11-26T19:39:10Z","title":"Score-Based Generative Modeling through Stochastic Differential Equations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13456","snapshot_observed_at":"2026-08-15T23:23:46.320745Z","title":"Score-based generative modeling through stochastic differential equations,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.320745Z"},"links":{"cited_paper":"/paper/2011.13456","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:99063dbc00c489f47642651361c8a387dfd223cdf74c299f6bec6e37582ec4ad","observation_id":"fee44052-47ed-43aa-b043-55e5a426f7a0","resolution":{"observed_at":"2026-08-15T23:23:46.320745Z","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-15T23:23:47.386739Z","title":"A revision bloom’s taxonomy: An overview,","venue":null,"work_id":"cbef1337-d771-4abd-a056-ca36bde50189","year":2002},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.325475Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:559d72af90525ca1aaf776376f0904736d8a3b2cb50cd343e1a0eeb207911287","observation_id":"b3f456ef-0d07-4bd6-aa32-2e5187955ee9","resolution":{"observed_at":"2026-08-15T23:23:47.391245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.372315Z","title":"Image generation from scene graphs,","venue":null,"work_id":"62c32cb9-3ea9-4fd6-8895-d685ff7c1277","year":2018},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.329345Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:636f8a833f0deb927ab8f32ef3064f7f0e822ab7d711d41df341d6162a843758","observation_id":"7c419f7b-a611-4a18-b686-0745c3a0edc0","resolution":{"observed_at":"2026-08-15T23:23:47.376878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.358743Z","title":"Infodiffusion: Representation learning using information maximizing diffusion models,","venue":null,"work_id":"ac9f73ae-346c-426a-9fcc-0b6d725a5f29","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.333441Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:c858b65070ddc3cd0db8db46b411c54c0df18aa3c1807258456c05c2c292fef6","observation_id":"c3c1c703-e7ac-4380-bdf8-a7871cb83356","resolution":{"observed_at":"2026-08-15T23:23:47.363309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.345505Z","title":"Soda: Bottleneck diffusion models for representation learning,","venue":null,"work_id":"b2de55cd-3036-42c5-b777-45b624bf3854","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.337420Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:b249117520a193f3f4df2aafe8be7e394e138a2da3e0eef6b7410b37b5e7f214","observation_id":"e237d075-e0e9-431b-8b31-619e1a5d996e","resolution":{"observed_at":"2026-08-15T23:23:47.350070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12399","last_updated":"2024-04-24T08:48:13Z","snapshot_observed_at":"2026-08-18T09:21:44.549875Z","submitted_at":"2023-11-21T07:22:48Z","title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12399","snapshot_observed_at":"2026-08-15T23:23:46.341360Z","title":"A survey of graph meets large language model: Progress and future directions,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.341360Z"},"links":{"cited_paper":"/paper/2311.12399","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:0fd872f5c7cc17fe11003a06415e6afdfc25ef7e41721992ab61f8e2a3f4f1cc","observation_id":"5e62125f-f82f-4380-bc26-0589abe300f5","resolution":{"observed_at":"2026-08-15T23:23:46.341360Z","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-15T23:23:47.331319Z","title":"Gslb: The graph structure learning benchmark,","venue":null,"work_id":"59691c50-90d5-4c00-a7a6-63c08bcc863b","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.345627Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:765113e5280f898d57a183088f373b40ba6f3bfb78ab076db124b539a25b5efb","observation_id":"fb991980-6c9f-40a9-b175-8b5e21a5f0b0","resolution":{"observed_at":"2026-08-15T23:23:47.336088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.349548Z","title":"Denoising diffusion autoencoders are unified self-supervised learners,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.349548Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:1c1e8db10bc94188ebe919ff62e59d848b51034347d6fce00f9e2e38ff7166ae","observation_id":"dd15c1e3-f15e-4981-abce-1c13299e8759","resolution":{"observed_at":"2026-08-15T23:23:46.349548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14404","last_updated":"2024-01-25T18:59:57Z","snapshot_observed_at":"2026-08-21T01:29:25.430869Z","submitted_at":"2024-01-25T18:59:57Z","title":"Deconstructing Denoising Diffusion Models for Self-Supervised Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14404","snapshot_observed_at":"2026-08-15T23:23:46.353650Z","title":"Deconstructing denoising diffusion models for self-supervised learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.353650Z"},"links":{"cited_paper":"/paper/2401.14404","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:4f8046057090ebad1035155b7d03a0e233c9a247f42e5f38b4521eb20f225299","observation_id":"123cce83-0199-4f95-8166-3bbf0feb0f2c","resolution":{"observed_at":"2026-08-15T23:23:46.353650Z","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-15T23:23:47.309620Z","title":"Directional diffusion models for graph representation learning,","venue":null,"work_id":"efcfa3d9-8f34-4596-9d25-8d24f17e49dc","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.357975Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:0092117cea56ef26d74f8e40d7bc2dfff4207caed08c19b6664dc861c555e1a6","observation_id":"ff2da5d1-f0c2-4028-bde9-6ec4bf11fcb5","resolution":{"observed_at":"2026-08-15T23:23:47.313831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14257","last_updated":"2024-11-04T03:01:27Z","snapshot_observed_at":"2026-08-20T02:29:19.815141Z","submitted_at":"2021-05-29T09:26:02Z","title":"Diffusion-Based Representation Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14257","snapshot_observed_at":"2026-08-15T23:23:46.362245Z","title":"Diffusion-based representation learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.362245Z"},"links":{"cited_paper":"/paper/2105.14257","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:5f6ad70ae810877cd9c39209c5a203b166738715aa4c9828f23e48e6d221b5d6","observation_id":"059a486e-49bc-4622-a012-6de5cac1ed13","resolution":{"observed_at":"2026-08-15T23:23:46.362245Z","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-15T23:23:47.296699Z","title":"Self-organization in a perceptual network,","venue":null,"work_id":"8505a23c-2472-40a6-b6a5-abeec8bdbad4","year":1988},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.367053Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:f4052f2628f1a4368178871ba8a9aa1950a78e48a56afec43a13ea83a0f96be1","observation_id":"e62be717-2f42-4ae6-849c-f3d8bfe5b912","resolution":{"observed_at":"2026-08-15T23:23:47.300915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06670","last_updated":"2019-02-22T18:38:15Z","snapshot_observed_at":"2026-08-14T18:39:08.324821Z","submitted_at":"2018-08-20T19:52:51Z","title":"Learning deep representations by mutual information estimation and maximization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06670","snapshot_observed_at":"2026-08-15T23:23:46.370865Z","title":"Learning deep representations by mutual information estimation and maximization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.370865Z"},"links":{"cited_paper":"/paper/1808.06670","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:f727c398f329bca9fd99104424c6df5db352903595a27343ce70c003ee45bbf6","observation_id":"edfcdab7-4501-4f2f-ba3b-44b532181378","resolution":{"observed_at":"2026-08-15T23:23:46.370865Z","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-15T23:23:47.283609Z","title":"Deep graph infomax","venue":null,"work_id":"40cabf96-8fd4-469c-a4f2-8e17562fc59e","year":2019},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.375171Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:17932046dbaccec32a0102da304302c61d7549b6e489d8e3a85f9e5a072cb12a","observation_id":"cc67e135-e298-4723-a2a3-fd7797e957aa","resolution":{"observed_at":"2026-08-15T23:23:47.288057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-15T23:23:46.379125Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.379125Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:2b03c650e833b38fec9596db65e5ed7e98b3049447a6a4de604f7c8b08fc4922","observation_id":"df181d8b-de57-45b7-abdd-90f84a0f42a9","resolution":{"observed_at":"2026-08-15T23:23:46.379125Z","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-15T23:23:46.383309Z","title":"Deep graph contrastive representation learning,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.383309Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:8a6c411f088bfc727b66bcaf9c0175bd96e2ee9c627cb86ed1fe90c70893355c","observation_id":"03e3b07b-62f2-4fb4-8d56-887575af4a72","resolution":{"observed_at":"2026-08-15T23:23:46.383309Z","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-15T23:23:47.270235Z","title":"Graph contrastive learning with adaptive augmentation,","venue":null,"work_id":"59502f0f-f5fb-4246-8fef-c473587130dd","year":2021},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.387468Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:328d22c003201b664936d5893663baf08109c9d5ce53ddd6de989acff49bff81","observation_id":"1a224e62-5dd1-4b1b-bf54-2cfb380bdd9e","resolution":{"observed_at":"2026-08-15T23:23:47.274688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.257203Z","title":"Graph contrastive learning with augmentations,","venue":null,"work_id":"08018093-c4c2-4a42-af66-45eb9fabac4d","year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.391521Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:73aa19bc7ff1cb2bb1efdefc28363fe713ffd60aa28a9516882087d128770ee7","observation_id":"e43bb5a0-3d79-46b1-bd2d-239b381a921f","resolution":{"observed_at":"2026-08-15T23:23:47.261687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06514","last_updated":"2023-02-20T10:48:57Z","snapshot_observed_at":"2026-08-18T22:49:50.972808Z","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-15T23:23:46.395298Z","title":"Large-scale representation learning on graphs via bootstrapping,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.395298Z"},"links":{"cited_paper":"/paper/2102.06514","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:bd1653a49dd5f4e3a1a9315aa02de34d87060ce644f08c79a1d1385e33c2fddb","observation_id":"97f19f52-3916-448a-81c6-71fc8063c87e","resolution":{"observed_at":"2026-08-15T23:23:46.395298Z","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-15T23:23:47.243355Z","title":"From canonical correlation analysis to self-supervised graph neural networks,","venue":null,"work_id":"976b5c97-6cab-4bd1-9e9c-1c9bebf6c5fc","year":2021},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.399927Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:114eeb75af679e0349b914dc7d2dbe48f4560d2fe28e341c3bb3bc5bc813d472","observation_id":"1a3094e6-f22e-4ac8-9594-3a1041a121ea","resolution":{"observed_at":"2026-08-15T23:23:47.248074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.229863Z","title":"Gpt-gnn: Generative pre-training of graph neural networks,","venue":null,"work_id":"dd37b811-5435-4d47-9aa0-10122440a213","year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.403821Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:a29ac35ea8aaecc14f3d9038da133c5120ff07d89e6e9f6cff6875a268b34972","observation_id":"6699a1a8-eada-4f01-8fc5-fb38481c965c","resolution":{"observed_at":"2026-08-15T23:23:47.234122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.216877Z","title":"Contrastive multi-view representation learning on graphs,","venue":null,"work_id":"fb849a1d-392c-4add-92b5-745d1ec988c8","year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.407861Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:5c2e07be06c10e1c10b8b278cf1eab575fe10df32ec2ce602ccd2c53ee47fbef","observation_id":"e0e27814-5b54-493c-8de8-eef46b5033dc","resolution":{"observed_at":"2026-08-15T23:23:47.221133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.203386Z","title":"Gcc: Graph contrastive coding for graph neural network pre-training,","venue":null,"work_id":"e7771761-5c33-4515-b718-0b1273e15a51","year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.411906Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:ab4b1867f24892f91a8c78faf684e2ae9d5fc4a92775384c298f18097f05575b","observation_id":"6e7a441d-1fac-4504-84a0-811bbc1dcf3f","resolution":{"observed_at":"2026-08-15T23:23:47.208013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-15T23:23:46.415893Z","title":"Variational graph auto-encoders,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.415893Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:b3486673176f05bdb065de5e40bca8016f0e1fa17639c102743fa4298dfcfab3","observation_id":"ec6c4847-3944-4f92-b3a2-e26de15bd7b7","resolution":{"observed_at":"2026-08-15T23:23:46.415893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10715","last_updated":"2019-05-26T02:47:58Z","snapshot_observed_at":"2026-08-14T16:26:32.475457Z","submitted_at":"2019-05-26T02:47:58Z","title":"Graph Attention Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10715","snapshot_observed_at":"2026-08-15T23:23:46.420053Z","title":"Graph attention auto-encoders,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.420053Z"},"links":{"cited_paper":"/paper/1905.10715","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:27efb87b55b0d29e0a7f782f7be1d7137cce2ac1c4c5ca5aed0ea6216ccd98ad","observation_id":"8ce9773b-9534-47f4-92a4-415fe91b9b8f","resolution":{"observed_at":"2026-08-15T23:23:46.420053Z","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-15T23:23:47.189822Z","title":"Graphmae: Self-supervised masked graph autoencoders,","venue":null,"work_id":"19f5928b-46de-4416-97e2-619abe453e47","year":2022},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.424104Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:eaf3025cf59904d8f7214f85afe895fd01db892f82dedff5637e0503d0c377d8","observation_id":"fd44d00d-4e5d-414c-9fda-2ea2ba78d362","resolution":{"observed_at":"2026-08-15T23:23:47.194570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.175355Z","title":"Uncovering neural scaling laws in molecular representation learning,","venue":null,"work_id":"54fb254e-2a07-40d6-a8d7-6fb103253ad6","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.427945Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:711aae0834afce5a900e35e0cc6f8887cadc85ca0b530f2ec0977e9d5c89d089","observation_id":"867b7a54-f72c-4737-9a27-4c206f4630c8","resolution":{"observed_at":"2026-08-15T23:23:47.180526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.160116Z","title":"Beyond efficiency: Molecular data pruning for enhanced generalization,","venue":null,"work_id":"c77c4471-ca22-4405-b25b-26e9f55dd838","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.432156Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:8e6a87100f30368a0d8126dde174e2b2c9d72469555c3cd89f68c1750ee6ec2c","observation_id":"8a1a20cc-9e89-4684-92f3-ef9178831d37","resolution":{"observed_at":"2026-08-15T23:23:47.164907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.145676Z","title":"Gder: Safeguarding efficiency, balancing, and robustness via prototypical graph pruning,","venue":null,"work_id":"666673d1-f231-42bc-b97d-b76f781bffe1","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.436229Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:7531d2dfb524556ea1b4004f34aa71541f568247db8bbddcac5604b11b485418","observation_id":"49794c5e-d653-4faa-8858-d2f971009ce7","resolution":{"observed_at":"2026-08-15T23:23:47.150678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.130718Z","title":"Diffusion autoencoders: Toward a meaningful and decodable representa- tion,","venue":null,"work_id":"b0606b38-a997-40a2-ae46-c01c42cc3e02","year":2022},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.440351Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:3c6330d9297f2e67218122a8fc2e74cc14b169a9053a6c6b195a254a8740f5ce","observation_id":"a1cb770c-f09b-4d94-a5f2-b6990ef69a98","resolution":{"observed_at":"2026-08-15T23:23:47.136060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.116943Z","title":"Unsupervised representation learning from pre-trained diffusion probabilistic models,","venue":null,"work_id":"f7f43100-af21-4ede-b169-ba6de8f60652","year":2022},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.444304Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:17b430c63150422533956bce41ab5e015c28cd93ef6b7d735e8eafdcba2ccce7","observation_id":"49fa50a2-a44a-4592-ba88-e678e841389c","resolution":{"observed_at":"2026-08-15T23:23:47.121647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.102434Z","title":"Diffusion models as masked autoencoders,","venue":null,"work_id":"6a8c0e9f-1a44-42fd-89b7-1b4f227fd5fe","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.448901Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:b0c759df55bc4a33c609dcddcefee54042e1b98b521000fdf670ba5e8063a6a1","observation_id":"c6e5d3f6-fd36-468f-ab9f-e2483371c72e","resolution":{"observed_at":"2026-08-15T23:23:47.108027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.453060Z","title":"Reverse-time diffusion equation models,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.453060Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:f572e15f32b9789a860e8fde1997bc19804afea99da09a5eceb8dcf5fce10d73","observation_id":"96ef06ca-2ca3-4428-8174-692ad75e869b","resolution":{"observed_at":"2026-08-15T23:23:46.453060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.457198Z","title":"Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.457198Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:6d8b95b97fada4636d769ce7dfc6e6965630337a8c644fbbc3513f2ab5c78b9b","observation_id":"a5f36747-a5e0-46f8-94cd-fa803d5cf733","resolution":{"observed_at":"2026-08-15T23:23:46.457198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05019","last_updated":"2025-06-24T18:47:02Z","snapshot_observed_at":"2026-08-16T15:01:57.120016Z","submitted_at":"2023-09-10T12:44:54Z","title":"SA-Solver: Stochastic Adams Solver for Fast Sampling of Diffusion Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05019","snapshot_observed_at":"2026-08-15T23:23:46.461018Z","title":"Sa-solver: Stochastic adams solver for fast sampling of diffusion models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.461018Z"},"links":{"cited_paper":"/paper/2309.05019","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:06f46889b159e941ce12bac9cfdb140cbeeab70eb54a811e525f4620ff301a30","observation_id":"5263cf12-bd56-4025-8504-48323fd3a318","resolution":{"observed_at":"2026-08-15T23:23:46.461018Z","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-15T23:23:47.071795Z","title":"Accelerating diffusion sampling with optimized time steps,","venue":null,"work_id":"71c2ca7d-e547-4e02-8def-110a86a6dd27","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.465688Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:7bea876beaf276b3c11e0a4132140daa42813b28f0dee5c8dbd659054ac4874f","observation_id":"a65014d9-f7a9-46ee-9a14-def7d79b8f90","resolution":{"observed_at":"2026-08-15T23:23:47.076606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.469709Z","title":"On variational bounds of mutual information,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.469709Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:4735049f282c662c34db6b52bd9d6d2e5526e17b74bdb87500586cb3e9c1bff3","observation_id":"129d1455-45f8-4f90-91dc-799b456c6e7e","resolution":{"observed_at":"2026-08-15T23:23:46.469709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.473633Z","title":"Diffusion models beat gans on image synthesis,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.473633Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:a54bd6c53ea925f01c5bb0d7ed5a0bcecec6ca8b99c04022d45d90dae2ad5e7e","observation_id":"2d204896-2054-4daa-a0ba-d14f7729fa1a","resolution":{"observed_at":"2026-08-15T23:23:46.473633Z","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-15T23:23:47.040341Z","title":"Diffusion probabilistic model made slim,","venue":null,"work_id":"d18df1b5-9ed4-494f-9935-79117c3e15a3","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.477653Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:05f79321f38a042e8060e8f6ba606e94f8a5b8eaed163dbec0903304619ba821","observation_id":"4cd9ab34-66b6-4e1f-b69d-fd1ba0d520d8","resolution":{"observed_at":"2026-08-15T23:23:47.045250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.481521Z","title":"Freeu: Free lunch in diffusion u-net,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.481521Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:9a30654ee2e0510129485bb3219a8404d03d6354f472790a2e0651fcc826fd91","observation_id":"17668313-6fad-4140-b90e-9243170c9368","resolution":{"observed_at":"2026-08-15T23:23:46.481521Z","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-15T23:23:47.018545Z","title":"Diffusion is spectral autoregression,","venue":null,"work_id":"4c07e332-68c7-4746-beaf-d87f4cc9da46","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.486307Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:d7e5dd3152e0b1cc6e867c51192acccd5bf784f783f02131d1c3c18e87f7da66","observation_id":"e60e09ed-be2d-4e9f-a3b4-6d28018c5cbb","resolution":{"observed_at":"2026-08-15T23:23:47.022855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:47.003819Z","title":"Rethinking graph neural networks for anomaly detection,","venue":null,"work_id":"6c34a6ca-12e7-44bc-aed2-d3e2cb11f805","year":2022},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.491083Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:79ac6aa5b25e40ab55255f695631d10048bcdf48596b445e0f674146ef69b346","observation_id":"6b4f185a-cb77-412d-814d-3f527c3572a5","resolution":{"observed_at":"2026-08-15T23:23:47.008414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.990172Z","title":"Graphmae2: A decoding-enhanced masked self-supervised graph learner,","venue":null,"work_id":"6be4a2ce-0810-4cd2-b167-80c806d1c576","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.495515Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:239223904c98052f589d72bdad77af95bf7f2fa2376723db415d9118031aad02","observation_id":"0bd20929-fec7-4353-b1c1-ddd60fac9842","resolution":{"observed_at":"2026-08-15T23:23:46.994730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.977000Z","title":"Masked graph autoencoder with non-discrete bandwidths,","venue":null,"work_id":"c5f80696-4b2d-4038-9f3c-22b1679969e2","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.499734Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:94870d5b1ed9c82a320fcf0e91ca8ea3ba07e4bfa2247f206741bb4430b9f0a6","observation_id":"fd52b25d-530f-4dec-a624-e1459151b353","resolution":{"observed_at":"2026-08-15T23:23:46.981329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.503792Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.503792Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:3acde3fd0ffc84c168ef968fd31ce8416d96bcc6a0ab6fb0d64ab03575611ad3","observation_id":"3030396c-6537-494e-8737-38dd862aeace","resolution":{"observed_at":"2026-08-15T23:23:46.503792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-21T22:36:44.881291Z","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-15T23:23:46.507841Z","title":"How powerful are graph neural networks?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.507841Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:ddabfedbb343d1c8f857287b0eab3e82fe559ec3cf09893c5e6c6dfecd47cbb2","observation_id":"5294b02e-b578-4554-86b9-7c02bf4bc51f","resolution":{"observed_at":"2026-08-15T23:23:46.507841Z","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-15T23:23:46.955418Z","title":"What’s behind the mask: Understanding masked graph modeling for graph autoencoders,","venue":null,"work_id":"4e8c6ed4-454e-42f9-afc3-19821f35ff75","year":2023},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.512293Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:6c75605ad06df28dbbd76021af0853037bfe765abd6c7a1b78d3c843eaaeabb8","observation_id":"34a685be-a1ea-480c-958d-46262f01e334","resolution":{"observed_at":"2026-08-15T23:23:46.959665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.516620Z","title":"U-net: Convolutional networks for biomedical image segmentation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.516620Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:90ef4e582ca7b8c32400da3a17cbf6baa3bd949e076e90311187c616c0c7eb2c","observation_id":"a20f4055-5dff-4166-8e27-0f16d40864f1","resolution":{"observed_at":"2026-08-15T23:23:46.516620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.521261Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.521261Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:da6236b6d81d17e3ddf133cba77867fe70dd2a0a2901c301ec1057cda1b11be3","observation_id":"c53ba8b4-a0ac-4d31-9727-c3ac66589f41","resolution":{"observed_at":"2026-08-15T23:23:46.521261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.525950Z","title":"Sigmoid-weighted linear units for neural network function approximation in reinforcement learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.525950Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:16fb20b52326b3815a9042714f78d325d3b8af50f607f2d8b38b368c641fd682","observation_id":"50491202-c207-40f9-8aef-e2ac34a44f67","resolution":{"observed_at":"2026-08-15T23:23:46.525950Z","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-15T23:23:46.916160Z","title":"Collective classification in network data,","venue":null,"work_id":"3009d5cc-9ca2-4dc7-a40a-09ff1c80df6e","year":2008},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.529957Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:1de8d82b0f9a73d14de8f4f82f09c2f891a60e1807f0e938e6ff35a533f7c33a","observation_id":"ca34bd39-9fcf-4e3c-8582-91e9b05e475a","resolution":{"observed_at":"2026-08-15T23:23:46.921251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-15T23:23:46.534271Z","title":"Pitfalls of graph neural network evaluation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.534271Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:31eb0025f0a07c5ea962abe397276f7b4f7f85547e01174eab02812402d63dc0","observation_id":"1ba69655-07d2-456d-88d2-9cb32b6e524d","resolution":{"observed_at":"2026-08-15T23:23:46.534271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.538363Z","title":"Open graph benchmark: Datasets for machine learning on graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.538363Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:76cf69591a7639e72a7ef8da8417ef21650d6d57326efcc7b5f7f9e618d3b9cf","observation_id":"d80e3c04-a0a5-46e9-954e-23a3779e7134","resolution":{"observed_at":"2026-08-15T23:23:46.538363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:23:46.542367Z","title":"Deep graph kernels,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.542367Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:b634be93ba91f0099a08227c44ce61d5b90993158048b76b47a83a723763b9c9","observation_id":"5d429584-331f-475c-adfa-b5d084b80b57","resolution":{"observed_at":"2026-08-15T23:23:46.542367Z","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-15T23:23:46.886749Z","title":"Libsvm: a library for support vector,","venue":null,"work_id":"788397b4-5616-4517-bda1-865c8dbf1fed","year":2001},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.546054Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:2111264a08ad31514b96453ff6b898a60b413ec39776786dcd3c4d36273a0fb3","observation_id":"89480807-a04f-4d79-8776-a51e13f50c37","resolution":{"observed_at":"2026-08-15T23:23:46.890785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-15T23:23:46.550694Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.550694Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:5294fba6dfcb9f889f1f92100ece11d1f7041d9fb5700338763f5b61ead08802","observation_id":"85498dcc-615e-4964-b631-3d7f1ed8f279","resolution":{"observed_at":"2026-08-15T23:23:46.550694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-15T23:23:46.555159Z","title":"Decoupled weight decay regularization,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.555159Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:e276aab84f6a0a3c0256f3fd671509da02f7209292b5a869acb5756f43a71bfe","observation_id":"b51f8256-3919-4442-b33f-eaedd570be0c","resolution":{"observed_at":"2026-08-15T23:23:46.555159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.03983","last_updated":"2017-05-03T16:28:09Z","snapshot_observed_at":"2026-07-06T05:06:55.589962Z","submitted_at":"2016-08-13T13:46:05Z","title":"SGDR: Stochastic Gradient Descent with Warm Restarts","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.03983","snapshot_observed_at":"2026-08-15T23:23:46.559878Z","title":"Sgdr: Stochastic gradient descent with warm restarts,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.559878Z"},"links":{"cited_paper":"/paper/1608.03983","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:8d5736c747396604b4360c140c1edfde37f5a418c641894f2352c5481907f0ea","observation_id":"03d6c645-d8d7-45ea-8378-5fbe80336135","resolution":{"observed_at":"2026-08-15T23:23:46.559878Z","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-15T23:23:46.872795Z","title":"Rethinking graph masked autoencoders through alignment and uniformity,","venue":null,"work_id":"2160ec62-f74e-4b67-acf8-2b59f2eb47e7","year":2024},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.564122Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:5581d4464870bdfc145c57d4e5a961ba16f6667cc6ecbb3fe62929ebd7ea213c","observation_id":"5685ddbf-7944-4f7b-aa94-2f7ea1cf8f1d","resolution":{"observed_at":"2026-08-15T23:23:46.877605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.859238Z","title":"Infogcl: Information- aware graph contrastive learning,","venue":null,"work_id":"3841a035-b8b4-4c6e-a3fc-7317495dd73c","year":2021},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.568287Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:b515dade7952596e5941fcff0006aa96021613fbd1f90baab4cbeb4ffd4178b5","observation_id":"757cd9df-eb0b-427c-a0a9-6ef341fe9624","resolution":{"observed_at":"2026-08-15T23:23:46.863770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:23:46.844060Z","title":"Weisfeiler-lehman graph kernels","venue":null,"work_id":"91096759-3ff2-464a-ad01-26b87fe1ab6f","year":2011},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.572532Z"},"links":{"citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:b47d5849a5076fd78813733179ed76b9a5b634fbf09986a8ec6ba0f3d0dce159","observation_id":"b45c285f-be87-4781-ad85-6931328a810b","resolution":{"observed_at":"2026-08-15T23:23:46.850003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.05005","last_updated":"2017-07-17T05:09:03Z","snapshot_observed_at":"2026-08-14T20:47:18.548060Z","submitted_at":"2017-07-17T05:09:03Z","title":"graph2vec: Learning Distributed Representations of Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.05005","snapshot_observed_at":"2026-08-15T23:23:46.577193Z","title":"graph2vec: Learning distributed representations of graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.577193Z"},"links":{"cited_paper":"/paper/1707.05005","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:5613001dff81c94e1e1dd015f9f5c45cd9730b6f3d2454014c7d86b0479ec23d","observation_id":"6d700a00-226f-4040-95e8-4a2209acf9f0","resolution":{"observed_at":"2026-08-15T23:23:46.577193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":35},"total_outbound_references":69},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 1 inbound Pith citation observation for arXiv:2505.04956."}