{"as_of":"2026-08-13T23:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fa70267662902a731adc4089c7c3a819c9782463c9e805b36ebdd556fdc5f94","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T04:16:22.410668Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2502.03703/citation-record","integrity":"/paper/2502.03703/integrity","json":"/paper/2502.03703/citation-record.json","paper":"/paper/2502.03703"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T04:16:22.204227Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.204227Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:13a5fde721762bb3f70567f058b7d2f814e5350f8c265f5c0c258c3fadf32a25","observation_id":"89676e32-1c06-4a69-a9a6-2488fb13bf4a","resolution":{"observed_at":"2026-08-09T04:16:22.204227Z","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-09T04:16:23.093506Z","title":"and Lelarge, M","venue":null,"work_id":"62236c57-4615-4f95-aaa7-ca39ad203e17","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.211192Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:8af43ee5d16c578ca9ad0ff8f3afa06c27ab78025b0c00e980cd8557a1ad510e","observation_id":"b7a33e55-ba9d-440e-b8fd-4d6709222972","resolution":{"observed_at":"2026-08-09T04:16:23.098539Z","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-09T04:16:23.077608Z","title":"A topological characterisation of Weisfeiler-Leman equivalence classes","venue":null,"work_id":"e4f72594-59be-413c-821f-6f631b15a5d6","year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.216858Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:06e2995f2dae72871fd5211a4b3763b0398f84c2772b4537d152af95e8d5f670","observation_id":"3f947c38-06b9-4e57-b0bf-73b96eb49a0e","resolution":{"observed_at":"2026-08-09T04:16:23.082482Z","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":"2110.02910","last_updated":"2022-03-16T22:16:25Z","snapshot_observed_at":"2026-08-11T02:45:18.386388Z","submitted_at":"2021-10-06T16:45:07Z","title":"Equivariant Subgraph Aggregation Networks","version":3},"cited_work":{"arxiv_id":"2110.02910","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02910","snapshot_observed_at":"2026-08-09T04:16:22.604086Z","title":"Equivariant Subgraph Aggregation Networks","venue":"cs.LG","work_id":"cfeaa983-ae6d-4ca0-b6c4-68a040a730bb","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.222456Z"},"links":{"cited_paper":"/paper/2110.02910","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:83b813cc503095b5170aebe3158f50272d211528a32c61268f9c7c1e2bf9bdb0","observation_id":"ea328002-0fba-4d22-8094-a9bcd3dd7af4","resolution":{"observed_at":"2026-08-09T04:16:22.608587Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T04:16:23.062514Z","title":"An optimal lower bound on the number of variables for graph identification","venue":null,"work_id":"858ef438-aff9-40e2-855d-be0cb4a2340e","year":1992},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.228691Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:c5ed14bc5b37ad5bf3358eb5838a278c871f70e8be1587d5669ffb90b017f6ff","observation_id":"db92a191-27de-4ece-95ab-fc1334684085","resolution":{"observed_at":"2026-08-09T04:16:23.067294Z","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-09T04:16:23.047792Z","title":"On representing linear programs by graph neural networks","venue":null,"work_id":"38e2b91b-e2e3-4429-98e7-d131e6530712","year":2023},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.233984Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:755cbf721fdac165b2c70bafd16d93984d1031d00c28de8560a2670210e11903","observation_id":"2a7dcba7-10fc-4b65-b50d-7e1fe7f96b4b","resolution":{"observed_at":"2026-08-09T04:16:23.052606Z","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-09T04:16:23.033331Z","title":"W., Jin, W., Rogers, L., Jamison, T","venue":null,"work_id":"6055fda7-79cd-43b7-9b3d-513dd5069a65","year":2018},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.238786Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:18634cab258e6bf7dbbd8f15bef313dc2a6fe2e43c13ff07d200655dc58ef6b7","observation_id":"0e6b0478-7bd1-4ff6-8b9e-b36f07825d02","resolution":{"observed_at":"2026-08-09T04:16:23.038180Z","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-09T04:16:22.244611Z","title":"P., Joshi, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.244611Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:96cb047ba98435195deb089fd3bd0258fe0dd960b23f7549b5a81c86dee799c6","observation_id":"9211d598-7bba-45af-8b1a-b29cbff12071","resolution":{"observed_at":"2026-08-09T04:16:22.244611Z","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-09T04:16:23.008511Z","title":"How powerful are k-hop message passing graph neural networks","venue":null,"work_id":"6fcd99d2-0e12-4f06-86f5-89d30c8230f3","year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.249721Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:ba3454ea92f1b8668149f7a88e11ddfbc95df2fec42ac9f2b36c3835d7b16ac2","observation_id":"13442d1e-b8df-448f-b06f-7dccdd0a8050","resolution":{"observed_at":"2026-08-09T04:16:23.013389Z","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-09T04:16:22.992935Z","title":"Understanding and extending subgraph GNN s by rethinking their symmetries","venue":null,"work_id":"8c0fafce-8152-4b84-a0ab-ce4785577cc8","year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.254758Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:a254a99db54e9b44b3561e00b2a52d0f55a7252042adda5c3c43f891c47296b2","observation_id":"4bef5d95-cfda-4ad0-ad8c-780d5aec4895","resolution":{"observed_at":"2026-08-09T04:16:22.997492Z","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-09T04:16:22.976987Z","title":null,"venue":null,"work_id":"218198e3-ccee-4676-809d-889ae7d5ba74","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.259503Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:add702411541cdb3c9efab266aa85c2156dfa4ec313b732877fb9d3629286a1c","observation_id":"4480c658-1156-4755-bc47-4f91e3f52e17","resolution":{"observed_at":"2026-08-09T04:16:22.981460Z","resolver_source":"raw_fallback","status":"unresolved"},"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-09T04:16:22.961599Z","title":"Exact combinatorial optimization with graph convolutional neural networks","venue":null,"work_id":"c2b7cd25-4ef5-4fca-b552-44770295bf95","year":2019},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.264361Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:73202639a2920af33f875a5abb5269402967c8b0bb74ad78f7d9bb804d60ff4d","observation_id":"db7b2287-9f0d-4584-af61-7ff407095b86","resolution":{"observed_at":"2026-08-09T04:16:22.966675Z","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":"2007.12035","last_updated":"2020-07-23T14:30:51Z","snapshot_observed_at":"2026-08-12T19:13:56.142644Z","submitted_at":"2020-07-23T14:30:51Z","title":"The expressive power of kth-order invariant graph networks","version":1},"cited_work":{"arxiv_id":"2007.12035","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.12035","snapshot_observed_at":"2026-08-09T04:16:22.582612Z","title":"The expressive power of kth-order invariant graph networks","venue":"cs.LG","work_id":"36c7c921-d22c-44c1-af74-94b29e5c78bd","year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.269145Z"},"links":{"cited_paper":"/paper/2007.12035","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:316df84473add0e868266c740e16bb95ab13f6c23b40bb28ecea0b262154d6c6","observation_id":"42808088-1177-47d6-ab55-bbd6b4a8b082","resolution":{"observed_at":"2026-08-09T04:16:22.587847Z","resolver_source":"local_arxiv","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":{"arxiv_id":"2006.09499","last_updated":"2020-06-16T20:24:01Z","snapshot_observed_at":"2026-08-09T21:19:51.430539Z","submitted_at":"2020-06-16T20:24:01Z","title":"Walk Message Passing Neural Networks and Second-Order Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.09499","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.09499","snapshot_observed_at":"2026-08-09T04:16:22.557977Z","title":"Walk Message Passing Neural Networks and Second-Order Graph Neural Networks","venue":"cs.LG","work_id":"fa660c48-74d3-465a-b55b-0aa137fc91b8","year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.274048Z"},"links":{"cited_paper":"/paper/2006.09499","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:10e2b6d0cac87f31ea8d9e8b69463c181f7eb98445dcea89ecb312ce2c259011","observation_id":"38cbd877-adb4-4512-89cf-e7532f1126ca","resolution":{"observed_at":"2026-08-09T04:16:22.564875Z","resolver_source":"local_arxiv","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-09T04:16:22.279166Z","title":"and Reutter, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.279166Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:a1d444d4b492139c078b7930665541f291a51b3dd4c0ab5a5ccaf7abfee973bc","observation_id":"3f94984e-fe3e-4603-b4eb-85f4a62c0c6c","resolution":{"observed_at":"2026-08-09T04:16:22.279166Z","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-09T04:16:22.933680Z","title":"S., Riley, P","venue":null,"work_id":"78d26516-5a81-4147-95b6-bc9381d6cc7f","year":2017},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.283217Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:225fa46ae7deef68055bbdf3e3d6bc1d1a61fc2b550fb176520fdf932c4feddb","observation_id":"2c67c339-43e2-4fd6-aaeb-0e19c3709c00","resolution":{"observed_at":"2026-08-09T04:16:22.939212Z","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-09T04:16:22.287236Z","title":"N., Duvenaud, D., Hern \\'a ndez-Lobato, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.287236Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:ec56feb7d970023aa0efd8e696e4b16878ca64a514ee3860bbe8af96732ad1ed","observation_id":"7566ff33-cabf-4aa9-b74e-d178fadd7bbc","resolution":{"observed_at":"2026-08-09T04:16:22.287236Z","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-09T04:16:22.900853Z","title":"L., Ying, R., and Leskovec, J","venue":null,"work_id":"f6dabde8-8c87-4c96-a9b8-ed96de10f1a8","year":2017},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.291266Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:05a5660873d5a8554836de2dd886c8e69d88439abdd15d940cac3a603b220efb","observation_id":"7d6b73cc-d48b-4488-b0eb-f725436eec7c","resolution":{"observed_at":"2026-08-09T04:16:22.908549Z","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-09T04:16:22.884363Z","title":"An overview on the application of graph neural networks in wireless networks","venue":null,"work_id":"e0e7d180-528d-4aae-9dfe-113f334ba74f","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.295415Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:698d8f5cb954ceeba54abf30bc2f3e7b809dfeb55820dd9b5a08693d35a058bb","observation_id":"bb99d8b7-ddb2-4418-834a-de3d8087686c","resolution":{"observed_at":"2026-08-09T04:16:22.889525Z","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-09T04:16:22.868133Z","title":"Boosting the cycle counting power of graph neural networks with I ^2 - GNN s","venue":null,"work_id":"5d0bd7eb-ee82-4c51-951b-102fa0196c15","year":2023},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.300131Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:57c1ef82ea7d1226801bb3355f3dfa307f22dac67f934c04a2cebad655208e23","observation_id":"835d9134-e3b0-4a17-9139-41b4bd3c0e7c","resolution":{"observed_at":"2026-08-09T04:16:22.874028Z","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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-09T04:16:22.304254Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.304254Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:ecf555414c426ef59ab6d0e4d6bb0300b3c06414771139426739163c71dfe5d1","observation_id":"1766c244-8a36-4308-9f72-ad4f7fc8dc89","resolution":{"observed_at":"2026-08-09T04:16:22.304254Z","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-09T04:16:22.848156Z","title":null,"venue":null,"work_id":"76aa8763-ae16-444c-9802-66da2964d23c","year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.308859Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:302dc340ad79420f70a5bdc0bc629f5f6cec9b6c7bc085055a0a18d2ee0bac71","observation_id":"8263f13f-7e58-4dd6-bfa8-47dd5ebac69e","resolution":{"observed_at":"2026-08-09T04:16:22.855972Z","resolver_source":"raw_fallback","status":"unresolved"},"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-09T04:16:22.830380Z","title":"R., Wang, Y., and Wang, Y","venue":null,"work_id":"b5e05db9-8c2a-48bd-94d2-0f5581eddfc3","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.312909Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:76e890670348c88fc9e1b5d9cbd388db000347d6ec4595bf59ceb9b89b0d8c41","observation_id":"1ce1a6a3-0eae-4cb7-8f10-3caa1cc5cf2f","resolution":{"observed_at":"2026-08-09T04:16:22.835233Z","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-09T04:16:22.814974Z","title":"Provably powerful graph networks","venue":null,"work_id":"7a3e1971-2804-49f5-83d3-46d16f652c65","year":2019},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.317262Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:3748ea46d8a76fd631e20a585e29e2be0aa6c93f29fac163abd1c79dfe2415d7","observation_id":"17605271-d3ce-43f7-8698-a8aa42d5adc2","resolution":{"observed_at":"2026-08-09T04:16:22.819361Z","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-09T04:16:22.800737Z","title":"L., Lenssen, J","venue":null,"work_id":"811f1ff4-e939-419f-a5f0-312d0b58286d","year":2019},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.321313Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:e43ad2d324d1ca60dd8d63ae383c67fd0a98903ca148e7dc0964d3f0789fc6c4","observation_id":"2e27fb65-f2db-4b4c-831b-9933b4c80cf6","resolution":{"observed_at":"2026-08-09T04:16:22.805151Z","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-09T04:16:22.785687Z","title":"Weisfeiler and Leman go sparse: T owards scalable higher-order graph embeddings","venue":null,"work_id":"d1ca2bc8-0902-4a3d-a236-822079ecd02e","year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.325140Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:46d3d7a85e933654066a0a93621424e0d1106abb615d3a7fc8008f50c966cec9","observation_id":"8540983f-c0a7-4b18-8421-d6e94d1e536a","resolution":{"observed_at":"2026-08-09T04:16:22.790692Z","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-09T04:16:22.770945Z","title":"Graph neural networks for materials science and chemistry","venue":null,"work_id":"76ab1834-75a3-4b57-8136-40213c94d50f","year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.328800Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:64d28245349b93026984bc0600448196a9be50f726d3c582039c64cb5cf095f7","observation_id":"8a0afef5-c472-48fc-8fcc-b999c58e8ab6","resolution":{"observed_at":"2026-08-09T04:16:22.775512Z","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-09T04:16:22.333188Z","title":"C., Hagenbuchner, M., and Monfardini, G","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.333188Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:dd897ab6d8fd35fab5973a101f51e87b77fcfbeb9cbf21d6f8058d3773a13706","observation_id":"d74094e0-1bda-4f14-b2bd-4d9c34f3f790","resolution":{"observed_at":"2026-08-09T04:16:22.333188Z","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-09T04:16:22.337217Z","title":"Graph neural networks in particle physics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.337217Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:d5e1482ceade3000634395c87806518b3e15d144268320b095a9029e8bd3e62a","observation_id":"2535e268-88ad-4378-ac2b-1cf7c61fc419","resolution":{"observed_at":"2026-08-09T04:16:22.337217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-09T04:16:22.341319Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.341319Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:f6f536dec5e91f0c08db548387145533224f00a71a6a76423b6aaa5c5034bd13","observation_id":"16772941-c060-49c2-9199-b5f92fea925b","resolution":{"observed_at":"2026-08-09T04:16:22.341319Z","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-09T04:16:22.345662Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.345662Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:ab2c4eff4dbd1ee692bc9de06be61d55640b210b7d702d5bfd2a4c204fff561e","observation_id":"eca099c6-b582-4053-8337-cc2b5490aa43","resolution":{"observed_at":"2026-08-09T04:16:22.345662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.15367","last_updated":"2022-04-26T17:59:28Z","snapshot_observed_at":"2026-08-13T17:27:04.414879Z","submitted_at":"2021-11-27T02:52:10Z","title":"A Review on Graph Neural Network Methods in Financial Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.15367","snapshot_observed_at":"2026-08-09T04:16:22.349802Z","title":"A review on graph neural network methods in financial applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.349802Z"},"links":{"cited_paper":"/paper/2111.15367","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:527f218e9f0934c3ac64afe70f550db0d5da86b2f8f6829ab947a04562a49cf9","observation_id":"46fdecb8-ed97-49a6-90c8-d8e41741809d","resolution":{"observed_at":"2026-08-09T04:16:22.349802Z","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-09T04:16:22.726646Z","title":"and Leman, A","venue":null,"work_id":"ec920472-e75b-4815-9376-43df7b893177","year":1968},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.354806Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:886be50f87a08f47708527e84709248177c892e43c14cbf6b63b3f350b7ed427","observation_id":"275f5d1b-0b3e-4cb2-a31b-69e244e67d89","resolution":{"observed_at":"2026-08-09T04:16:22.730974Z","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-09T04:16:22.711896Z","title":null,"venue":null,"work_id":"f7e9ee98-dcba-4a3c-a884-a4887970169f","year":1999},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.360076Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:cea2c178c1072911dfd6d2c48d3e086cd40fca5498abbee440b50b300c2cd24d","observation_id":"088b7b1b-c044-4595-95e1-dd9bf21acd0f","resolution":{"observed_at":"2026-08-09T04:16:22.716844Z","resolver_source":"raw_fallback","status":"unresolved"},"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-09T04:16:22.364808Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.364808Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:b755d89fd7ea9796798822e593afd458f05e73570d1d8d9ec9d8f9254cc86e7e","observation_id":"01879a49-cfb6-4d60-8432-07243db209ce","resolution":{"observed_at":"2026-08-09T04:16:22.364808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-09T04:16:22.370203Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.370203Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:f913f79be7ad45ae31c239dfdaf315dca12d72d30337cc8e3a659add941669d5","observation_id":"a60c6484-d90d-4901-a82b-6d27ce2ddd5f","resolution":{"observed_at":"2026-08-09T04:16:22.370203Z","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-09T04:16:22.375432Z","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":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.375432Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:059d99662ab77d79dfd8e430b6fc2d084ed5d4eaf9c973d4f5749c64409e749b","observation_id":"a0da53f0-1961-478f-8d81-a313c0a8f129","resolution":{"observed_at":"2026-08-09T04:16:22.375432Z","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-09T04:16:22.380202Z","title":"Do transformers really perform badly for graph representation? Advances in neural information processing systems, 34: 0 28877--28888, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.380202Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:2febac3a95b315fc07e8c62e14d9353200606aea605a22ad7232c3987d0e1141","observation_id":"be9850d4-cb97-4428-9e9c-a70df8d4dce6","resolution":{"observed_at":"2026-08-09T04:16:22.380202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.09505","last_updated":"2024-02-11T03:44:23Z","snapshot_observed_at":"2026-08-13T12:59:33.680885Z","submitted_at":"2023-01-23T15:58:59Z","title":"Rethinking the Expressive Power of GNNs via Graph Biconnectivity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.09505","snapshot_observed_at":"2026-08-09T04:16:22.384732Z","title":"Rethinking the expressive power of GNN s via graph biconnectivity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.384732Z"},"links":{"cited_paper":"/paper/2301.09505","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:0dbe0752ff3b3b3c40eb1694661ee580cb88c274527e86a5a4a76e96b12ab419","observation_id":"c8aad00b-e56a-44cc-9bf6-fba901cf6c07","resolution":{"observed_at":"2026-08-09T04:16:22.384732Z","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-09T04:16:22.666987Z","title":"and Li, P","venue":null,"work_id":"cab1bf34-bd4e-4f1e-be96-72cb282e1032","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.389506Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:36660ae7585e14dc4ce1598e580d6ef8ad9b7c3f45750e4c7086596ed2acd7a6","observation_id":"4ec70005-30a2-4cfc-8b59-81b58a21afc7","resolution":{"observed_at":"2026-08-09T04:16:22.671811Z","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-09T04:16:22.649798Z","title":"Graph neural networks and their current applications in bioinformatics","venue":null,"work_id":"07ae4a2a-03e0-4879-84ef-48af09724b26","year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.394616Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:dce99c9552caf35be5beec379ba48e41c1527f0c2d52862cdc77dd8d0a5e2976","observation_id":"ef7126a4-aa66-412b-a8b8-b6ac11ba2131","resolution":{"observed_at":"2026-08-09T04:16:22.655707Z","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":"2110.03753","last_updated":"2022-04-20T23:45:18Z","snapshot_observed_at":"2026-08-13T17:57:34.751486Z","submitted_at":"2021-10-07T19:08:08Z","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.03753","snapshot_observed_at":"2026-08-09T04:16:22.399863Z","title":"From stars to subgraphs: U plifting any GNN with local structure awareness","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.399863Z"},"links":{"cited_paper":"/paper/2110.03753","citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:e82a251962196147ad3f9310295e41105e82fbecb0de423eeaddfc6fdcbb3817","observation_id":"8c8d71d7-8b07-4eb9-b2cb-ce5e318fc299","resolution":{"observed_at":"2026-08-09T04:16:22.399863Z","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-09T04:16:22.632911Z","title":"A practical, progressively-expressive GNN","venue":null,"work_id":"cd2b97f9-fd81-4270-beb7-c684d5a1f6fb","year":2022},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.404787Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:d78e5955a70c11d0a71c326bff6c28ffe71b533c8db0da044da81830e7a90f48","observation_id":"56fbc1a5-70e1-4c25-bd7c-b44d731af0c7","resolution":{"observed_at":"2026-08-09T04:16:22.638883Z","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-09T04:16:22.619154Z","title":"Graph neural networks: A review of methods and applications","venue":null,"work_id":"7bb19f82-193f-4c82-b7ae-46627877fbd9","year":2020},"citing_paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T04:16:22.410668Z"},"links":{"citing_paper":"/paper/2502.03703"},"observation_digest":"sha256:768dd47c5c895a3c7fa1e903366ab22709e34fc5070edb7d1360be446a2433d8","observation_id":"9de52cca-db74-4e28-bf65-e1fd5796cca6","resolution":{"observed_at":"2026-08-09T04:16:22.623424Z","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"}}],"paper":{"arxiv_id":"2502.03703","last_updated":"2025-02-06T01:25:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T02:45:39.729836Z","submitted_at":"2025-02-06T01:25:22Z","title":"On the Expressive Power of Subgraph Graph Neural Networks for Graphs with Bounded Cycles"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":3,"verified_fuzzy":22},"total_outbound_references":44},"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 13 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2502.03703."}