{"as_of":"2026-08-20T07:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7fa8e96bc9fc486d3fcb4cf8cc11398f6064c4e37b79a36d10550f590306f3c","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:32:21.896732Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"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/2412.15496/citation-record","integrity":"/paper/2412.15496/integrity","json":"/paper/2412.15496/citation-record.json","paper":"/paper/2412.15496"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.580286Z","title":"Community detection and stochastic block models: recent developments","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.580286Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:11f077b329fa102ff1d37b4241015b98e71b59ec9093731c13c362f74c5e56d8","observation_id":"efedb952-f54c-41c1-91e7-89dc84bffc8c","resolution":{"observed_at":"2026-08-11T11:32:21.580286Z","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-11T11:32:22.924517Z","title":"and Sandon, C","venue":null,"work_id":"eb683427-0a6a-42f3-b95f-32ecd916fba4","year":2015},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.587034Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:7128e80b50b456604b9475d6f9bed9b4755c1d0bebf7fd5f2d07c0356967e304","observation_id":"dc7d7823-020d-4598-a2f4-025bf0ca9915","resolution":{"observed_at":"2026-08-11T11:32:22.930547Z","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-11T11:32:22.904925Z","title":"S., and Hall, G","venue":null,"work_id":"d0b1cda1-4f44-44ee-8416-67d651dc4459","year":2015},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.593816Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:bc37ee1a70b65506a8499dffd3ab2d2b1bfdb393bf3975aba99bdd005a4d6c50","observation_id":"6fb5a7eb-f951-4609-86bb-550e4f8f093f","resolution":{"observed_at":"2026-08-11T11:32:22.910191Z","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":"2403.03880","last_updated":"2024-11-08T12:26:43Z","snapshot_observed_at":"2026-08-18T15:06:42.387171Z","submitted_at":"2024-03-06T17:40:26Z","title":"Almost Surely Asymptotically Constant Graph Neural Networks","version":3},"cited_work":{"arxiv_id":"2403.03880","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.03880","snapshot_observed_at":"2026-08-11T11:32:22.185452Z","title":"Almost Surely Asymptotically Constant Graph Neural Networks","venue":"cs.LG","work_id":"7f2d0e8e-52fb-49ec-83b1-002c67fcd591","year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.600088Z"},"links":{"cited_paper":"/paper/2403.03880","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:b675247b70cb53c0d21c1b3699cdc322a80abfaf012dfb3bac891dab5b24c7c3","observation_id":"c0a40dcc-ea75-49a3-b7b0-c61863cd9c48","resolution":{"observed_at":"2026-08-11T11:32:22.193564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-11T11:32:22.888394Z","title":"Graph convolution for semi-supervised classification: Improved linear separability and out-of-distribution generalization","venue":null,"work_id":"b0bb34dc-0a9e-4a52-9af8-a9c08b92f926","year":2021},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.607168Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:46e8d63421f9d6fe2a7915ae642daf98111aa51a559af5c9b9fd9b170394dacf","observation_id":"1cf51039-9328-47ea-95e7-117bcbe99bb8","resolution":{"observed_at":"2026-08-11T11:32:22.893565Z","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-11T11:32:22.871102Z","title":"Effects of graph convolutions in multi-layer networks","venue":null,"work_id":"6d91c993-c029-459d-885e-9af62c38d668","year":2023},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.613695Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:d7643262a996e9f10a0b9b692398d3873d903530ca162cde61e62b6dc4561cd6","observation_id":"1b458fc9-63d7-442d-a639-d3cd35130836","resolution":{"observed_at":"2026-08-11T11:32:22.876542Z","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-11T11:32:22.851778Z","title":"An iterative clustering algorithm for the contextual stochastic block model with optimality guarantees","venue":null,"work_id":"c492da53-17d4-4076-a7bb-b6e4e1571d93","year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.621098Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:9aa220c67d8ea30155be39800066b8a26e982518f854237b6c651c4d75e8d907","observation_id":"3e99a336-5458-43a3-a66d-3c31b977bcfb","resolution":{"observed_at":"2026-08-11T11:32:22.858100Z","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-11T11:32:22.830866Z","title":"Supervised community detection with line graph neural networks","venue":null,"work_id":"3fa8475b-125c-457d-95f2-2002e73f02d7","year":2020},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.626865Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:7a50ea2feacb3bf8bb522c5b2fe34ff877e9827a6bf2d25628898f3741ad9c86","observation_id":"14bb32cd-9601-4a98-8b97-a8a2d192368f","resolution":{"observed_at":"2026-08-11T11:32:22.837394Z","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-11T11:32:22.812936Z","title":"Contextual stochastic block models","venue":null,"work_id":"76e41266-7316-463c-a460-74e1532a0a1e","year":2018},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.632273Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:28b04ad67170412620eeca90bd92648408682d00c5e0709d30b96422ac707ad5","observation_id":"2eb6d217-8219-4e2d-8c6c-1ed15e817109","resolution":{"observed_at":"2026-08-11T11:32:22.819388Z","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-11T11:32:22.795146Z","title":"Exact recovery and bregman hard clustering of node-attributed stochastic block model","venue":null,"work_id":"7328c844-4a3b-462d-b513-549375bcd87e","year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.637149Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:dc0b534d91847c3b969d128b0a88c312ed445dbf797db82af804655f6a2f9206","observation_id":"8bb4b8af-02b7-4edf-a1f8-b74d0f2c6cbd","resolution":{"observed_at":"2026-08-11T11:32:22.800929Z","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-11T11:32:22.775776Z","title":"and Zdeborova, L","venue":null,"work_id":"cfa41ace-74ce-47a9-95ab-d5c7911afca5","year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.643434Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:87d8e05a6a3df40fd96de38ee76f6866f410548fe7a9ae23718fc752e34d8b03","observation_id":"987c0809-d1d7-4702-a102-d55b54f29beb","resolution":{"observed_at":"2026-08-11T11:32:22.781309Z","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-11T11:32:22.758077Z","title":null,"venue":null,"work_id":"c9d0905a-e6a6-45de-969d-81fc24ee2655","year":2002},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.649200Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:ca7c10194cfc4d19e5313c92c5aa8e6e194f4d4559d3c3be83ee91defe07ab1f","observation_id":"0887373c-f15f-4bb1-8fde-3152f6b0700a","resolution":{"observed_at":"2026-08-11T11:32:22.763689Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.656172Z","title":"Graph neural networks for social recommendation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.656172Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:6a2dabd6ea6bb10b2bf94f3de5840633e0c263ed3b12b2fc0a2d158017de85e8","observation_id":"749962b2-269c-4693-80fb-a0d02a62679f","resolution":{"observed_at":"2026-08-11T11:32:21.656172Z","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-11T11:32:22.729684Z","title":"and Lenssen, J","venue":null,"work_id":"a7492eba-73d5-4ea7-afb0-dbcf535ce435","year":2019},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.661647Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:fcdc7ebbfe04abea7114fbbe8192118c1c026151a9f9391ad8d94a1c7806de4e","observation_id":"7260532f-1334-43bb-83d3-6ace382af5e2","resolution":{"observed_at":"2026-08-11T11:32:22.735288Z","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-11T11:32:22.712084Z","title":"Graph attention retrospective","venue":null,"work_id":"c3dcf87b-1364-40a0-9bdd-0625a6cab285","year":2023},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.667623Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:5dff47f9e9331a0b3b6adc42f6d34a84c7b2ac8885a11fca6e182e4d9c85cd5b","observation_id":"a522dfa1-f674-4bc9-9fd9-a75071d14e42","resolution":{"observed_at":"2026-08-11T11:32:22.717692Z","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-11T11:32:22.695212Z","title":"and Karo \\'n ski, M","venue":null,"work_id":"9516dda9-fc9e-4a67-921a-c7343f77098c","year":2015},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.673920Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:113ba99824d802ecf9e4542a1664bfb0d9166e3444e5b19b746e9eb928005e86","observation_id":"abb0e452-1032-4bab-9d1c-9611e7858a29","resolution":{"observed_at":"2026-08-11T11:32:22.700769Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.682393Z","title":"D., Kosciolek, T., Leman, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.682393Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:8e1d82d08209f0e6955958119f8af4d72fa700f69cff6a5ba9b7b667ecaa4ec3","observation_id":"7abc0bbc-e401-40d7-9274-2e36692ee38a","resolution":{"observed_at":"2026-08-11T11:32:21.682393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.689072Z","title":"W., Laskey, K","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.689072Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:9ae565b94a99cd0efe9adc51d7d0cb28916af770a2df9d3f9e2c345ed4f4a770","observation_id":"b11cdb59-efe2-4dfb-8e73-9639bae5e6dc","resolution":{"observed_at":"2026-08-11T11:32:21.689072Z","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-11T11:32:22.654383Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"11722578-428b-49b4-a72b-119d89395313","year":2020},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.695512Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:cccadc0709ecc4618acbbb4e643ada16a976425dd538e478b7c43469a49a5474","observation_id":"bbd9c0e7-e67d-43f3-af7e-473951b84c70","resolution":{"observed_at":"2026-08-11T11:32:22.659799Z","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-11T11:32:22.636939Z","title":"S., Levi, A., and Valera, I","venue":null,"work_id":"2f917ae3-46ef-4af6-968b-ae69b288cd05","year":2023},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.703624Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:ad2d6c02eb8c9f73ce511b5af6d2db00def4c81795cfa358c5f7ab6732c0d4c2","observation_id":"e60601d7-a418-45e9-9746-0cd6f83cd5fe","resolution":{"observed_at":"2026-08-11T11:32:22.642676Z","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-11T11:32:22.619685Z","title":"Not too little, not too much: a theoretical analysis of graph (over) smoothing","venue":null,"work_id":"9dcae0c8-d404-44ab-acc6-c801ddc4f0a7","year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.711302Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:fbe9aef0b76d3c6b7e75bffd89fd028a5ad1ee9e7bf107eb94e5fa443fc4f5e3","observation_id":"42d0db76-7a09-45fa-af49-035ad9a59947","resolution":{"observed_at":"2026-08-11T11:32:22.625541Z","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-11T11:32:22.598903Z","title":null,"venue":null,"work_id":"40a10d74-487a-4083-9bd4-9523c966177b","year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.717040Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:43aa194f493282816947ef64807679ca23796fd14d3d3828f1141b7253aaabd2","observation_id":"e089a247-1b0d-4f1b-819b-568e272c1dff","resolution":{"observed_at":"2026-08-11T11:32:22.604700Z","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-11T11:32:22.580429Z","title":"B., Rossi, R","venue":null,"work_id":"662aafbd-89f9-4fc9-b2a8-93a0be304661","year":2019},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.725556Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:fcb49fb6dc4bf7a882a73e1d9b941245c7e6f24266f5998b1c87ace8ad0f71e8","observation_id":"1604990b-7f78-4b5e-94ef-13c7e4b150fe","resolution":{"observed_at":"2026-08-11T11:32:22.586384Z","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-11T11:32:22.560351Z","title":"E., Rivest, R","venue":null,"work_id":"95c2dda3-207d-4124-ba7a-50f94a831747","year":2001},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.732356Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:ae917e9d6df015b4af9ba556a9508f21ea6635b14bf9547fbbbccb73ba8baf23","observation_id":"75fc0671-30bf-4a48-9bb3-a43de8787cbc","resolution":{"observed_at":"2026-08-11T11:32:22.566573Z","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-11T11:32:22.539998Z","title":"Towards deeper graph neural networks","venue":null,"work_id":"828e9d95-b43f-43aa-97dd-b8a58df6fcc6","year":2020},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.739694Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:db373d139cccc1b0edbdf07481619ec48cac4c62804684bc44b8792ad62f1e9d","observation_id":"3f0789b8-6a37-403b-bda3-32cc5f2eb70e","resolution":{"observed_at":"2026-08-11T11:32:22.545683Z","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-11T11:32:22.519735Z","title":"and Sen, S","venue":null,"work_id":"440ee6f1-4cda-4c23-a235-8434eddf893a","year":2023},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.745026Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:3887bc5e172dbc52d9a7dd309be363a116736b3a51bc8029ffa14923f5c47588","observation_id":"de7bf6ca-b748-4a79-83e1-66147b196175","resolution":{"observed_at":"2026-08-11T11:32:22.525264Z","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-11T11:32:22.497240Z","title":"When do graph neural networks help with node classification? investigating the homophily principle on node distinguishability","venue":null,"work_id":"0591f6d2-fea5-4168-8b7b-54a06a2b347c","year":2023},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.750881Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:1117622ae6f2a8993d689af12ae14e56411b8f4e1b0d374b9ae617bb0fd15960","observation_id":"16d14a71-b7a0-49d0-aeb9-ec00f867fd6f","resolution":{"observed_at":"2026-08-11T11:32:22.502966Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.757383Z","title":"Hyperspectral image classification using feature fusion hypergraph convolution neural network","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.757383Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:194e530865e659fb032a3395fa17c93845c0e3b90e90c4075ba886bf1a72d91f","observation_id":"a9486c11-eda5-49d4-a089-1680e864a2eb","resolution":{"observed_at":"2026-08-11T11:32:21.757383Z","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-11T11:32:22.478790Z","title":null,"venue":null,"work_id":"9aebef9c-be2e-4cab-a332-3d89f8de546f","year":2009},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.765803Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:269df9acc800b26ad99da0b0f9767c6c94497bc7eb1093973125ee3d2ef7ff2d","observation_id":"81ea639e-792f-4610-805e-ce0a5c806855","resolution":{"observed_at":"2026-08-11T11:32:22.484418Z","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":{"arxiv_id":"2303.10993","last_updated":"2023-03-20T10:21:29Z","snapshot_observed_at":"2026-08-18T15:05:00.145825Z","submitted_at":"2023-03-20T10:21:29Z","title":"A Survey on Oversmoothing in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10993","snapshot_observed_at":"2026-08-11T11:32:21.772614Z","title":"K., Bronstein, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.772614Z"},"links":{"cited_paper":"/paper/2303.10993","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:f4c2071569434de129370b43af9c084f81ee594238e2206ab75e36dcb1d6a530","observation_id":"58eee9be-b24b-408e-91a6-c65944836e11","resolution":{"observed_at":"2026-08-11T11:32:21.772614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.782796Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.782796Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:74cfc74bd49a90932d2928cc2165d6f4c928057e57af916c55a67f674fab71cb","observation_id":"a4e3e5dd-6fd0-405f-99aa-8bb3bb4bf593","resolution":{"observed_at":"2026-08-11T11:32:21.782796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.788194Z","title":"Understanding heterophily for graph neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.788194Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:12ae9b884f106f7cf68ef9b2bc8fc51cbf0f739d48c81c85ac25140a7590880e","observation_id":"2e611079-8924-4eec-a221-22392ac5d235","resolution":{"observed_at":"2026-08-11T11:32:21.788194Z","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-11T11:32:22.429951Z","title":"Graph attention convolution for point cloud semantic segmentation","venue":null,"work_id":"032e1259-7298-49de-89cc-1271f117162a","year":2019},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.795060Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:7fc5a2e00be128180df6884176171313a0c04ae14fc7b81567990a9c92a97d98","observation_id":"8ea0c2b1-e305-47f5-9cbb-e35c6349e6be","resolution":{"observed_at":"2026-08-11T11:32:22.436910Z","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":"1909.01315","last_updated":"2020-08-25T15:46:13Z","snapshot_observed_at":"2026-08-18T10:54:34.717319Z","submitted_at":"2019-09-03T17:10:28Z","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.01315","snapshot_observed_at":"2026-08-11T11:32:21.804721Z","title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.804721Z"},"links":{"cited_paper":"/paper/1909.01315","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:26148b935d28759f80ffe28addc62b4cb39ab655e943ca93b9bc074bcfadc69b","observation_id":"2ea15010-a720-4a63-890d-ec5b0379418f","resolution":{"observed_at":"2026-08-11T11:32:21.804721Z","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-11T11:32:22.407270Z","title":"Kgat: Knowledge graph attention network for recommendation","venue":null,"work_id":"186455c3-24f3-4dfc-a08a-bf606cceddd2","year":2019},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.810975Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:38adfcff915290de751f595765eafdf79e2d1dc6f6ee48b1025c2c2db7e883c4","observation_id":"a8300f00-a2f1-40f4-a70e-0c8f82e73fba","resolution":{"observed_at":"2026-08-11T11:32:22.414318Z","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-11T11:32:22.386991Z","title":"R., and Li, P","venue":null,"work_id":"73ab4f42-84bd-4250-8f39-1e37fe2b179d","year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.817178Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:7e720550c046a7c22c4885770d4ee2253e9884e912545084a84e21ff46b327ac","observation_id":"b8235562-14d0-4574-8493-da80cb9cfc42","resolution":{"observed_at":"2026-08-11T11:32:22.393357Z","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-11T11:32:22.365191Z","title":"Graph neural networks in recommender systems: a survey","venue":null,"work_id":"fc35c713-aad7-475b-9bfb-e0ebb3981a40","year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.823125Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:ebef66b33aa5401b8b175c1e3827dd57d636c85dabbaaac9ba10a8a05bd36256","observation_id":"9f237d5d-4976-4102-a1f2-b14ecc2c67cc","resolution":{"observed_at":"2026-08-11T11:32:22.372448Z","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":"2212.10701","last_updated":"2023-03-01T04:22:54Z","snapshot_observed_at":"2026-08-16T20:43:28.363983Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10701","snapshot_observed_at":"2026-08-11T11:32:21.829688Z","title":"A non-asymptotic analysis of oversmoothing in graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.829688Z"},"links":{"cited_paper":"/paper/2212.10701","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:4c9302686e0d9901f17dd486bf28e6a64176a4aab29a164d9885b7301f52bdae","observation_id":"64f069ac-100f-4c22-8437-ac065944a69f","resolution":{"observed_at":"2026-08-11T11:32:21.829688Z","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-11T11:32:22.344939Z","title":"Demystifying oversmoothing in attention-based graph neural networks","venue":null,"work_id":"9f03ba09-d79b-4287-b6c7-e9e2a6682f35","year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.836910Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:1853ce053be14014312b705b27d4db95be188285d41ef50c6eccd06b6be87bc1","observation_id":"19bd5e62-4b0f-44be-beef-c72101f64f05","resolution":{"observed_at":"2026-08-11T11:32:22.350709Z","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-11T11:32:22.325671Z","title":null,"venue":null,"work_id":"35b0b75d-9699-442f-9482-dc9639abe3fe","year":2020},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.842141Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:db854ce815ec8e7f8dad33a50e74e0b2154d551e60a74adc7ccda16cff0d7422","observation_id":"565ac76a-787f-4910-8d73-270111423887","resolution":{"observed_at":"2026-08-11T11:32:22.331499Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.848506Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.848506Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:b117fdcd8b485d403b3d33ef40bf5441d4d88539fc3d47b2729bc84fb0552fb6","observation_id":"2fd76e25-0558-47b2-a036-7fc2a3d4558a","resolution":{"observed_at":"2026-08-11T11:32:21.848506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.13663","last_updated":"2020-06-17T21:45:09Z","snapshot_observed_at":"2026-08-10T10:41:42.604795Z","submitted_at":"2020-03-30T17:48:04Z","title":"Revisiting Over-smoothing in Deep GCNs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.13663","snapshot_observed_at":"2026-08-11T11:32:21.855510Z","title":"Revisiting over-smoothing in deep gcns","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.855510Z"},"links":{"cited_paper":"/paper/2003.13663","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:b5630307585e9d4f98e12f7ce9f911137ed2f0d43a9ba1ed476f9c3c9bbfaa9f","observation_id":"3a0cdfc1-01f8-4eb4-bf56-69a6c042b54d","resolution":{"observed_at":"2026-08-11T11:32:21.855510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00700","last_updated":"2024-08-01T16:43:55Z","snapshot_observed_at":"2026-08-18T00:33:33.158648Z","submitted_at":"2024-08-01T16:43:55Z","title":"You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning","version":1},"cited_work":{"arxiv_id":"2408.00700","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.00700","snapshot_observed_at":"2026-08-11T11:32:21.949632Z","title":"You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning","venue":"cs.LG","work_id":"4fc935f7-2655-4c36-8c6b-512ad440f82f","year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.861041Z"},"links":{"cited_paper":"/paper/2408.00700","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:7a4787ec5a1609e7838d61e63b9d131863317b9677ec30c2491e8153c9dd42c4","observation_id":"bb28ac96-dd0c-4c1d-9e97-01d133b1635d","resolution":{"observed_at":"2026-08-11T11:32:21.959782Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-11T11:32:22.289371Z","title":null,"venue":null,"work_id":"2d594cdd-b0a0-4abe-a15c-8adb991f4827","year":2014},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.869423Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:4b86a36a5d6a42c17176dcee1ab1ad0f4d257013cca061f5f9632eea460a26d5","observation_id":"891d3094-0e4b-430f-83f5-343ef2385998","resolution":{"observed_at":"2026-08-11T11:32:22.299140Z","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-11T11:32:22.265112Z","title":null,"venue":null,"work_id":"a2222c7c-712c-44ce-a03f-4748bd1647a4","year":2016},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.876011Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:552e47e9be2ac2c0a4e67b7fc0906be019b167bf27402611318e25481dd7ce3e","observation_id":"be66a49c-dc5b-4727-9e81-854574125d99","resolution":{"observed_at":"2026-08-11T11:32:22.272261Z","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-11T11:32:22.244692Z","title":"and Tan, V","venue":null,"work_id":"e8f9b660-ac35-4658-9a00-dfd139aa5fa7","year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.882011Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:c22ebda38ecadffdd853a8a89d4aaac1c9fcd21aa55b70613e38799b6a698962","observation_id":"9bd91d3b-82e2-41ea-9d20-9de673628560","resolution":{"observed_at":"2026-08-11T11:32:22.251613Z","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-11T11:32:22.225442Z","title":"and Akoglu, L","venue":null,"work_id":"0122f00c-06a3-447f-a562-be1f93984997","year":2020},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.888930Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:17025fd3e4535f893f7d98959f615c919b58cfb11ff7aa4fda4ddde2bd3aa0ba","observation_id":"cc23a366-87a1-4939-882f-468bf52b32c5","resolution":{"observed_at":"2026-08-11T11:32:22.230853Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:32:21.896732Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.896732Z"},"links":{"citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:555c80ddefa328f44c1814c57a435512c3441dea4cf5feea3cb3e60c21696d9b","observation_id":"13760481-c44b-4d55-996c-eab131b77628","resolution":{"observed_at":"2026-08-11T11:32:21.896732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T15:06:06.175283Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":19,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":48},"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 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2412.15496."}