{"work":{"id":"48b8c0db-42f0-4fc9-8c0a-892bc708eaee","openalex_id":null,"doi":null,"arxiv_id":"2303.10993","raw_key":null,"title":"K., Bronstein, M","authors":null,"authors_text":"Rusch, T","year":2023,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/2303.10993","cited_by_count":null,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-05-25T05:30:23.154577+00:00","pith_arxiv_id":null,"created_at":"2026-05-10T06:31:30.760985+00:00","updated_at":"2026-05-25T05:30:23.154577+00:00","title_quality_ok":false,"display_title":"A sur- vey on oversmoothing in graph neural networks","render_title":"A sur- vey on oversmoothing in graph neural networks"},"hub":{"state":{"work_id":"48b8c0db-42f0-4fc9-8c0a-892bc708eaee","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":21,"external_cited_by_count":null,"distinct_field_count":3,"first_pith_cited_at":"2024-07-29T14:53:45+00:00","last_pith_cited_at":"2026-05-22T10:26:41+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-05T05:48:35.937019+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":1},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":1},{"context_polarity":"use_method","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}