{"as_of":"2026-08-17T21:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66883a5122ccc5fc8a0dd1e7d8029e50a203f8a42d5cf5e7599bb383ee60445b","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:01:54.249641Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2505.05785/citation-record","integrity":"/paper/2505.05785/integrity","json":"/paper/2505.05785/citation-record.json","paper":"/paper/2505.05785"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.02893","last_updated":"2020-03-27T19:07:58Z","snapshot_observed_at":"2026-08-16T03:32:37.688772Z","submitted_at":"2019-07-05T15:26:26Z","title":"Invariant Risk Minimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.02893","snapshot_observed_at":"2026-08-15T23:01:53.971105Z","title":"Invariant risk mini- mization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:53.971105Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:106b72e40fd0aabe9a5bd4cc66add3cae385a5a59154286cf3fb9853776f896f","observation_id":"d46bc9f8-489b-470c-bbe2-85404b1899fd","resolution":{"observed_at":"2026-08-15T23:01:53.971105Z","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-15T23:01:54.824218Z","title":"Probability and measure theory","venue":null,"work_id":"f73336c9-011d-4dd4-9fd4-ff054e40aa2f","year":2000},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:53.975968Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:d0e1f0c8454c6e74a144484df6959e23f2b6d3204f0b81c64909d9e03efd3680","observation_id":"e90e5db7-d332-4e15-8215-c28027be9cc7","resolution":{"observed_at":"2026-08-15T23:01:54.827981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.811054Z","title":"Graph neural networks in network neuroscience","venue":null,"work_id":"bbf95b6e-af52-49f1-b674-8b7695314fa5","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:53.981249Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:b9ad4b57b92ae61e5a26a131b023bd277dcf093ab595eb67b828d86ee5592612","observation_id":"6e0995bb-22cb-403c-8150-7e70a2df35e6","resolution":{"observed_at":"2026-08-15T23:01:54.815516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.798302Z","title":"Gccad: Graph contrastive learning for anomaly detection","venue":null,"work_id":"2d27659b-90a2-443e-a349-cd5ec27ab3bf","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:53.985749Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:3f22b147862fa9b21fccf565918c3d3b6c3814a1edacdfd61c347d19c5e48fe5","observation_id":"62b04487-ca01-4903-a7f8-ea312a93fe41","resolution":{"observed_at":"2026-08-15T23:01:54.802285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.785995Z","title":"Learning causally invariant representations for out-of- distribution generalization on graphs","venue":null,"work_id":"d25f4ba1-e9ff-477c-a110-936d36d18bc9","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:53.990138Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:68d8db90622738732f36e0a31721625bc6cb4ada701f2375422f1cfc16363a1b","observation_id":"724e1215-d0b6-4f3f-bcaf-1b77f2765795","resolution":{"observed_at":"2026-08-15T23:01:54.790383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.773877Z","title":"Investigating out-of-distribution generalization of gnns: An architecture perspective","venue":null,"work_id":"0ca59610-e651-41ef-a090-4d4d598a106e","year":2024},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:53.994438Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:099e67789dd6a8239a8a78aca6f63d63873da87284c73f58f7932d77605fa3d7","observation_id":"9f21a173-0d0d-49ed-8f2b-4afb56932711","resolution":{"observed_at":"2026-08-15T23:01:54.777770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.761083Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"9dc86742-f8da-445b-93fb-a58e6563a938","year":2017},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.000425Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:b828dd0005e679e98754c0f6103d917c21b592cc883fc561540e487c73ac09a2","observation_id":"ddd13ec4-b3e3-45fa-8c39-e35fc33e7b5d","resolution":{"observed_at":"2026-08-15T23:01:54.765447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.748356Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"fd0d2000-db4a-4c2f-a5a2-7b7b3b6dbbe4","year":2020},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.005241Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:0e755df9d1f0333161f20bc355541ddd3874c7354bde558e7b89b85374c026b5","observation_id":"220dfe7e-b8d2-4166-8970-0973635b84e3","resolution":{"observed_at":"2026-08-15T23:01:54.752806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.009035Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.009035Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:52bd940abe9d519554e12366a7bd711caf95202453e34ebff2feaa30da5dd443","observation_id":"2d876b14-e13a-429d-886d-578b73e206ac","resolution":{"observed_at":"2026-08-15T23:01:54.009035Z","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-15T23:01:54.728945Z","title":"Klicpera, A","venue":null,"work_id":"211f871c-3178-4867-aac2-ac6e7d642109","year":2019},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.012856Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:64503b770e28023a1a25c845a36b2989608d0e59c3a11fcb5fb15f4479925e19","observation_id":"dc56dfbb-9f72-4548-ba39-d9b56784ed9e","resolution":{"observed_at":"2026-08-15T23:01:54.732785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.716915Z","title":"Out-of-distribution generalization with maximal invariant predictor","venue":null,"work_id":"c30c1f27-3e63-47a2-a671-ae8ac8cb6c85","year":2020},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.016644Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:26bd4cc9a04e03a502aeaf4440cda6213c7ab2175e4afb74c6032c44e0afd020","observation_id":"f7e5ab30-20be-48f7-be98-ebb11466613e","resolution":{"observed_at":"2026-08-15T23:01:54.720868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.022280Z","title":"Estimating mutual information","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.022280Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:70dfdcb5d3561df4de85dd4d3a81dc2f3fbfd26fd74fc4a7ecf78c9ae5047eb2","observation_id":"fc96d285-37ba-42bb-a443-6283b7f907e3","resolution":{"observed_at":"2026-08-15T23:01:54.022280Z","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-15T23:01:54.696834Z","title":"Rethinking node-wise propagation for large-scale graph learning","venue":null,"work_id":"75828d5d-d731-4702-9118-af5a0f839b47","year":2024},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.026251Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:c3a5752cb3b6e81693d96702dd8f83f045c06cba55d96be5b0f2088a99217053","observation_id":"526cf49c-9dcd-4311-adf9-277399831ba7","resolution":{"observed_at":"2026-08-15T23:01:54.701254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.030917Z","title":"Revisiting graph contrastive learning from the perspective of graph spectrum","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.030917Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:e4bcc7c7a2d628c3d2b3010ecdd1d25e30d1ff832fffed500be1338bd232234e","observation_id":"7995be03-03d4-46af-bae1-b506d629f110","resolution":{"observed_at":"2026-08-15T23:01:54.030917Z","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-15T23:01:54.675355Z","title":"Estimation of mutual information using kernel density estimators","venue":null,"work_id":"14da8713-1c96-4293-b878-399b1c986727","year":1995},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.034421Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:848184aab8148d32db746e160b966e783416bae618dc101d16e6d58dff564633","observation_id":"d906d589-ac26-4d88-93b6-4d15c9e53ce8","resolution":{"observed_at":"2026-08-15T23:01:54.679325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.662529Z","title":"Geom-gcn: Geo- metric graph convolutional networks","venue":null,"work_id":"314ac3a8-c077-40ed-9640-2602c7445e99","year":2020},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.038028Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:0af0cf73dd126c978cce2dbd97a6524de0e236d21e102f37518fabc10979bb7b","observation_id":"944258b2-afcd-44bc-9cce-7855849028cb","resolution":{"observed_at":"2026-08-15T23:01:54.667407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.649775Z","title":"Multi-scale attributed node embedding","venue":null,"work_id":"ac5118f0-e967-4d1d-a37a-c3704cd4e484","year":2021},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.042047Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:5a7b2a29064d3517ff6e50ffc8262cba8f3c14c2933ebd7d0e4fb67c3c59bb53","observation_id":"da73ac2a-0c54-4fc3-98f0-05bd8804227c","resolution":{"observed_at":"2026-08-15T23:01:54.653828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.635267Z","title":"Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models","venue":null,"work_id":"bdd813ff-7793-46c7-a047-3637c953d5c8","year":2020},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.045903Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:9ce773213676a93c54f9cbd8240e4f800af3b7c76ed052b2dce9b6c18aa00b1f","observation_id":"d1095c1d-91c2-43ed-93f6-279beb3e3eee","resolution":{"observed_at":"2026-08-15T23:01:54.641035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.049517Z","title":"Density estimation for statistics and data analysis","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.049517Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:895182cccb3706685afb084d99d7ea8deb2935f7ef0a8ed95b8cd5a098a1d5f3","observation_id":"ddcbc771-5e8e-4584-a567-bf2eb7bfa520","resolution":{"observed_at":"2026-08-15T23:01:54.049517Z","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-15T23:01:54.612966Z","title":"Graph-based semi-supervised learning: A comprehensive review","venue":null,"work_id":"992af861-78e7-48d6-a0eb-729ab9622e7e","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.167310Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:c0a0b49f9c91531b3a1b5c02f28d5f301d29f2d78433e52e11688db222c9ef66","observation_id":"a8bbd06d-f1b2-4e7f-ac73-aafabdc2be2d","resolution":{"observed_at":"2026-08-15T23:01:54.617324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.600513Z","title":"The mu- tual information: detecting and evaluating dependencies between variables","venue":null,"work_id":"072cb902-5539-4e90-b54e-2d51cdce8949","year":2002},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.171219Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:8055904b24c30812e867d7922559969c818cc0dafe419edb389d43302cc6d660","observation_id":"f4874135-f6c2-4a10-b98d-0c5a9ddd2712","resolution":{"observed_at":"2026-08-15T23:01:54.605039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.175076Z","title":"Dirw: Path-aware digraph learning for heterophily","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.175076Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:a5c4328ac227f3c7a672baef807c0019d75c299bf5d73f51c9a6249894fad766","observation_id":"7489932f-6d0f-4167-b7d1-e46257dfd37f","resolution":{"observed_at":"2026-08-15T23:01:54.175076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04111","last_updated":"2024-03-11T01:25:39Z","snapshot_observed_at":"2026-08-16T14:36:55.522594Z","submitted_at":"2023-12-07T07:54:11Z","title":"Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04111","snapshot_observed_at":"2026-08-15T23:01:54.178921Z","title":"Breaking the entanglement of homophily and heterophily in semi-supervised node classification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.178921Z"},"links":{"cited_paper":"/paper/2312.04111","citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:d09125fcbf491ea378d04a2220c83865fc840acae64432e316ebe0f218d5fab9","observation_id":"2283f18f-0752-4bf6-8e58-5e3b7dfa41e1","resolution":{"observed_at":"2026-08-15T23:01:54.178921Z","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-15T23:01:54.586719Z","title":"Rethinking graph neural networks for anomaly detection","venue":null,"work_id":"60d26ee9-acea-4a9e-bc59-fd252c45fdbb","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.182973Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:a7ce2b7a52bf2c7467bbf88b44343e42927d3c879e9aef20315a312d6d9243b0","observation_id":"72b9b007-d8e5-48dc-8b24-cc3f16851a0a","resolution":{"observed_at":"2026-08-15T23:01:54.591406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.573137Z","title":"Graph attention networks","venue":null,"work_id":"636a5600-1396-43a3-bbfd-9d3f42204a45","year":2018},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.186826Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:d1631ace6dfd331354a9003e266a56af14222dbf6d904d093e90a436735d1237","observation_id":"ef6807f9-bb0a-45da-a66f-de62c9b949d1","resolution":{"observed_at":"2026-08-15T23:01:54.577778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.558721Z","title":"Recommending related products using graph neural networks in directed graphs","venue":null,"work_id":"8855249b-2d36-47ac-9e79-9121c4642b58","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.190564Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:9f6858137edfbd03e1f8dee4b111c51514061bec33b298a96f25b17d4669c382","observation_id":"76e523ac-cf81-48e7-a95b-53b061178f82","resolution":{"observed_at":"2026-08-15T23:01:54.563374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07968","last_updated":"2025-02-11T21:24:13Z","snapshot_observed_at":"2026-08-13T21:05:03.359922Z","submitted_at":"2025-02-11T21:24:13Z","title":"Generative Risk Minimization for Out-of-Distribution Generalization on Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07968","snapshot_observed_at":"2026-08-15T23:01:54.194328Z","title":"Generative risk min- imization for out-of-distribution generalization on graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.194328Z"},"links":{"cited_paper":"/paper/2502.07968","citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:1c820fe690d836b09dfda4ba73957c96df62e39793331ae05da9265a0c1b9cb5","observation_id":"5b82349f-476b-4024-92a6-6d976d96cfe7","resolution":{"observed_at":"2026-08-15T23:01:54.194328Z","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-15T23:01:54.545983Z","title":"Graph out-of-distribution generalization via causal intervention","venue":null,"work_id":"c05496ba-e1b4-4c5e-9478-3921010d4297","year":2024},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.198645Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:498a3460836496596697d31ff3512bf709cf10a22df536bf426db1cb1797b465","observation_id":"8bcc5277-329e-4e43-b869-8998278a55bc","resolution":{"observed_at":"2026-08-15T23:01:54.550429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02466","last_updated":"2024-08-16T08:25:42Z","snapshot_observed_at":"2026-08-16T17:23:28.571307Z","submitted_at":"2022-02-05T02:31:01Z","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.02466","snapshot_observed_at":"2026-08-15T23:01:54.202541Z","title":"Handling distribution shifts on graphs: An invariance perspective","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.202541Z"},"links":{"cited_paper":"/paper/2202.02466","citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:e9b7f7e7c59eb0d9fd484a2bc4b9fa3c5f1bfe4005f8a58215cae7debca697ba","observation_id":"fdc23ecc-eb9e-4769-a0fd-3e7dc66b542b","resolution":{"observed_at":"2026-08-15T23:01:54.202541Z","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-15T23:01:54.532867Z","title":"A comprehensive survey on graph neural networks","venue":null,"work_id":"68fbf107-1fcc-489f-b00a-5c73a15816a7","year":2020},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.207043Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:37fd305ac497a0c0b22355dd6f41cf0f3db15c1d6d9e8848781a7a24d19643d1","observation_id":"c03fa9d6-2674-4429-a948-6ae672262fbb","resolution":{"observed_at":"2026-08-15T23:01:54.537233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.519583Z","title":"Learning invariant representations of graph neural networks via cluster generalization","venue":null,"work_id":"f7b75a77-857b-44d0-becf-675a9451ba8b","year":2023},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.211440Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:bf4fe25a53731d3a77690be633df6f5fc87431c348bffe2e4bf45ab545b2eee3","observation_id":"f07c3fc2-6220-45ed-822a-620e2be726f1","resolution":{"observed_at":"2026-08-15T23:01:54.524338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13532","last_updated":"2024-08-21T16:39:15Z","snapshot_observed_at":"2026-08-16T15:21:38.950005Z","submitted_at":"2023-06-23T14:52:58Z","title":"PathMLP: Smooth Path Towards High-order Homophily","version":2},"cited_work":{"arxiv_id":"2306.13532","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.13532","snapshot_observed_at":"2026-08-15T23:01:54.298533Z","title":"PathMLP: Smooth Path Towards High-order Homophily","venue":"cs.LG","work_id":"5b261e23-35fc-451f-b6f1-4c38653f4633","year":2023},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.215583Z"},"links":{"cited_paper":"/paper/2306.13532","citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:038c278391da5effac052395bc5185fe056c7198e04d43525d5db39d0605be22","observation_id":"ce57aa9e-5071-4588-8925-0ccb5a57efbc","resolution":{"observed_at":"2026-08-15T23:01:54.305816Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.219653Z","title":"How powerful are graph neural networks? 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.219653Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:bb2cf4b27f929a948f63acb0999633d744b04a116780d2acf36fc0687ef4916e","observation_id":"a21c08da-68d7-49ef-9648-eebda3b485a4","resolution":{"observed_at":"2026-08-15T23:01:54.219653Z","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-15T23:01:54.497085Z","title":"Cohen, and Ruslan Salakhutdinov","venue":null,"work_id":"d7619358-63c5-45c6-9b80-3fe86d6d248a","year":2016},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.223048Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:6b80d32d4989c41482fce86b7a4dec4503c893f1cf1dbf4beaacba6dc78177ac","observation_id":"97a4864d-08de-48e7-94a2-17fc022d9de0","resolution":{"observed_at":"2026-08-15T23:01:54.500953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.483432Z","title":"Graph attention multi-layer perceptron","venue":null,"work_id":"300208fe-b185-4368-9687-93e69a075812","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.226943Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:d07007d7fedc235eda96afeab734c521f246fa87c7a4dfdfc508fd3c96496e6b","observation_id":"ce3cda41-184f-435b-923a-5d19ca30d829","resolution":{"observed_at":"2026-08-15T23:01:54.488294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05954","last_updated":"2019-12-25T15:09:28Z","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05954","snapshot_observed_at":"2026-08-15T23:01:54.231080Z","title":"Hierarchical graph pooling with structure learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.231080Z"},"links":{"cited_paper":"/paper/1911.05954","citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:c281b88e0619e593834bdc038b4ce078c6d49f35b4842e18a26f1bb756415270","observation_id":"23e350f2-162c-4364-8b65-58fc514370c8","resolution":{"observed_at":"2026-08-15T23:01:54.231080Z","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-15T23:01:54.467134Z","title":"Ugrec: modeling directed and undirected relations for recommendation","venue":null,"work_id":"e3cb076f-3203-430c-951c-0dc0c9701f07","year":2021},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.236175Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:8b9c34d9fd5ce6d27545dfda737897aabee5b3a9c0868369291b5185f0c41d96","observation_id":"7d78ec2a-6718-403f-9e69-9cfd69193847","resolution":{"observed_at":"2026-08-15T23:01:54.472767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.453678Z","title":"Graph neural networks: Taxonomy, advances, and trends","venue":null,"work_id":"a8c44302-c432-406b-8c17-10d621335731","year":2022},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.241050Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:35dae63018ea546c60f40ff3c3968d949f46b855a6aac295e2f6d51c12003632","observation_id":"a52f53c2-a54c-479d-8812-9b56d784c879","resolution":{"observed_at":"2026-08-15T23:01:54.458549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:01:54.245215Z","title":"Shift-robust gnns: Overcoming the limitations of localized graph training data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.245215Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:0617f6938f87d6b1fc157bec39364ae13dc2ddf673b4f585e509dbcf151ea260","observation_id":"009a9b7e-6a8b-4c22-a37d-ff74af54e39d","resolution":{"observed_at":"2026-08-15T23:01:54.245215Z","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-15T23:01:54.431372Z","title":"Mario: Model agnostic recipe for improving ood generalization of graph contrastive learning","venue":null,"work_id":"d9d6a243-a8b4-49f4-bdfd-44b225702c01","year":2024},"citing_paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:01:54.249641Z"},"links":{"citing_paper":"/paper/2505.05785"},"observation_digest":"sha256:9a4f14a4d2ac6efda247441452d4c05dee3884efbe0b12bc48eae935a1516067","observation_id":"aa35a64e-e02c-4692-9dcb-0fafa2f49e9f","resolution":{"observed_at":"2026-08-15T23:01:54.436953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.05785","last_updated":"2025-05-09T04:58:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T11:20:38.448849Z","submitted_at":"2025-05-09T04:58:48Z","title":"Rethinking Graph Out-Of-Distribution Generalization: A Learnable Random Walk Perspective"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":40},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2505.05785."}