{"as_of":"2026-08-14T02:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ddf55ea0ea137e33d7b17b4192e642b8be422be3801893edb95b3260a8e494c3","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:43:50.298140Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T14:04:13.095632Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00241","snapshot_observed_at":"2026-07-14T14:04:13.095632Z","title":"C .; Chen, L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10131","last_updated":"2026-07-11T05:42:19Z","snapshot_observed_at":"2026-08-07T18:41:21.175243Z","submitted_at":"2026-07-11T05:42:19Z","title":"SALT-GNN: Handling Dense Neighborhoods in Anti-Money Laundering Graphs via Statistics-Aware Attention","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-14T14:04:13.095632Z"},"links":{"cited_paper":"/paper/2412.00241","citing_paper":"/paper/2607.10131"},"observation_digest":"sha256:6bd0e99718bd8022c05cec8e71d1cf6d1c1bea1d8c8b63ff50a2f50ca530d746","observation_id":"66c1449e-629d-4513-813a-1b2371fe88db","resolution":{"observed_at":"2026-07-14T14:04:13.095632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00241/citation-record","integrity":"/paper/2412.00241/integrity","json":"/paper/2412.00241/citation-record.json","paper":"/paper/2412.00241"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.01179","last_updated":"2021-06-04T14:52:04Z","snapshot_observed_at":"2026-08-13T14:20:35.424484Z","submitted_at":"2020-10-02T19:53:05Z","title":"The Surprising Power of Graph Neural Networks with Random Node Initialization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.01179","snapshot_observed_at":"2026-08-12T05:43:50.118201Z","title":"The surprising power of graph neural networks with random node initialization, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.118201Z"},"links":{"cited_paper":"/paper/2010.01179","citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:2735f2cddddd85d9f5fd472465365b48b67c6aa64aa33162969efd9868d9eca0","observation_id":"dcf07aba-a2f4-4ee0-aff1-6c8b6926c5af","resolution":{"observed_at":"2026-08-12T05:43:50.118201Z","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-12T05:43:51.037957Z","title":"Realistic synthetic financial transactions for anti-money laundering models","venue":null,"work_id":"c31a8b57-26ac-40ba-8192-1f481e8b7cc9","year":2023},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.123803Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:f975e4e45b664af041a9b70104536f7f2c5acf0fc26be56019a4f1fdeb4e782e","observation_id":"13fa6b79-4b64-462d-89b1-6b38e0e32593","resolution":{"observed_at":"2026-08-12T05:43:51.042904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:51.022835Z","title":"Graph neural networks with local graph parameters","venue":null,"work_id":"53c8db86-60e1-4405-aab6-1cd087f9476d","year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.129285Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:0821203aff0f3fbdc063837d0e6fd82715318aaacff322af2700d6e6859f9f10","observation_id":"7a657842-78fe-41de-aff1-e32b3a1101aa","resolution":{"observed_at":"2026-08-12T05:43:51.027602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.134468Z","title":"Bronstein, and Haggai Maron","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.134468Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:86b1fba5d2e8f16fa26c3eb02fe87e0fbfc5ada03562c699efe59760ecb2ac43","observation_id":"201331df-b844-41ca-9600-b7a736a09f44","resolution":{"observed_at":"2026-08-12T05:43:50.134468Z","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-12T05:43:50.998361Z","title":"Efficient subgraph GNN s by learning effective selection policies","venue":null,"work_id":"bd8d17ce-245c-42ea-8651-3a36cf1c85ec","year":2024},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.138995Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:cb51940332e78bbd3d5c9433a6c0df3881e1d8c1a1915520985dad9f27aa396e","observation_id":"d3e2e8f2-40c1-4d58-8156-6ede2dda8b96","resolution":{"observed_at":"2026-08-12T05:43:51.003386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08593","last_updated":"2024-10-03T09:38:16Z","snapshot_observed_at":"2026-08-13T04:19:41.217203Z","submitted_at":"2024-02-13T16:53:48Z","title":"Graph Feature Preprocessor: Real-time Subgraph-based Feature Extraction for Financial Crime Detection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08593","snapshot_observed_at":"2026-08-12T05:43:50.144064Z","title":"Graph feature preprocessor: Real-time extraction of subgraph-based features from transaction graphs, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.144064Z"},"links":{"cited_paper":"/paper/2402.08593","citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:bd1ce3756eb07678834fea99b2512d6481da3839a9be5ff550641ac4512160d1","observation_id":"dc8c5a24-bb4d-4c43-9497-1003945e48ae","resolution":{"observed_at":"2026-08-12T05:43:50.144064Z","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-12T05:43:50.149982Z","title":"Bronstein","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.149982Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:372421f11727f4234560c5360a8f758bf5e769d34725191e3bb25fe0a9ac711b","observation_id":"34831829-3697-4819-87d2-0a1a72c1d2e6","resolution":{"observed_at":"2026-08-12T05:43:50.149982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-08-12T23:06:05.148534Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-12T05:43:50.154010Z","title":"Geometric deep learning: Grids, groups, graphs, geodesics, and gauges","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.154010Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:42085dec3c158f81098c617ae030e8e4ec18494dae6e4057db1d108e1ef96263","observation_id":"dde4ec97-27c2-47d3-870a-803fec23218c","resolution":{"observed_at":"2026-08-12T05:43:50.154010Z","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-12T05:43:50.158427Z","title":"Phishing scams detection in Ethereum transaction network","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.158427Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:1bac2480ed3c941db859d8f878335341c21589ab64c0ed358ebba1e7521cee43","observation_id":"08f70b30-89d1-4ca2-8dc1-44c6e2bcb10b","resolution":{"observed_at":"2026-08-12T05:43:50.158427Z","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-12T05:43:50.983393Z","title":"Principal neighbourhood aggregation for graph nets","venue":null,"work_id":"e2f1be38-78be-4ec6-a33f-7e6db427032e","year":2020},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.162700Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:5973c1a6720be1d9af221209f73814e97ac6320d01afbbd3d42c91d9dd21ed44","observation_id":"76bc6506-dedb-43f9-b6da-4febdba36b6c","resolution":{"observed_at":"2026-08-12T05:43:50.988362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48448/p6r4-c103","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:43:50.356978Z","title":"Provably powerful graph neural networks for directed multigraphs","venue":null,"work_id":"11e7e553-96e0-417e-85b1-83680461bd38","year":2024},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.167512Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:b6535453157b9417cbe1752b5f43bfedeb1b7d20ce5db5d966d9782fb4f4c616","observation_id":"39c58762-16b6-47d0-8ec6-d45c1aed97d1","resolution":{"observed_at":"2026-08-12T05:43:50.363023Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.172473Z","title":"Hypergraph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.172473Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:8be76354141cc31094e5158fb6a7ccefa8851e69cd99b58439e29bfcf2683734","observation_id":"34ebc343-d6c6-4091-9c00-fe0e2b16977e","resolution":{"observed_at":"2026-08-12T05:43:50.172473Z","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-12T05:43:50.177350Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.177350Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:c91373b72abccfa8df86eec9859dd3d50ae5c31ba453622c1c5ab3c55477a12f","observation_id":"7df3206e-37be-4fb1-9f54-c3f9141f0dfb","resolution":{"observed_at":"2026-08-12T05:43:50.177350Z","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-12T05:43:50.956531Z","title":"Bronstein, and Haggai Maron","venue":null,"work_id":"0376fb0c-4cf1-4e73-94a9-ac2499a04ff8","year":2022},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.181938Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:a82f52af3a11a3bf3e0d79009eac34fdeeb3b3fd687e3aa420658acdc8dd74a7","observation_id":"5464658d-c638-4ffa-8571-ab2857c013c0","resolution":{"observed_at":"2026-08-12T05:43:50.961537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.941848Z","title":"Fuchs* and Petar Veličković*","venue":null,"work_id":"7904a4ad-bb29-4d9c-858a-9223ccb825f1","year":2023},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.186192Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:dd8d40ddd4898cb60b50b8ab3906c47fad1da806e9a7e9712222ba1188f5358e","observation_id":"b1f7b0ec-7e1c-417e-8c92-1c146a18e94d","resolution":{"observed_at":"2026-08-12T05:43:50.946023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.927748Z","title":"Schoenholz, Patrick F","venue":null,"work_id":"4a1f6bc1-69dc-4d0c-9dd0-e5c308926759","year":2017},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.190758Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:16f1f3b5addf2e8cb3d0cb6d107a29efa5bffdd7c8f1f8f8c72ac576de14b3ff","observation_id":"b82e6254-a25d-4d0d-a5a1-e1e7d2708196","resolution":{"observed_at":"2026-08-12T05:43:50.932349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.913556Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"9f4043cd-1b95-41d0-8eb0-5325efd9dcc2","year":2017},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.195120Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:542960c01789816516b6defc984157d2b18235cb37aaaf9d961827da75f727dc","observation_id":"243e1076-f477-404f-99b1-5ef9e7fb0b7f","resolution":{"observed_at":"2026-08-12T05:43:50.918087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.199845Z","title":"Multilayer feedforward networks are universal approximators","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.199845Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:d3479d88433d29f09447b5fa005831da6d84eae4a57516f6713dafa3d7e546d7","observation_id":"d3f186bf-126a-43a0-89dc-fc42d2bd4429","resolution":{"observed_at":"2026-08-12T05:43:50.199845Z","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-12T05:43:50.204465Z","title":"Unignn: a unified framework for graph and hypergraph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.204465Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:a77be8448e58b30bd8d473917b8c5352460a3218e191ebc51c028dc9d3fa7b96","observation_id":"9e4ade6a-e0da-4aeb-8605-354d50fc0583","resolution":{"observed_at":"2026-08-12T05:43:50.204465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.08745","last_updated":"2019-12-04T12:03:18Z","snapshot_observed_at":"2026-07-06T07:46:58.799109Z","submitted_at":"2019-04-18T13:04:56Z","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.08745","snapshot_observed_at":"2026-08-12T05:43:50.209457Z","title":"edgnn: a simple and powerful gnn for directed labeled graphs, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.209457Z"},"links":{"cited_paper":"/paper/1904.08745","citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:8bbb2ca6441a6c0321c3f1def83a478c53f034e3b4d8fe007301598549e9990b","observation_id":"507e9190-8125-4344-be69-739d1bf56676","resolution":{"observed_at":"2026-08-12T05:43:50.209457Z","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-12T05:43:50.899117Z","title":"Universal invariant and equivariant graph neural networks","venue":null,"work_id":"7799ec05-bbc8-49b8-82e7-96f05da26814","year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.214525Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:486c3b3cce4fa76fdda193b017a32829c71812d6e854834850025e3b68162337","observation_id":"6f04dbfd-0315-47e9-964e-9bbcda679e55","resolution":{"observed_at":"2026-08-12T05:43:50.903841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.219052Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.219052Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:1b598665be6406984b6e384eb96682a8b89cc7bc9a1d7d2547afa702c3cbe061","observation_id":"8f5a688d-ffaf-40da-8d23-62ca1d96e399","resolution":{"observed_at":"2026-08-12T05:43:50.219052Z","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-12T05:43:50.873196Z","title":"Generalised f-mean aggregation for graph neural networks","venue":null,"work_id":"7e0b3058-a5f3-4894-83c2-b1471537e11a","year":2023},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.223700Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:1bc7e08aa2e0e599e3ec1a7b643b784a2e48b3208a5147c9234e461aa27b31f3","observation_id":"11f0d29a-a11d-401b-830a-3a619919b24f","resolution":{"observed_at":"2026-08-12T05:43:50.877980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.857995Z","title":"What graph neural networks cannot learn: depth vs width","venue":null,"work_id":"87c153d5-9b25-4c3e-8802-ff2def175996","year":2020},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.228251Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:1bae4e5a572bf9cd5cd7d41cc49be0b1f2e327c3380629ecc3eab01379a5c452","observation_id":"70110522-4287-47bb-a2a5-d1f358f0143b","resolution":{"observed_at":"2026-08-12T05:43:50.863147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.843042Z","title":"Provably powerful graph networks","venue":null,"work_id":"cf6de389-849f-4dfc-8dd2-1b204d9b9086","year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.232920Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:730cdeea057d55298f87fc963bdba72d1f6ee3684f4220127c4e15b598acfb4b","observation_id":"e4600b10-0580-448f-a8e3-123591c66763","resolution":{"observed_at":"2026-08-12T05:43:50.847784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.237438Z","title":"Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.237438Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:a66260baaad15c0bdb35bfe0cc9033d1adc637bddc3c90f2966c4baa1b9d2c32","observation_id":"5edeb333-d507-4931-8c6a-f614b810ef35","resolution":{"observed_at":"2026-08-12T05:43:50.237438Z","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-12T05:43:50.827841Z","title":"Topology (2nd edn), 2000","venue":null,"work_id":"cdcf5f03-9f75-4d2e-b07d-050cbcf61b1c","year":2000},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.241813Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:14fc3d74464232fbe2b4ee31011644ef88ce12c30e6e86f68e68a86b165f62bd","observation_id":"421778e4-071f-45ed-b3a1-abb03be6d7a8","resolution":{"observed_at":"2026-08-12T05:43:50.833193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.812134Z","title":"Random features strengthen graph neural networks","venue":null,"work_id":"a60cfb2e-8281-4f32-a417-96dddb75c057","year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.247240Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:fa934f40131c81559b470d86e1bb2fda36a7d1196c353eee26422eeb220fc4e4","observation_id":"a042cbed-2b93-4b1a-b71b-dfdfa28a58db","resolution":{"observed_at":"2026-08-12T05:43:50.817039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.251626Z","title":"Modeling relational data with graph convolutional networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.251626Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:e530f1b24abc4045a4188945e44c2bbe60d95153204f3d13d958c2ff5c6fd0ec","observation_id":"b456e2f5-8a14-418a-bada-e6e02d7c236e","resolution":{"observed_at":"2026-08-12T05:43:50.251626Z","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-12T05:43:50.256301Z","title":"Adamm: Anomaly detection of attributed multi-graphs with metadata: A unified neural network approach","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.256301Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:29a32a1d29be7d6210c9146779a0eac24c24adbdfe0fc8555342cab24f30b664","observation_id":"a4868c62-6f8d-4328-a40a-23627d225d9e","resolution":{"observed_at":"2026-08-12T05:43:50.256301Z","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-12T05:43:50.788021Z","title":"Composition-based multi-relational graph convolutional networks","venue":null,"work_id":"79f58aaf-246e-4897-b84a-0e4a3196d4fb","year":2020},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.261257Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:89583a5b49ddf37ed01565fb7499588e251fdc4627092eb2f312db042025f309","observation_id":"96cecf91-36b1-45a3-909f-3481f528fd20","resolution":{"observed_at":"2026-08-12T05:43:50.792909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.772885Z","title":"Veličković, G","venue":null,"work_id":"90a2d4fa-070d-427d-9322-831905703232","year":2018},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.265775Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:ad1c058442da41a84b97c8c91352bd154beaa6e19c3fb241c6d15864029acd3f","observation_id":"b5f6ada4-93c2-4f46-b321-4a81e2e5fda2","resolution":{"observed_at":"2026-08-12T05:43:50.777713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.270366Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.270366Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:bdd73bc90d4a00b1bbbc69e4d9c4f95198adcbd04e3316a256e20873b737fd34","observation_id":"b8bc98f9-df14-4d8a-b9cd-d409a438f8ae","resolution":{"observed_at":"2026-08-12T05:43:50.270366Z","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-12T05:43:50.747185Z","title":"Identity-aware graph neural networks","venue":null,"work_id":"b9e874b3-ce2a-4e7f-b4fe-8e1abfd1922e","year":2021},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.274717Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:93082533846ee839f6ba417fa82e398bab14c1742896f436ad4d48d8eda4e5b4","observation_id":"fc1706ee-d7d0-4de4-8926-989b562cca91","resolution":{"observed_at":"2026-08-12T05:43:50.752738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T05:43:50.278985Z","title":"Deep sets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.278985Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:0edb4a61d162178c23f4a6dd293ed0e8dbc7577412bea3669f9890d1eeadf22b","observation_id":"ca16123b-a927-4b56-859e-3a9b3ce19f72","resolution":{"observed_at":"2026-08-12T05:43:50.278985Z","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-12T05:43:50.283678Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.283678Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:4830b16241a249053c2a4ab8ba681563df19162e7c9118daa4803779343319f8","observation_id":"dbf98188-73c6-4a08-9e75-d1f1790f90e1","resolution":{"observed_at":"2026-08-12T05:43:50.283678Z","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-12T05:43:50.289213Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.289213Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:4559cc04dc850ba6ca67f68a12a4b00e9b6b304049a33f71e2ed1a5edcbaa85d","observation_id":"9c583442-fc0d-410a-9b1f-d559e0480c7a","resolution":{"observed_at":"2026-08-12T05:43:50.289213Z","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-12T05:43:50.293810Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.293810Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:6ce406cd38a0870447a28745f403be1c7f199ab2c18657637e21a6e9139b4c6c","observation_id":"984d6786-f215-4681-9d5a-e1c850fce86b","resolution":{"observed_at":"2026-08-12T05:43:50.293810Z","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-12T05:43:50.298140Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.298140Z"},"links":{"citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:6e69ae39b9af07573a22572234b72e44431c775e20406d9eb47a49b9324d7756","observation_id":"194b724c-6337-47db-bd97-4614601a5e29","resolution":{"observed_at":"2026-08-12T05:43:50.298140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T05:32:42.947356Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:2412.00241."}