{"as_of":"2026-08-06T17:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0569d90b3d36f67c091b6f3b213b17f96b66bd40eebf3c4cf8febde046c69712","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-05-22T07:53:40.841765Z","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-06T06:34:29.942622+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/2605.22385/citation-record","integrity":"/paper/2605.22385/integrity","json":"/paper/2605.22385/citation-record.json","paper":"/paper/2605.22385"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yu , title =","venue":null,"work_id":"9c26e70d-134a-48df-9943-a6f12a7c73b0","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:3f8556230fa28fba05bd460482a05e6e2cb8ee0d2e2476296bda03c207b83bf8","observation_id":"2077774d-98dc-4b36-94c4-74252b1b7df9","resolution":{"observed_at":"2026-05-22T07:54:43.831294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"PloS one , volume=","venue":null,"work_id":"3634b0e2-110e-44f9-99dd-e5e37f61b1e5","year":2015},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:b7b31830b2c6f7305f8f46fedf2349a4dd244e641e6418999f4ad59dca116b9a","observation_id":"ca226989-b192-43a7-ad49-bec28e30aa67","resolution":{"observed_at":"2026-05-22T07:54:43.841535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Neuroimage , volume=","venue":null,"work_id":"4ba0606d-d51d-4c68-b843-25569674fc3c","year":2010},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:30d20a30f640f1a3257ab39f01cf4b741756002d2aa0bbf10f92543a8b8bbfcb","observation_id":"f8ac3b3f-41fe-44e1-a782-f2898c423ecc","resolution":{"observed_at":"2026-05-22T07:54:43.901936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"and Chmiela, Stefan and Gastegger, Michael and Schütt, Kristof T","venue":null,"work_id":"f108d6b2-d1ff-45f3-93ef-db493b99a98e","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:cd1d58c7be1205dab448e434ebdc83dba2b9cdc3853c9416ecbae15fa26b00d4","observation_id":"6eb88ba9-1551-4278-9602-0dae95f59d8d","resolution":{"observed_at":"2026-05-22T07:54:43.847666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Nature neuroscience , volume=","venue":null,"work_id":"dfb5b56c-9796-424a-8d40-f712552b1805","year":2019},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:42989700a1e7d3b8cd91d8e3d19eaa3b1e847a25db73427bb1d7603b6be3843b","observation_id":"487e5646-6156-49d7-8201-c164b910e90e","resolution":{"observed_at":"2026-05-22T07:54:43.850021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Digital Signal Processing , volume=","venue":null,"work_id":"cb859719-a3bc-4600-8df5-7f941bc8b047","year":2018},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:533bb85974e38f555a5b27196f1fcfe01d327e70ccfd6793a79c10daa94c0b8e","observation_id":"adc0b1ab-9715-4554-a3c2-285aa4264c6e","resolution":{"observed_at":"2026-05-22T07:54:43.834302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Explaining Deep Neural Networks and Beyond","venue":null,"work_id":"1824d62c-8af6-4c91-baf2-b55860aba034","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:5e4e6cd61c563c9709f998a911e1b29f95d9f6ca60f1be52d07a4e93bf7ae03f","observation_id":"ba0ded54-3acb-4578-97a6-35e0f306eaf8","resolution":{"observed_at":"2026-05-22T07:54:43.896299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-09T22:06:36.007131Z","title":"title =","venue":null,"work_id":"da53eb3e-c9e0-46f7-b03d-80b90142d12e","year":2006},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:29526c7da70b50c1adb0f11d67e2d462200e68341ef9f586ffd60971cda62930","observation_id":"04cb52be-e8a7-45dc-abc3-8f4ef3a53235","resolution":{"observed_at":"2026-05-22T07:54:43.825288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"7d2ab6b1-17e1-46ac-a348-d1fdd49aef86","year":2020},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:1e8a18a7a20720348e785753cc0468359d3529cfa723f506deaa8998424b311d","observation_id":"bfcfbfe6-ff51-43c0-a387-a9b5d157eb85","resolution":{"observed_at":"2026-05-22T07:54:43.822434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"GNNExplainer: Generating Explanations for Graph Neural Networks , booktitle =","venue":null,"work_id":"36faa0a2-c4ca-46bf-9396-291769340301","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:2163521893575a2a5046f0ce41f73e3cf3afe800db04e7845b196d989603bd1d","observation_id":"f5f39f68-a24e-450f-9b3c-b0dfcf4d9e15","resolution":{"observed_at":"2026-05-22T07:54:43.828325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Parameterized Explainer for Graph Neural Network , booktitle =","venue":null,"work_id":"717c7d1a-78e7-4242-ad00-e2d9538a1b51","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:599df0e84fb580a8ade3d5baff4cc53b280565be8261af886b1e80074cfbfa47","observation_id":"024b5294-48bf-4d65-bc4b-eeef6deb0878","resolution":{"observed_at":"2026-05-22T07:54:43.921984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On Explainability of Graph Neural Networks via Subgraph Explorations , booktitle =","venue":null,"work_id":"9f2b1e42-884c-4538-b9f3-36129482d41d","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:8b8dfccdc78b84e9ebb312c9a94754c5680fc2f45476da62c875b2996fe0366e","observation_id":"6b3f3dcd-9053-4f5a-bd43-0571320010e0","resolution":{"observed_at":"2026-05-22T07:54:43.837712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Vu and My T","venue":null,"work_id":"1100a30e-0fa5-41d3-b5c0-6dac9c94a62b","year":2020},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:89905d715d3ef7da45b2a57a47fde4e64719db45d8b59dd5d6293e6d6ada9c2c","observation_id":"ae545d35-fd2b-46ee-a44f-65dacaf4dd9c","resolution":{"observed_at":"2026-05-22T07:54:43.953845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T16:02:38.916055Z","title":"7th International Conference on Learning Representations","venue":null,"work_id":"9a6949d7-2337-4dbc-8ee0-7672a9db9ab4","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:0ed026d583165ae36af37e2e8b4c0177daea37db7e65f91793c0d9dbbf068e3f","observation_id":"095100d2-3590-446f-84f8-3ac8cf1de890","resolution":{"observed_at":"2026-05-22T07:54:43.918567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , title=","venue":null,"work_id":"b46f5fe1-bfb5-4f3a-8d75-9b28a979f1fd","year":2021},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:d8ba34331fa9920a49e55a82c16c8c75147a55703f3db52cc7ca13c7f11b664b","observation_id":"8776f0d2-3e01-480d-b11c-1aadd3d32206","resolution":{"observed_at":"2026-05-22T07:54:43.956800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Link Prediction Based on Graph Neural Networks , booktitle =","venue":null,"work_id":"c3d53c01-71ad-452e-9841-ff84222c77ea","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:24b540ded61189ceb0d8094c2506cd045a3b5eca6eac3769010e4895e0c41f9f","observation_id":"1e434d90-9b69-4b8d-b413-1635059649b7","resolution":{"observed_at":"2026-05-22T07:54:43.928726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Genome Medicine , volume=","venue":null,"work_id":"9aaa9bd8-9e4d-4b09-ac55-1201390a2575","year":2021},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:03311de53a23e0e55e835a52e5218ad2620572c7c7c7ed44996fba4bd5bded09","observation_id":"e2c73b5d-54a8-48be-9046-295797db7d65","resolution":{"observed_at":"2026-05-22T07:54:43.931910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"6th International Conference on Learning Representations","venue":null,"work_id":"6d95c89b-973b-4a23-87e7-dad52f335b9f","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:7d064739d26dc335dad7d9fe0a9b5f78e98e03fd2daae7302ec130db8233a6b2","observation_id":"c4e71dfd-a04d-470d-9483-56eb2e6e7385","resolution":{"observed_at":"2026-05-22T07:54:43.925446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Evolution of Graph Classifiers , year=","venue":null,"work_id":"ba41b62f-a372-4e5b-bfd1-e2d51e0187e7","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:baeee0a20712121bf98203807bcb8c6c82d6be4de41040ee8a3e0c5cbf9a7e36","observation_id":"ee8dd1d4-5561-40f3-8e35-e6109534ef39","resolution":{"observed_at":"2026-05-22T07:54:43.899218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Hamilton and Zhitao Ying and Jure Leskovec , editor =","venue":null,"work_id":"b9a87c62-d831-4e4a-8b03-01c16117c828","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:fb022931a802c3bf52567f414471d2043ab87222b0693ce64f88c08e8ae24e22","observation_id":"335c5938-bee2-4403-8910-aaed9c959ce5","resolution":{"observed_at":"2026-05-22T07:54:43.908515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Journal of Chemical Physics , volume=","venue":null,"work_id":"4e74d7aa-d21a-49c6-a0ed-173c0fb6b57f","year":2018},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:c0574790d950d314470ede4edc7f20ef7bb7cf74f4d0df68f7f1fd9c0a8733b1","observation_id":"6ae0ab87-0f59-40fc-b734-ed62feba8609","resolution":{"observed_at":"2026-05-22T07:54:43.889940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f65d434c-167c-4d22-95bf-bd4213f72afd","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:83047b369b6bbafd3e350e5302f8f3f6331eac25a03eb71f09d4485c2e624828","observation_id":"d0f761df-d24b-4206-acd4-82e429834f07","resolution":{"observed_at":"2026-05-22T07:54:43.914834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Kipf and Max Welling , title =","venue":null,"work_id":"cdeb643c-dd4b-4ada-855f-e9b85e860f99","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:84c60320e1572c2b9cedb9aee6a4c55130f6d8cc8e6588c49d05a8e95a0e7d97","observation_id":"a1492f8b-e608-474a-9a1a-7bfaafc6fd67","resolution":{"observed_at":"2026-05-22T07:54:43.884073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T21:11:29.718395Z","title":"Distill , year =","venue":null,"work_id":"c874fb30-efa7-49de-a172-5d088e594240","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:abc9902b940ad2bf9844b446f4b5401e35eec958fafe5ed4c6f774f23a48bbf5","observation_id":"f7592539-e8aa-4e03-8171-07a4aa3a4d2b","resolution":{"observed_at":"2026-05-22T07:54:43.886700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps , booktitle =","venue":null,"work_id":"ee7cc49f-c6bd-4dbe-a296-489ef05f99e7","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:0f39b68db525a2d9868d466079cc66985a52871206633380ae7e701b6416ffde","observation_id":"9362d25d-0c86-4a03-9c1b-a939b489902c","resolution":{"observed_at":"2026-05-22T07:54:43.893143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Real Time Image Saliency for Black Box Classifiers , booktitle =","venue":null,"work_id":"dddc5032-bd3d-41af-b8f9-4e42067992eb","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:abaa609305f56b5fb90f6cce7415726acb6828319831560f99af77139d8c2d2e","observation_id":"c168b2e2-da5c-47a1-acf7-c4f09cacc489","resolution":{"observed_at":"2026-05-22T07:54:43.904992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Wainwright and Michael I","venue":null,"work_id":"b7561cd0-2ef2-4d24-b777-ec5eacd2f4ff","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:50897e76995a11164ee559f315ff99f57b105e6af0a8adfb8272021005232eb1","observation_id":"7897c272-c687-4425-8e7d-7349b6f3bcf5","resolution":{"observed_at":"2026-05-22T07:54:43.947534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5b7f652c-9a3f-40bc-b4b4-3e6deb853f00","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:b059d8a0b1e9f5c2d4f0efbac1f91774f2797de50f44596ec519f8bdb7e5ee8d","observation_id":"0d0d90ec-b95a-48f5-a268-e139569b9d0c","resolution":{"observed_at":"2026-05-22T07:54:43.844750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"e105cef5-5eba-42e7-ab00-630fde390783","year":2019},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:2fb84e690f75b53473666621f69a430061b127587e6106717a1e573f7a119e70","observation_id":"05a2a9df-9616-43a5-929c-b0d663170566","resolution":{"observed_at":"2026-05-22T07:54:43.874537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Pope and Soheil Kolouri and Mohammad Rostami and Charles E","venue":null,"work_id":"4e3bed7c-a06b-422f-ac46-ff28ada7761b","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:de0cf66758e405924644a386dc98ff4caad4a45a20cf2da3db755683924aa190","observation_id":"86c1dda7-15a1-466f-a70b-c12e040e9c9f","resolution":{"observed_at":"2026-05-22T07:54:43.871228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"82ff0a10-7c6e-4029-982d-5a2c2de5d32b","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:a3b1c2133d7292f717d6e90e28f4ea0d89e3eb2e6d839ffc22464732840e4b2b","observation_id":"2e564e2c-306c-4813-b77d-42205ddfa8ba","resolution":{"observed_at":"2026-05-22T07:54:43.877955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"4715f20f-6606-4f5f-8a4e-b4779155bd75","year":2020},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:3f7cee9ddca5e16a2dc50b9be190bee4dca0c39b9e0b1ad885913d46f10d9df5","observation_id":"59d48e9d-c257-427b-8209-fd70b94a66d4","resolution":{"observed_at":"2026-05-22T07:54:43.868034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Spectral Networks and Locally Connected Networks on Graphs , booktitle =","venue":null,"work_id":"30ff1009-5b72-4b64-b224-ababea9dee6d","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:83631e253b23c8acc59494dbf2c14d2c6a41a395f594b5fffae6e3fb4f871857","observation_id":"3f86d86e-0451-4191-9491-4491b9ed2e21","resolution":{"observed_at":"2026-05-22T07:54:43.950828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering , booktitle =","venue":null,"work_id":"88ee85d2-ab96-4f01-b0a2-4da614e33cf3","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:42df7690d728ee63efdc2a8da0e14328b2e9a694947ecef1263e8ac6a3cd3977","observation_id":"afe506fc-813b-4bf0-bf0a-834ecab7899b","resolution":{"observed_at":"2026-05-22T07:54:43.944503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Reverend","venue":null,"work_id":"c738f3cf-fb06-43ec-a5c4-8ab0ab3d99c7","year":1982},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:c476ae19a5cb1c79722da8100d7583be3f0a53be22a554b05ef1afa05e82db38","observation_id":"02d5ec62-4f66-411e-b9ac-5d3b8c07fd11","resolution":{"observed_at":"2026-05-22T07:54:43.941126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"and Debnath, Gargi and Shusterman, Alan J","venue":null,"work_id":"425faff3-75cf-4dee-b5ee-37b9f3819e08","year":1991},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:2cef838978bebe85e33f766e950f5d04321c10f4e4d325f38dd769390e643b5f","observation_id":"5012a9c5-998c-4c7c-acf8-9ff3c602585f","resolution":{"observed_at":"2026-05-22T07:54:43.934905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Journal of Medicinal Chemistry , volume =","venue":null,"work_id":"36590811-3121-4692-80ad-382392eec64d","year":2005},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:b78e42fbabacdc2ad38442f3fb84fec3af2ce05eec04cfd488ad61f3496f4821","observation_id":"0eb7c86b-36cd-4528-895c-8c6a16b340aa","resolution":{"observed_at":"2026-05-22T07:54:43.857417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Manning and Andrew Y","venue":null,"work_id":"6b7c1d3f-804b-40d7-ad79-8c010b5bae4a","year":2013},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:3eb5e7eb3e74c9297334f4905c9065b9998757b95c2e403f4d8929a9338a0f19","observation_id":"02d26d89-342b-4e6c-a15e-5921bc22ec95","resolution":{"observed_at":"2026-05-22T07:54:43.855049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7f6677fe-d86c-4413-bad3-f40376926f9d","year":2015},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:a6be5f1fd210131f0157a3132f1a9892cb24415c2cf60633ce676c6c4d1650d8","observation_id":"de5e8fd2-3980-4a1d-88cd-af56ac00213e","resolution":{"observed_at":"2026-05-22T07:54:43.911716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-07-06T09:17:02.233694Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":"2005.00687","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-07-04T00:49:18.647891Z","title":"arXiv preprint arXiv:2005.00687 , year=","venue":null,"work_id":"febc0dde-22e6-4f9c-b652-10e1c530b2cc","year":2005},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:60e6f6e42e4c54233e506361baa5c3c9d47cba27d6fc98863dbc09a7513c51a4","observation_id":"4e0b7c82-a3f9-4318-89d1-4fd4d284f189","resolution":{"observed_at":"2026-05-22T07:54:43.110168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A Unified Approach to Interpreting Model Predictions , volume =","venue":null,"work_id":"ecadf82a-0d49-4b26-89aa-e77217c9e950","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:829e5705e2e5b2303b68fd1cf306584806f4b61239259db2bb537de6960c4497","observation_id":"dadbc2e9-ba4c-4bb8-bf1d-0af18ec226eb","resolution":{"observed_at":"2026-05-22T07:54:43.859825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-09T18:26:27.028654Z","title":"and Riley, Patrick F","venue":null,"work_id":"9a929a94-8f7b-4f3b-814f-2823c0c1b648","year":2017},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:340a832d7fe4e50c03a522778078ef8b5d327c7696e4a7dc958208a20beccce4","observation_id":"bbee7961-a582-447f-a9a6-a491af96b586","resolution":{"observed_at":"2026-05-22T07:54:43.863884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Journal of Medicinal Chemistry , volume =","venue":null,"work_id":"f30776d9-50e8-4ca6-b3d0-900a3054019d","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:8f586586b5603c52e39041ad04c17870681ad1b202a06a824679b55b705e318a","observation_id":"777068bb-88f2-466a-a1a0-b8b4b1c1b826","resolution":{"observed_at":"2026-05-22T07:54:43.881232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cb49e3ea-bbf4-4275-9c5a-cdbeaf56a212","year":null},"citing_paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-22T07:53:40.841765Z"},"links":{"citing_paper":"/paper/2605.22385"},"observation_digest":"sha256:479e356a43d4de794510f6da3f9d51a3f808ec71e0673b0d533c9dbcb355b1c8","observation_id":"bd500180-b7b4-41b4-b651-4fa32330ded7","resolution":{"observed_at":"2026-05-22T07:54:43.852452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.22385","last_updated":"2026-05-21T12:16:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:16:19Z","title":"Efficient Higher-order Subgraph Attribution via Message Passing"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":38},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2605.22385."}