{"as_of":"2026-08-14T20:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73932f04592e37348e4355461b304f40a818106d345379b33c9670ebf4bf7d4b","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:02:20.632825Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/1908.08402/citation-record","integrity":"/paper/1908.08402/integrity","json":"/paper/1908.08402/citation-record.json","paper":"/paper/1908.08402"},"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-14T12:02:21.126751Z","title":"Semi-supervised classiﬁcation with graph convolutional networks,","venue":null,"work_id":"7c1d0ff9-369b-4965-94e5-94c3a0f98056","year":2017},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.469352Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:34ef4528880c7ce5fee97ddaa07f7eedaf42f6cfce04630aa1de4911a6ea0888","observation_id":"90628288-406b-4322-92e9-f0714e692256","resolution":{"observed_at":"2026-08-14T12:02:21.130642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.115796Z","title":"Egonet: identiﬁcation of human disease ego-network modules,","venue":null,"work_id":"90f8c10c-a130-46a9-b1a9-de585929a2cf","year":2014},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.474156Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:e8a0b4fff9fab6324e517b6e7c2d8273e196a0603a5b191f7bf25547cd9ab177","observation_id":"f05c4ab8-eb6b-453e-bbf2-a500259d21b0","resolution":{"observed_at":"2026-08-14T12:02:21.119529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.105076Z","title":"Moleculenet: a benchmark for molecular machine learning,","venue":null,"work_id":"dbee4baa-ee4a-4d34-9a03-5a19946cc807","year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.478248Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:8b03a48f52b0d5458fe0cb08781f342bbaa230210b921f36fb85cd772714d831","observation_id":"18de704c-eb9e-49cf-8ae6-bad5d221bdce","resolution":{"observed_at":"2026-08-14T12:02:21.108965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.093949Z","title":"Interaction networks for learning about objects, relations and physics,","venue":null,"work_id":"f52a5b37-078a-44ee-9c98-661c4baaeb0c","year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.482699Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:2f4bd80217bcc6840b8a2ec949e6dacd77a44a4f9d379195ef3aead150178083","observation_id":"d4800486-9287-41d4-a9ba-e82143a28097","resolution":{"observed_at":"2026-08-14T12:02:21.098203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.082886Z","title":"node2vec : scalable feature learning for networks,","venue":null,"work_id":"3714654d-6949-4b38-ab5c-7ead0971d37f","year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.486553Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:3342313634fc98a6a0ddce884b32c6e471ce0d2d32a736682bc974f8895e2329","observation_id":"91657502-ef1d-4f81-abf6-d0bbb19ff6ca","resolution":{"observed_at":"2026-08-14T12:02:21.086768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.02801","last_updated":"2017-12-22T20:42:06Z","snapshot_observed_at":"2026-08-12T18:20:11.300436Z","submitted_at":"2017-05-08T09:47:38Z","title":"Graph Embedding Techniques, Applications, and Performance: A Survey","version":4},"cited_work":{"arxiv_id":"1705.02801","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.02801","snapshot_observed_at":"2026-08-14T12:02:20.798675Z","title":"Graph Embedding Techniques, Applications, and Performance: A Survey","venue":"cs.SI","work_id":"d32ab2fd-1522-4b9c-8664-383ccdf75728","year":2017},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.490521Z"},"links":{"cited_paper":"/paper/1705.02801","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:63470ddec4d7f34335614d0583998bd3e2972f5def8669880ab5249ffc8b5253","observation_id":"b1e070f9-8803-4fc4-b832-36ab8062cf84","resolution":{"observed_at":"2026-08-14T12:02:20.803205Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.071723Z","title":"Pytorch: An imperative style, high-performance deep learning library,","venue":null,"work_id":"6856cf53-d9e6-45ba-a911-9c4f3ab3f5ad","year":2019},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.495363Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:c0f5494df08562ed236b174ffbde6fde21f4b49841718b9f5b41bc0b5e02ea35","observation_id":"e6ecb329-83d8-4aa4-b6ec-4a4df3fb9324","resolution":{"observed_at":"2026-08-14T12:02:21.075789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.058985Z","title":"Laplacian eigenmaps and spectral techniques for embedding and clustering,","venue":null,"work_id":"fb08df89-9f1d-4557-aaab-300d3810c4a2","year":2002},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.499241Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:0410452b1335ffea22ddd3ad50f1028cec1f59f0713545f8802b7023cf1d3ba7","observation_id":"058401b3-649c-459b-bcc8-77a359dc45a4","resolution":{"observed_at":"2026-08-14T12:02:21.063036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.047627Z","title":"Distributed large-scale natural graph factorization,","venue":null,"work_id":"b64b0786-5741-468d-b56d-4cb1cd38d1f1","year":2013},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.503207Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:e704aab11382a1b3898e24558eb29baecdc9d3e88291578c871d0cc8752f8e20","observation_id":"4140d6c2-c9b9-4ff4-a651-2e9c7e883304","resolution":{"observed_at":"2026-08-14T12:02:21.051711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.035122Z","title":"DeepWalk: online learning of social representations,","venue":null,"work_id":"66d626c6-919c-4754-801b-613ed6087b08","year":2014},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.507006Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:ebd1422fa8e7de4db17d659969c202b8bdd075c4372549adfaf737d79a8b4552","observation_id":"241622db-795e-4fe6-bfc0-e0e691267428","resolution":{"observed_at":"2026-08-14T12:02:21.039456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:21.023600Z","title":"Autoencoders, unsupervised learning, and deep architectures,","venue":null,"work_id":"ec7f108d-1d1a-48ff-846c-0f685be85fce","year":2012},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.510565Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:d5b4f6dfbdc9c34c05567b84494350689c180758c44fd96fe8ae303f6ea26321","observation_id":"440b8b7f-a7c9-4239-9af5-c76cebbe7684","resolution":{"observed_at":"2026-08-14T12:02:21.027323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:04:05.764870Z","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-14T12:02:20.514649Z","title":"Variational graph auto-encoders,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.514649Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:178675b29effb2e974fc24acd62111e649865b8b123e980559829951d72aa306","observation_id":"5dafe003-5a6e-4792-81c6-789beebb36eb","resolution":{"observed_at":"2026-08-14T12:02:20.514649Z","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-14T12:02:21.011252Z","title":"Stwalk: learning trajectory representations in temporal graphs,","venue":null,"work_id":"5183d5f7-7ace-42c5-ab3e-fae123b9da41","year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.518852Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:bcc491e993f760882ef47685b1cde63edacaed1de860ae39d145919a4a2d9de6","observation_id":"bf6950c6-2b70-49de-b070-ff0fc7ddb187","resolution":{"observed_at":"2026-08-14T12:02:21.015564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.999054Z","title":"Netwalk: A ﬂexible deep embedding approach for anomaly detection in dynamic networks,","venue":null,"work_id":"0ed4b08c-f6f6-445c-a190-0a10547e373b","year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.522451Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:1400883a8272bde9236b9ce6df045f20d5459279753dd44ee349da1d9ff29730","observation_id":"e80cb1b5-328e-4fa3-9f9b-627c7f1d062a","resolution":{"observed_at":"2026-08-14T12:02:21.003422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.986764Z","title":"Continuous-time dynamic network embeddings,","venue":null,"work_id":"db300016-de2a-4a17-8010-bbe93d9b863e","year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.526199Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:256c73735fbef63a95e6acef50a46270980915d7bada4b5d6af4e41a95e4a2fb","observation_id":"65a636b6-fee6-475b-8149-dcdaa2828142","resolution":{"observed_at":"2026-08-14T12:02:20.991019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.11273","last_updated":"2018-05-29T07:12:04Z","snapshot_observed_at":"2026-08-14T19:10:05.291699Z","submitted_at":"2018-05-29T07:12:04Z","title":"DynGEM: Deep Embedding Method for Dynamic Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.11273","snapshot_observed_at":"2026-08-14T12:02:20.529904Z","title":"Dyngem: Deep embedding method for dynamic graphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.529904Z"},"links":{"cited_paper":"/paper/1805.11273","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:cb712a504dd756aab7b4dff2f532e13d9c0669d718ced64d0ceb42b86ff74609","observation_id":"8ad0c015-74fa-40a1-824f-00cf8ec87564","resolution":{"observed_at":"2026-08-14T12:02:20.529904Z","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-14T12:02:20.974492Z","title":"Structural deep network embedding,","venue":null,"work_id":"3d756124-5617-4269-807b-a8a843a2de41","year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.534123Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:e8b8c7362cafdae10afae7c3d04f958804e38cba818590c82f078cfa2803f90f","observation_id":"34dab750-ad5f-4211-825b-303942b80b3e","resolution":{"observed_at":"2026-08-14T12:02:20.979036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05641","last_updated":"2016-04-23T23:14:39Z","snapshot_observed_at":"2026-07-06T04:36:52.555912Z","submitted_at":"2015-11-18T02:09:20Z","title":"Net2Net: Accelerating Learning via Knowledge Transfer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05641","snapshot_observed_at":"2026-08-14T12:02:20.537938Z","title":"Net2net: Accelerating learning via knowledge transfer,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.537938Z"},"links":{"cited_paper":"/paper/1511.05641","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:02165d005c905fb745d870059d6847c8c71782214b0426695c1eb62abc803c6f","observation_id":"808eaa92-d94d-44de-b1d9-5515a4faed9b","resolution":{"observed_at":"2026-08-14T12:02:20.537938Z","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-14T12:02:20.961776Z","title":"dyngraph2vec: Captur- ing network dynamics using dynamic graph representation learning,","venue":null,"work_id":"1405b23b-7710-45cf-bc3e-96a3d8383562","year":2019},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.542181Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:2e344f48dab5abe90f3bad9bea2c90e173106116e0aa6e9bdb7ebc952c715eef","observation_id":"b341f52d-25c1-48c9-ab5d-71a7590991e3","resolution":{"observed_at":"2026-08-14T12:02:20.965995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.949672Z","title":"Dynamic graph convolutional networks,","venue":null,"work_id":"7ff667e9-0752-4990-8ef8-2ea30fb2a9ac","year":2019},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.546341Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:4387250cb2851530c8f32f9bd9dff26f8aff9280fe839ab74c58ea7ecf76fad7","observation_id":"dad9b5f0-ed4f-4d30-afea-60aa9ea4eb56","resolution":{"observed_at":"2026-08-14T12:02:20.953819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.937547Z","title":"Structured sequence modeling with graph convolutional recurrent networks,","venue":null,"work_id":"4400a5aa-0dc8-4566-97c4-aa9b97539e65","year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.550428Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:676bd2b5e778f2e2a6387bc73b504389249b99261e242d8545e2883dde95caef","observation_id":"da1161f7-17eb-434a-8233-85ca49dcf4b2","resolution":{"observed_at":"2026-08-14T12:02:20.941812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.926267Z","title":"Gcn-gan: A non-linear temporal link prediction model for weighted dynamic networks,","venue":null,"work_id":"73adc0eb-440d-45a0-81b9-875cb70ca7c4","year":2019},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.554209Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:b4ae8dcad61471cd973d719dd55c3f86ed97a00712ed6afde03566d031c18c31","observation_id":"43faf8df-c1b1-4a10-b57c-3c7e40c8dd06","resolution":{"observed_at":"2026-08-14T12:02:20.930071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.04206","last_updated":"2021-10-02T12:51:34Z","snapshot_observed_at":"2026-08-14T17:45:34.572194Z","submitted_at":"2018-12-11T03:38:52Z","title":"GC-LSTM: Graph Convolution Embedded LSTM for Dynamic Link Prediction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.04206","snapshot_observed_at":"2026-08-14T12:02:20.558219Z","title":"Gc-lstm: Graph convo- lution embedded lstm for dynamic link prediction,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.558219Z"},"links":{"cited_paper":"/paper/1812.04206","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:210b32e3115cd78cc90a6476bdf6d9d2e8c22df9ad4a22530a8c01e66c636b71","observation_id":"75f26379-94d2-466d-b97e-0293a82934b1","resolution":{"observed_at":"2026-08-14T12:02:20.558219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10191","last_updated":"2019-11-18T18:42:50Z","snapshot_observed_at":"2026-08-14T17:10:45.187687Z","submitted_at":"2019-02-26T20:07:34Z","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10191","snapshot_observed_at":"2026-08-14T12:02:20.562574Z","title":"Evolvegcn: Evolving graph convolutional networks for dynamic graphs,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.562574Z"},"links":{"cited_paper":"/paper/1902.10191","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:e7ae37e5d54703a16a6aeb9b7c18f142f317c8f5e07a631ff6a7e3c2761c2772","observation_id":"1a74fa93-a04c-4456-8863-1085eaab39f2","resolution":{"observed_at":"2026-08-14T12:02:20.562574Z","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-14T12:02:20.915413Z","title":"Revisiting spatial- temporal similarity: A deep learning framework for trafﬁc prediction,","venue":null,"work_id":"21190d7c-0615-4b15-b30f-675a470b7b45","year":2019},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.566501Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:aac6f6f02cbb3fe5060c52e8ec6360c25a60692b75d55d818e617bc694422ef8","observation_id":"7de00623-c8be-4280-b500-c33041f35350","resolution":{"observed_at":"2026-08-14T12:02:20.919260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.01926","last_updated":"2018-02-22T19:52:51Z","snapshot_observed_at":"2026-08-14T20:49:13.849412Z","submitted_at":"2017-07-06T18:20:59Z","title":"Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.01926","snapshot_observed_at":"2026-08-14T12:02:20.570022Z","title":"Diffusion convolutional re- current neural network: Data-driven trafﬁc forecasting,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.570022Z"},"links":{"cited_paper":"/paper/1707.01926","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:1d370e1fdbe1fafe3124ea8ee784315256b5081284f6eab9f9bb554c602d457f","observation_id":"9aa0bc45-233c-43c7-8459-47ef54b78bd4","resolution":{"observed_at":"2026-08-14T12:02:20.570022Z","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-14T12:02:20.574306Z","title":"Long short-term memory,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.574306Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:7f21678946bd4754127880ee70d32215bc89317b54efda09cd16003f0ff936b1","observation_id":"1157723a-e3dd-48cc-9dee-a0971d2570d5","resolution":{"observed_at":"2026-08-14T12:02:20.574306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.1078","last_updated":"2014-09-03T00:25:02Z","snapshot_observed_at":"2026-07-06T03:45:28.546418Z","submitted_at":"2014-06-03T17:47:08Z","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.1078","snapshot_observed_at":"2026-08-14T12:02:20.578376Z","title":"Learning phrase representations using rnn encoder-decoder for statistical machine translation,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.578376Z"},"links":{"cited_paper":"/paper/1406.1078","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:9371396ac4eac47c19fcec9bf22bbf17f48ee3b9cda098654d66f5543195a57a","observation_id":"eb41afe3-6f1d-4c46-abb0-d5c9bbbc77bb","resolution":{"observed_at":"2026-08-14T12:02:20.578376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.10247","last_updated":"2018-01-30T22:36:16Z","snapshot_observed_at":"2026-08-14T19:50:30.215861Z","submitted_at":"2018-01-30T22:36:16Z","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.10247","snapshot_observed_at":"2026-08-14T12:02:20.582365Z","title":"Fastgcn: fast learning with graph convolutional networks via importance sampling,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.582365Z"},"links":{"cited_paper":"/paper/1801.10247","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:cf7e6a746a19815d4e45e79ebb337520ae4be0a886eaab238c3f8d88a9e1c693","observation_id":"7197ed30-8535-465e-ba4f-aacffb23edd6","resolution":{"observed_at":"2026-08-14T12:02:20.582365Z","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-14T12:02:20.897833Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":"19133b02-1cdd-4c35-8fab-39168ca63785","year":2017},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.586329Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:a0b13af816e96891cb7db567ac6c6bb78f2caf7b3d0d048137279f0e15289f46","observation_id":"f0bcced5-0002-4e8d-8977-91d21a79f751","resolution":{"observed_at":"2026-08-14T12:02:20.901907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-08-14T05:15:12.190552Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-14T12:02:20.589968Z","title":"Layer normalization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.589968Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:1476bb25e40638311cddf32375bbb5935e2843baee8175f46745250fbdd61258","observation_id":"4f878a2c-9438-417f-ab51-907ddca79eb1","resolution":{"observed_at":"2026-08-14T12:02:20.589968Z","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-14T12:02:20.593970Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.593970Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:6d40c5872f621b5d1ff28bfb2d8acc66d8732379d089f1f6b540be9f15c6fc14","observation_id":"958bff75-d6ba-469b-b096-4975c6ce491a","resolution":{"observed_at":"2026-08-14T12:02:20.593970Z","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-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-14T12:02:20.597642Z","title":"Auto-encoding variational bayes,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.597642Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:30a9024fea39053907bcbe200a48b585c7fa25ccb05e53fde9033f5720ccf08e","observation_id":"5b83ba1b-38a0-46d4-b942-63459d22bc60","resolution":{"observed_at":"2026-08-14T12:02:20.597642Z","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-14T12:02:20.879384Z","title":"Temporal graph offset reconstruction: Towards tempo- rally robust graph representation learning,","venue":null,"work_id":"530a1d57-4d1f-4035-bb8f-85bafc01af57","year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.601812Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:b4b0ecc3420df5fa041b1e237543472a3009491aacb193f0baf3431b54ca886c","observation_id":"bb3c0c74-56de-4b1a-8ce8-f2720c25da29","resolution":{"observed_at":"2026-08-14T12:02:20.883399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.605387Z","title":"SNAP Datasets: Stanford large network dataset collection,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.605387Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:65dfa6a779ae52f3e29fe12e795e4ee40b5c06f07efbf8ea457c41e2c5bedee8","observation_id":"43f7c06c-9840-43e7-8728-9bce5ba0f849","resolution":{"observed_at":"2026-08-14T12:02:20.605387Z","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-14T12:02:20.858396Z","title":"Konect: the koblenz network collection,","venue":null,"work_id":"7e854d02-12ca-4290-a90c-22b3f7cd4029","year":2013},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.609386Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:50608bb566496706f0d25636cb2e09d845fca2b422030c97b4db4d577612e380","observation_id":"fd6a0164-9a0b-4cdc-a994-a5848ecccf3a","resolution":{"observed_at":"2026-08-14T12:02:20.862684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.846411Z","title":"Stochastic blockmodels and community structure in networks,","venue":null,"work_id":"00144ddd-bae1-4530-9ea1-2f95c35ada5e","year":2011},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.613227Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:8e1e3ee8c738104f53895941cf8c4d46052bca7862267edabfa385185d83533a","observation_id":"0718f075-1a8f-46da-a441-9a28ca940723","resolution":{"observed_at":"2026-08-14T12:02:20.850472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.835235Z","title":"Deep topology classiﬁcation: A new approach for massive graph classiﬁcation,","venue":null,"work_id":"8aa11d8f-73f3-410e-b38c-492bab02e20b","year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.617236Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:46053b5679f816d6ab9d991ee3d4905b2f2ada47995812246656716704c3013e","observation_id":"59b66404-3b09-41af-b9f7-b5a54fc90885","resolution":{"observed_at":"2026-08-14T12:02:20.839049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.822951Z","title":"Efﬁcient comparison of massive graphs through the use of graph ﬁngerprints,","venue":null,"work_id":"da770a95-5296-4876-af98-a6c52a0c9381","year":2016},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.621235Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:cec565e5d3044575b6cc86ea6a983603b359a79b6b78cc4da55303bd6890a007","observation_id":"0769f54f-d015-4a43-ac3c-8f0cde1660ef","resolution":{"observed_at":"2026-08-14T12:02:20.827396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10734","last_updated":"2018-11-26T23:05:38Z","snapshot_observed_at":"2026-08-14T17:52:58.704747Z","submitted_at":"2018-11-26T23:05:38Z","title":"DynamicGEM: A Library for Dynamic Graph Embedding Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10734","snapshot_observed_at":"2026-08-14T12:02:20.624916Z","title":"Dynamicgem: A library for dynamic graph embedding methods,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.624916Z"},"links":{"cited_paper":"/paper/1811.10734","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:e4061588cfea9a46678d00b05fef3423149443ef8b3b5a82d852805c3a0bb296","observation_id":"ad5746b3-4ce8-4f57-a0c7-c746d0f635ba","resolution":{"observed_at":"2026-08-14T12:02:20.624916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.08329","last_updated":"2019-02-22T01:40:51Z","snapshot_observed_at":"2026-08-14T17:12:54.486152Z","submitted_at":"2019-02-22T01:40:51Z","title":"E-LSTM-D: A Deep Learning Framework for Dynamic Network Link Prediction","version":1},"cited_work":{"arxiv_id":"1902.08329","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.08329","snapshot_observed_at":"2026-08-14T12:02:20.664849Z","title":"E-LSTM-D: A Deep Learning Framework for Dynamic Network Link Prediction","venue":"cs.SI","work_id":"35c4ccdb-eac3-4f29-aa8b-5f85cdc7e9e6","year":2019},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.628823Z"},"links":{"cited_paper":"/paper/1902.08329","citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:fc3620f55d5a98f6bd12b0b47abf3b248e7f1f17afd5096d47e1b6fec03297ab","observation_id":"bb18fcf1-2f20-4015-8954-96e4660d5692","resolution":{"observed_at":"2026-08-14T12:02:20.671446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T12:02:20.811301Z","title":"Generating text with recurrent neural networks,","venue":null,"work_id":"ef64368d-0737-4b2c-8597-af7343de29b5","year":2011},"citing_paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:20.632825Z"},"links":{"citing_paper":"/paper/1908.08402"},"observation_digest":"sha256:5d86b7d147e68de3bc62bdbd88120298c27fe2518f5e40d8f9f288c76475fea0","observation_id":"1473ed40-ddb5-46f4-b91d-578b4a96be3e","resolution":{"observed_at":"2026-08-14T12:02:20.815184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08402","last_updated":"2019-11-21T11:24:03Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-14T18:21:57.426991Z","submitted_at":"2019-08-21T11:15:32Z","title":"Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variational Graph Convolutions"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":2,"verified_fuzzy":26},"total_outbound_references":42},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:1908.08402."}