{"as_of":"2026-08-20T21:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24734500512623cc5051838af73e09bb991f53dc4f3aba4df110983527d6c594","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:30:43.778897Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.05081/citation-record","integrity":"/paper/1908.05081/integrity","json":"/paper/1908.05081/citation-record.json","paper":"/paper/1908.05081"},"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-14T13:30:44.038605Z","title":"N-gcn: Multi-scale graph con- volution for semi-supervised node classification.International Workshop on Mining and Learning with Graphs (MLG), 2018a","venue":null,"work_id":"569281e0-89b6-4cc8-98e4-35618d1ef891","year":2019},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.692433Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:14f363e41e75b2f0d602d1832d4c08535938ff2c403289ed562eb92adff1ce80","observation_id":"23abfece-dc55-4ebb-bc68-afa050642643","resolution":{"observed_at":"2026-08-14T13:30:44.042911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:44.015144Z","title":"Spectral networks and locally connected networks on graphs","venue":null,"work_id":"4ec8b660-cf62-45aa-8c7f-e534d2da6d91","year":2015},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.701402Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:b96a9eb19e062193d1404ca55bb8b9da2bc819c03814e7be259b2225655badec","observation_id":"e8848de3-5f43-4b32-af10-09a48f7b3434","resolution":{"observed_at":"2026-08-14T13:30:44.019856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.979136Z","title":"A new model for learning in graph domains","venue":null,"work_id":"ac7c38e1-8359-4310-86c1-458eae024c81","year":2005},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.713689Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:98f7bd5492ed3b8107c265190be5e1645aafadf6f58842d9f608b002e271acb6","observation_id":"fe48490d-c823-4d9c-b4b3-8ea0b4cf01c0","resolution":{"observed_at":"2026-08-14T13:30:43.982403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.939401Z","title":"Lanczosnet: Multi-scale deep graph convolutional networks","venue":null,"work_id":"b90313e5-23f1-4226-a7dc-ef6ab261088f","year":2019},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.733913Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:60a97b7213879dbf34dc2d99aeeb190e2b117a41cd8caeb2279516033a6b2938","observation_id":"337cb0c6-9cc8-42c3-b82f-9b929826705e","resolution":{"observed_at":"2026-08-14T13:30:43.943492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.918814Z","title":"Graph attention networks","venue":null,"work_id":"ae58940e-46c4-4535-be22-7a8500278d3f","year":2021},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.747362Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:df2a38f6087eef0ae0cc144a4335f12a082f23e1d55092492973ea036fbcc61d","observation_id":"a0c7ad3a-276a-47aa-9f7e-854667d2d4ef","resolution":{"observed_at":"2026-08-14T13:30:43.922212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.907708Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"71ab5df7-6882-4a49-ba81-f71545eb018e","year":2019},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.751371Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:91f8484802a3db2144b4ee3a4a5fe841741cad43f64b5871714cd3be3da97f38","observation_id":"3d47d944-dce4-42ef-ae03-7f26b8133602","resolution":{"observed_at":"2026-08-14T13:30:43.911667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.895742Z","title":"How powerful are graph neural networks? ICLR, 2018a","venue":null,"work_id":"bfc84ccb-1517-4841-9311-5e337ee57862","year":2018},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.755589Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:8c5156452c2c7198d75c1003d6f1de19579ddf04a6256f7bff4d92d90052cb7c","observation_id":"35c45b93-4831-4bef-b5e2-4ebcd219ce3b","resolution":{"observed_at":"2026-08-14T13:30:43.900507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.883613Z","title":null,"venue":null,"work_id":"f0d6f38c-2f13-4390-b30f-3a253a9492bf","year":2021},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.764378Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:166fdeb222bf47f811b14d9c13d2c03d008dfae8882654d10c73cbeebb131daa","observation_id":"9536ceed-ab54-47c4-8471-21dcf22c2e72","resolution":{"observed_at":"2026-08-14T13:30:43.887491Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.871680Z","title":null,"venue":null,"work_id":"fbe4be17-1c1c-464a-83e5-e10530c3c2cc","year":2018},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.767798Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:8642a42f86d101dfec3c4a5b376e9099c8e7b75a0e230c388e7a0e62806221c7","observation_id":"159d5ed0-5203-4b88-8524-03ce3cc7cfdf","resolution":{"observed_at":"2026-08-14T13:30:43.875213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.860314Z","title":null,"venue":null,"work_id":"2e67e88e-b9d3-4bb6-bf3c-32b6aee5cd6e","year":2021},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.771043Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:356a63d789dc46cbd3d7d0c0247920fa76439fca2116ac4805133eebfbf128e3","observation_id":"c2e7c15b-abac-435d-9b8a-a5d4ec75ad9a","resolution":{"observed_at":"2026-08-14T13:30:43.863765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.846567Z","title":"It is strongly Bayes-risk consistent if limn→∞L(hn) = a almost surely","venue":null,"work_id":"5f54e86a-b60e-4938-a274-c513c04575d1","year":2013},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.774860Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:e06230f1d259807f35fd1600eb3cb4871d0283d84ab5af5a4a9ebef512d1caca","observation_id":"5ac81f90-826c-4917-b2e6-0f36238d0f96","resolution":{"observed_at":"2026-08-14T13:30:43.852092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.831472Z","title":null,"venue":null,"work_id":"cec447a8-adef-4968-8b89-9dbce6ae9caa","year":2005},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.778897Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:3ba050d564eb2bb6fd44c75a7bfa2c5a044fa92d25fbc1ab09571511c03e619d","observation_id":"e22fe503-5d07-4db6-ad3d-c6177f64d78e","resolution":{"observed_at":"2026-08-14T13:30:43.836856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.987999Z","title":"Fastgcn: fast learning with graph convolutional networks via importance sampling","venue":null,"work_id":"816853e5-1b1b-4685-92a2-38e5647949e6","year":2019},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.709765Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:a6e2e76743c5ea3c6325d635d15f6c85f968c6284a49dcf223ca6b7ba100c2fa","observation_id":"d79ea73c-bfa5-47d4-ad72-0a91facdba17","resolution":{"observed_at":"2026-08-14T13:30:43.996255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10029","last_updated":"2021-09-21T05:10:32Z","snapshot_observed_at":"2026-08-16T11:30:01.367974Z","submitted_at":"2019-05-24T04:43:38Z","title":"Power up! Robust Graph Convolutional Network via Graph Powering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10029","snapshot_observed_at":"2026-08-14T13:30:43.721910Z","title":"Power up! robust graph convolutional network against evasion attacks based on graph powering","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.721910Z"},"links":{"cited_paper":"/paper/1905.10029","citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:8f89a3c5b6fa5eb617b3957c11572b18ff8ebb5c4905aff7fc79bb73c4575c27","observation_id":"90605009-f444-4e1d-b5d5-a6348ae645a0","resolution":{"observed_at":"2026-08-14T13:30:43.721910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07428","last_updated":"2016-02-24T08:08:05Z","snapshot_observed_at":"2026-08-19T15:13:14.640601Z","submitted_at":"2016-02-24T08:08:05Z","title":"Max-Margin Nonparametric Latent Feature Models for Link Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07428","snapshot_observed_at":"2026-08-14T13:30:43.760108Z","title":"Max-margin nonparametric latent feature models for link prediction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.760108Z"},"links":{"cited_paper":"/paper/1602.07428","citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:fc7dd50e9d7c80b2fe2ff096fddfb458f64d0c30a724b01cda05e0cbb3538ef0","observation_id":"9800963d-8469-4f54-ae6f-593f14e178dc","resolution":{"observed_at":"2026-08-14T13:30:43.760108Z","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-14T13:30:43.929276Z","title":"Pitfalls of graph neural network evaluation.In Relational Representation Learning Workshop (R2L 2018), NeurIPS,","venue":null,"work_id":"8c53d7bd-d4f6-4d12-a965-720244488614","year":2018},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.742641Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:2f14ab4059851a60f8e0739c90f70e9215f32419d688d9578e845908a4ff0ead","observation_id":"cc223570-a15e-40ca-8acd-a72401f51595","resolution":{"observed_at":"2026-08-14T13:30:43.932735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:44.004420Z","title":"Bootstrapped graph diffusions: Exposing the power of nonlinear- ity","venue":null,"work_id":"41437e42-e858-4c88-817f-b69e51b9a28d","year":2018},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.705396Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:208ce0142f00af172afba7d36375fb1f4cbe18b33debce908b442f31f9c7ed98","observation_id":"be7927d7-2b87-42f4-931a-cd905d369b73","resolution":{"observed_at":"2026-08-14T13:30:44.008657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.970110Z","title":"Learning deep resnet blocks sequentially using boosting theory","venue":null,"work_id":"699623dd-6718-4250-97a0-56800b630b28","year":2018},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.718252Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:cc06aaa1fab53ae15e17f58f8dad80a74895795a73b77044b9a80e1f65f47094","observation_id":"be126397-7ceb-4630-8df5-2a8cd9f9d304","resolution":{"observed_at":"2026-08-14T13:30:43.973279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.950350Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"3042eb11-535f-4cdf-89ab-ab247716da77","year":2019},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.729669Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:e7cc3bedfe6bf094d2363d511091046fe9f34c3ab63148983cf0342ec94d7934","observation_id":"f09fbfb4-c649-45b1-b44f-167e83804e49","resolution":{"observed_at":"2026-08-14T13:30:43.953995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:44.026864Z","title":"Deep gaussian embedding of graphs: Unsuper- vised inductive learning via ranking","venue":null,"work_id":"c7778240-b060-46cb-86d3-c8829105ca67","year":2019},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.697809Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:b4f1837e1dd4283439e8a203401ea3f41bac501dad3639eb52b2170d3d73626c","observation_id":"39dde871-8c05-46a6-9df8-be7fc12f15db","resolution":{"observed_at":"2026-08-14T13:30:44.030972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:30:43.960070Z","title":"Semi-supervised classification with graph convolutional net- works","venue":null,"work_id":"191a4d4c-ca05-4f3f-9f0e-7f883b7f28aa","year":2018},"citing_paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T13:30:43.725937Z"},"links":{"citing_paper":"/paper/1908.05081"},"observation_digest":"sha256:87b1009adb907cc16dce998713f6fc26f0f847b36d33db47a089a3112a8efd5e","observation_id":"f38635fe-03f0-493b-a59d-ed757dd8c5ab","resolution":{"observed_at":"2026-08-14T13:30:43.963871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05081","last_updated":"2021-03-15T10:19:52Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T07:51:47.331785Z","submitted_at":"2019-08-14T11:41:09Z","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.05081."}