{"as_of":"2026-08-17T09:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40fb6c59f218bbe78e216caddddea048978ce8af8ae6df12c1d50a6f8dfab87d","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:51:42.057261Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.02441/citation-record","integrity":"/paper/1908.02441/integrity","json":"/paper/1908.02441/citation-record.json","paper":"/paper/1908.02441"},"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-14T14:51:42.663690Z","title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","venue":null,"work_id":"f5284bf0-bc94-4438-bf91-92b72492695c","year":2002},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.875488Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:c53a7d32bab452218ba75c17e09c46663a1d0d75ab4538ada7534f10b1fcb95a","observation_id":"2033f863-1ccc-4778-bbe7-c67b4d81bcc7","resolution":{"observed_at":"2026-08-14T14:51:42.668734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:41.880603Z","title":"Geometric deep learning: going beyond euclidean data","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.880603Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:1f4e74ce5e9848eca88f9827b532da6dd7d7e43205e800e9305afac492d47ec7","observation_id":"bd6f33fb-4bfe-4795-a33a-588921e47def","resolution":{"observed_at":"2026-08-14T14:51:41.880603Z","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-14T14:51:42.640017Z","title":"Deep neural net- works for learning graph representations","venue":null,"work_id":"884e0fd6-b8d8-40bb-a3c7-0ab57ac8a090","year":2016},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.885305Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:1b3225a162bdffd9dce8ea8bcc0188c0ac481d909588848e110639507e25efbe","observation_id":"17ef49d5-79e3-484c-8639-8721c92a6e32","resolution":{"observed_at":"2026-08-14T14:51:42.644525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.625216Z","title":"Relational topic models for document networks","venue":null,"work_id":"ac6c25d8-cdf3-4016-99eb-e981ac71194e","year":2009},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.889872Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:4bf076ff4ff06e0f850a28f9caacfb1632993aad211865673f62516e226cf3fc","observation_id":"892a150e-07d4-4984-8e00-effb35f9688f","resolution":{"observed_at":"2026-08-14T14:51:42.630152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.610708Z","title":"Spectral graph the- ory","venue":null,"work_id":"91bc22cf-4a53-4cb8-a9b2-f1b1d2e1b37c","year":1997},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.894696Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:23a62e628029f24ce35831592106db64a6f09aa2bd5d776f4651cd7ce1f74bfd","observation_id":"5022e6f5-c1d4-4bc5-a11a-ca149fa8909d","resolution":{"observed_at":"2026-08-14T14:51:42.615435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.594801Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering","venue":null,"work_id":"8653ea35-c12c-4377-b9e6-6841c801c973","year":2016},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.899173Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:4bf6c2c7ef6be72390d28248761200c09cc8c6435372d91a3eee884cbbd6a8a2","observation_id":"1c30bff0-2d96-46f5-bc96-8a69c0f5247b","resolution":{"observed_at":"2026-08-14T14:51:42.600711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.580715Z","title":"Convolutional networks on graphs for learn- ing molecular fingerprints","venue":null,"work_id":"6b553c0d-3817-4f4a-b83e-86d6e02deff1","year":2015},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.903861Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:541fbb525e260d20512e97e97aa44516512f8447fa3850898ff52d5e3cdc2b0e","observation_id":"2e707074-90d8-483b-a26c-f651cdcdcbab","resolution":{"observed_at":"2026-08-14T14:51:42.585439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.565418Z","title":"From few to many: Illumination cone models for face recognition under variable lighting and pose","venue":null,"work_id":"68b3f6c0-bced-4c4d-916b-15b98f1979d3","year":2001},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.909227Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:dcc64ed515c16dea7e84f69e23e813bcd966dc0a437a19980e1fea75763d0fc1","observation_id":"4e582510-2f6c-41f0-b216-2ef0196e28bd","resolution":{"observed_at":"2026-08-14T14:51:42.570924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.549213Z","title":"On the asymptotic spectrum of random walks on infinite families of graphs","venue":null,"work_id":"73656f34-1fe0-43b6-a21f-d0a3766c3a23","year":1997},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.913864Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:87ce12d13de62d8614c8df89afad5dc11a0b48d85d61b591520d30618979ce7a","observation_id":"79165ac3-5c7b-41c0-923a-48ff28c9ec33","resolution":{"observed_at":"2026-08-14T14:51:42.554212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.532006Z","title":"Wavelets on graphs via spectral graph theory","venue":null,"work_id":"c2ee3f76-b75b-4285-9297-32e417301f65","year":2011},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.918640Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:0bb0684204f26de9d25bfcaa406ee6c34661e4bf248546cc6e0a7b38e4520e08","observation_id":"8427465d-0cc5-457e-bc04-aec2400d2343","resolution":{"observed_at":"2026-08-14T14:51:42.537304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.516302Z","title":"Deep subspace clustering networks","venue":null,"work_id":"f8fc6851-921b-4400-bfbe-fe4416f0f174","year":2017},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.923619Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:3668c3c1abb69eb43b0b787a6f4c5c0ad39358eac679132a28d2bf154d53f979","observation_id":"d8947e0a-3bd3-49ee-bf93-2d2c5a72a8b1","resolution":{"observed_at":"2026-08-14T14:51:42.521675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T18:51:16.666127Z","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-14T14:51:41.928037Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.928037Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:e4cf95bc0a46c3d05f40dfd4a5f3cdeabb4fe2bede1834c2e0eb0a1903b44b88","observation_id":"a5f163c5-949f-45c7-b585-2e3217643ba0","resolution":{"observed_at":"2026-08-14T14:51:41.928037Z","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-14T14:51:42.501528Z","title":"Variational graph auto- encoders","venue":null,"work_id":"2e6b3c7d-cba8-4db7-872e-7016d8dee6ba","year":null},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.933290Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:c010f9b319c866fa264a4586e1f9febc9d55b28158feffb549684b05b0becdea","observation_id":"63ce8bec-00a8-47d8-a7a8-427363703680","resolution":{"observed_at":"2026-08-14T14:51:42.506356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.487117Z","title":"Kipf and Max Welling","venue":null,"work_id":"fe0b65b7-89d6-4982-94a4-2932c07f6584","year":2017},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.937621Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:f3f29bf00c7a584b3df8c09459adabae0389ed0f13f2553443a6b6df261faa1e","observation_id":"2ab4eadd-12f9-402b-80b1-3c9e360a878a","resolution":{"observed_at":"2026-08-14T14:51:42.492069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.472392Z","title":"Life in the network: the coming age of computational social science","venue":null,"work_id":"bbf41856-dae3-4fc4-985e-f4f6fed46707","year":2009},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.941802Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:9f9e6ba97dd484402580f2c38cef44b7a3a6f332783adc3e1f9926b6887362f2","observation_id":"019425d6-f2cf-4d7c-8c1e-7dac518b1d60","resolution":{"observed_at":"2026-08-14T14:51:42.477135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:41.946849Z","title":"The mnist database of handwritten digits","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.946849Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:6286dcb3563166d662573ad04e6e90d923e82fc9ea6d19d61919912068341580","observation_id":"44e94af2-3c62-40ea-af9f-e95e041160df","resolution":{"observed_at":"2026-08-14T14:51:41.946849Z","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-14T14:51:42.447856Z","title":"Learning to discover social circles in ego networks","venue":null,"work_id":"b3a697e3-22e7-4972-b3be-33e20426eafd","year":2012},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.951716Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:b2535fe503d669d3954d6f5362621dd9c713d5b2a8afbcd112c7d5cc0a2103e2","observation_id":"979581bf-f0d2-4e61-8655-c4369d86a787","resolution":{"observed_at":"2026-08-14T14:51:42.452743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.432585Z","title":"Note on the normalized laplacian eigenvalues of signed graphs","venue":null,"work_id":"b8bab56e-a01b-4e49-bbe3-0cee5bad3774","year":2009},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.956591Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:fe365c9acf6828cf8644132a5fa7697775961120502ed2b811714cf93e7bd2a7","observation_id":"36d3f1ec-511b-4867-ab58-ab0b91508894","resolution":{"observed_at":"2026-08-14T14:51:42.437711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.418337Z","title":"Deeper insights into graph convolutional networks for semi-supervised learn- ing","venue":null,"work_id":"be5dcf42-cae0-465d-b319-f32bf142851d","year":2018},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.961287Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:c8ebd23f63542026f9e12acd0094d58a607ee38a703be66a42b7ebeb2791fd1a","observation_id":"73ddcbfe-1dac-4da8-a597-c13256516b16","resolution":{"observed_at":"2026-08-14T14:51:42.423145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.00268","last_updated":"2018-04-03T18:14:47Z","snapshot_observed_at":"2026-08-14T20:07:59.684487Z","submitted_at":"2017-12-01T10:34:19Z","title":"Deformable Shape Completion with Graph Convolutional Autoencoders","version":4},"cited_work":{"arxiv_id":"1712.00268","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.00268","snapshot_observed_at":"2026-08-14T14:51:42.093391Z","title":"Deformable Shape Completion with Graph Convolutional Autoencoders","venue":"cs.CV","work_id":"f7bc250d-4b18-4b18-857a-c4fa463b7fa0","year":2017},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.966298Z"},"links":{"cited_paper":"/paper/1712.00268","citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:cf7b0abd09a2028ec8ce7664fa9f6fae6294707102de0377aa4e43f5ff7e1920","observation_id":"dcc6ba37-b6ad-4de5-b331-d2e6e4ae3645","resolution":{"observed_at":"2026-08-14T14:51:42.100540Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.402578Z","title":"Least squares quantization in pcm","venue":null,"work_id":"8dc00235-6d40-466b-99d5-64e07fa5a781","year":1982},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.971591Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:7991cf1d9393ddff82f6bcc311864d7c73c810984e02dd1c7b183be0761b2455","observation_id":"6ad96c13-c756-45cd-9e11-bf5d00671f2e","resolution":{"observed_at":"2026-08-14T14:51:42.408379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.387920Z","title":"Robust and efficient subspace segmentation via least squares regression","venue":null,"work_id":"8de916e6-2143-4f31-8b97-879baeb467ad","year":2012},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.976369Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:591f4a92fd61f56e88e55574fdb6cdb11f8e0a3c33363a2161504e156c97ca1f","observation_id":"eb63fdb1-9dad-4d8a-a721-462cf945c263","resolution":{"observed_at":"2026-08-14T14:51:42.392787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.374107Z","title":"Visualiz- ing data using t-sne","venue":null,"work_id":"10c9dc7c-6ce4-4d0b-ac47-9836487883c9","year":2008},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.981645Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:507442e87f6d7c07063f99e76880b2ae0eed154b4dc57ada0a7b2dd9c404e7ab","observation_id":"1c45ba74-680d-4404-be9e-6766accc9137","resolution":{"observed_at":"2026-08-14T14:51:42.378579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.358277Z","title":"Ge- ometric matrix completion with recurrent multi-graph neural networks","venue":null,"work_id":"ea6cfab5-b40a-47bb-9a47-cd58b7f5467e","year":2017},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.986850Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:70f8cb1d4ff94785fa091ce905781a132a5bccf1837f3fb108d09ad504cecffa","observation_id":"72bc894d-a49e-40ef-b149-70ba17da2549","resolution":{"observed_at":"2026-08-14T14:51:42.363192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.343831Z","title":"Columbia object image library (coil-20)","venue":null,"work_id":"f82de536-781b-4959-8cef-fdf9c05fbef2","year":1996},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.991209Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:b53fe8031a7e2a0d34260a39b48f34b102747a7e3deb1da5c1b99edc6a60a029","observation_id":"5bcb0455-8b52-460a-8e86-ad5202bf451b","resolution":{"observed_at":"2026-08-14T14:51:42.348599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.329054Z","title":"On spectral clustering: Analysis and an algorithm","venue":null,"work_id":"7a973704-3f03-4a9f-8975-27e1a9330642","year":2002},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:41.995839Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:6a12b2c706615431b1f40e13287d09c161abb95633130e24e2ada663f8b7324f","observation_id":"1fe09d03-feff-4c32-9294-623875cccc84","resolution":{"observed_at":"2026-08-14T14:51:42.334147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.313996Z","title":"Adversarially regularized graph autoen- coder for graph embedding","venue":null,"work_id":"bc546c00-9c9f-4013-b491-41dd61981ed2","year":null},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.000592Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:7709a73df66244b8995f070bba54db37baf5ea5cc869fadb723e67622d1d3150","observation_id":"16e5e185-427e-4805-859e-6286f8bea3e4","resolution":{"observed_at":"2026-08-14T14:51:42.318843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.297370Z","title":"Deep- walk: Online learning of social representations","venue":null,"work_id":"4f7e4d54-603b-415f-b1ba-a4ae9366f5d6","year":null},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.005281Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:30fb264211b2bd8b27a42a4d2461e4cc9495cd7d83ff05c2e530ab224294444c","observation_id":"cb353435-d97d-449b-9802-4a6b92b8ac46","resolution":{"observed_at":"2026-08-14T14:51:42.302580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.282744Z","title":"Collective classifica- tion in network data","venue":null,"work_id":"1d5a500d-19c0-4628-b731-6b72835773d4","year":2008},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.010832Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:7cd39b57bd1b82ad791be2c8d43bc2010b70dbec20880fce70070492722c95d0","observation_id":"d85e669a-058e-42d3-beeb-90eb3c4ccae0","resolution":{"observed_at":"2026-08-14T14:51:42.287524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.268109Z","title":"Normalized cuts and image segmentation","venue":null,"work_id":"8740ea51-38b4-47f1-80bc-d31e4f0be344","year":2000},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.015198Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:2930c98503f9d0a6aa0c5024be78d7d4bb3b87f52472a078e83fdb94a6a79618","observation_id":"c61d320e-aced-4611-9d9a-2d44bc7d6d73","resolution":{"observed_at":"2026-08-14T14:51:42.272818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.253941Z","title":"The emerging field of sig- nal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains","venue":null,"work_id":"0e0521f0-79b4-4704-b070-b442970ec9f5","year":2013},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.019623Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:22baf52afdcae669a877297ebb281edc8bd58d6ef1700fd97c22b250e105041d","observation_id":"105b80a0-31e0-4701-9a4a-382522ae8e5b","resolution":{"observed_at":"2026-08-14T14:51:42.258621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.238573Z","title":"A signal processing approach to fair surface design","venue":null,"work_id":"6245cdb9-be4b-48ca-a529-c6b0283fde9d","year":null},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.024330Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:b4fd061e738244789d439627167b5c6560ce03644870e0e43d0ceaee78f9bfe1","observation_id":"b05e94e7-7626-44cb-8c47-b3d73d8e8505","resolution":{"observed_at":"2026-08-14T14:51:42.243418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.222965Z","title":"Learning deep representations for graph clustering","venue":null,"work_id":"fd3774b4-b93e-46ff-9e7d-514607635b8f","year":2014},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.029067Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:70465a97019ec77c1f5dc6bbfbaab93acacb40d5e83a68d19fdf467eae790be6","observation_id":"00a0cc20-7d16-46c0-a123-8e4f306712e7","resolution":{"observed_at":"2026-08-14T14:51:42.227871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.206801Z","title":"Subspace clustering","venue":null,"work_id":"f2153061-965e-4a98-abe7-5c0a3c3d83f2","year":2011},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.033963Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:2e7475dbc9b42baf78877ce09c3c0f14e429191c297467b81b19967fbd47de10","observation_id":"24daa29c-2967-4880-b851-3dd5aefebd29","resolution":{"observed_at":"2026-08-14T14:51:42.212261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.190129Z","title":"Mgae: Marginalized graph autoencoder for graph clustering","venue":null,"work_id":"db5fda0c-3dab-439d-9990-af2ee9f88634","year":2017},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.038261Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:85551d01179c360602d77ca5a4cb79e81721b1a507e8e2bf003d33fcd2889387","observation_id":"49886016-7bdd-44ba-bb71-366072968ed1","resolution":{"observed_at":"2026-08-14T14:51:42.194890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.175020Z","title":"Robust multi- view spectral clustering via low-rank and sparse decomposi- tion","venue":null,"work_id":"c8b9d455-09ea-4c3a-9486-b0cd91951fc3","year":2014},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.043284Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:2ce76a48f8586fdc830cb9acb7afd92263b4db7208f0465b2b8611877d364440","observation_id":"d9b4137c-d73e-4f43-ab4e-124523626588","resolution":{"observed_at":"2026-08-14T14:51:42.179759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.159603Z","title":"Network representation learning with rich text information","venue":null,"work_id":"f96e5c16-daab-44bf-bd85-e9e32c0ca736","year":2015},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.048333Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:3fd3dbc51101a0070a094a5b92695cc85bf10dff59fe18fcfcc7fec22a0418bf","observation_id":"b11f4f4a-a53b-46e4-a60f-587f9d30c55c","resolution":{"observed_at":"2026-08-14T14:51:42.164558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.144313Z","title":"Overlapping community detection at scale: a nonnegative matrix factorization ap- proach","venue":null,"work_id":"9150a0ea-f048-4418-b4ec-5c5436676642","year":2013},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.052762Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:167d8c3248129ba6710db19b6e384a63abef2001a257d7d7c5f639f8a81552b6","observation_id":"0f57fe35-601b-4ce8-b82e-84ce850e3642","resolution":{"observed_at":"2026-08-14T14:51:42.149494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:51:42.128859Z","title":"Deep adversarial subspace clustering","venue":null,"work_id":"fc773175-88c5-4118-8515-c8ea5cd4f68e","year":2018},"citing_paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:51:42.057261Z"},"links":{"citing_paper":"/paper/1908.02441"},"observation_digest":"sha256:ef9f9def93b3f532ea0d5928367526a57afa95bba4f4192e4c3ab9f6b533a9bb","observation_id":"ed38a69f-b0db-410e-9f18-fcbc7b725f30","resolution":{"observed_at":"2026-08-14T14:51:42.134153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.02441","last_updated":"2019-08-07T05:08:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T03:22:26.248505Z","submitted_at":"2019-08-07T05:08:15Z","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":35},"total_outbound_references":39},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:1908.02441."}