{"as_of":"2026-08-16T09:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd3610a7faa6cb28a31fd9a8603720f7d3f2e3e8d73ccf636898aff7c72adb23","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-16T06:30:59.297886+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-15T23:41:22.773361Z","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:933afdbe91320f098dcbe32642ce69c3a52fda4eb3341b1d25f600f02bd3d242","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:469b4d9efc37a72ee6dca5b4f706921e213bcb96ec9dedec8ec637e7ee1886e3","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:9b86093d7df82e5c12dcf73824f83f55ceff8c1a10640002d5e424aad95ae720","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:5e0b928c4363bb72116711abed965b0868c3cd8a30853931ada4727f228b9eb6","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:9d1ebb9cfcd3d5d5a274c475b1917ad1e1b966c4529042077048f277007d6a03","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:1c5e46589f135d501efe62b703403783df04a76b5dbf90c73e4c4a0cd5fe3bdb","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:92502ad4b8a46d4dafd421ed5cc1a15013f4cdd579ef36fc9c4a24192a8279c2","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:690513fab93110deed1354d874cb0edb17b73e3cfe6dd8e524b99c009bf442fe","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:326468dafa5abe22fdb1c719f43bb7a7021e841322d44042a7e924a4b07ee2c3","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:1aed02bc9c3e34cc6e106bc4e0012683fc67df9f3a12bc20535f290df4c58738","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:11cbd9a7f35914bb815108016ab354182e8d990cc2f642fc4f765ce5e4b173ec","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:5de25efdeff1cb8a1d21a8aa6cf66bf2f724ee3ea46a20d384a448e4cddfc2c9","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:69e93ba36710d1df1fd950ac2fa049ce3795682f32a5290e9f71c229c04a2d2e","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T16:27:23.761921Z","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-15T23:41:22.773361Z","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:4493fbeb54348d057486514fbf037a92c0d70ca4d067f16c3f5d58baf5213398","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-16T05:05:19.571940Z","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-15T23:41:22.773361Z","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:edbc6e16328cee09a60801f1e25a65d772069534e1c432cd91d7e99af5b01635","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-15T23:41:22.773361Z","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:52dce1752d97af07ef1e7cdceeef0e001995ae2df4abf627a44e55852bb7f512","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:8ad5ca298c3f5987dbea6077b80370eaff4a9f706979713ab7285068e86622c2","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:f167e0e74375dcf6eabc600ae2be0cf1ea3d007342e12139ecb8a756053057d3","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:4d43f04237adeece74a9b53e53373a59813f3b154c65812219b61fc7883cce9b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:06f2b77407f7e0b279898365c27ccd368829544c014e2fb46ddcf53538d23d34","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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:b6b3a106e2109b714c33f52d821843c2dc88910ea44b67becf532edbd22542a3","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:41:22.773361Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.05081."}