{"as_of":"2026-08-07T22:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d43535fc687e0de93eae509d41f0f4b47e54242b431f21fb0cfcea8a9442acf2","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:10:51.350709Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.11710/citation-record","integrity":"/paper/2507.11710/integrity","json":"/paper/2507.11710/citation-record.json","paper":"/paper/2507.11710"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:46.431037Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.431037Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:e8485d8b1b4275a555e83e83b0dda248595d986ed3f5e4e6427659c50e9a84a3","observation_id":"657cc74d-d1c0-4882-8c6f-f3c3ac734c22","resolution":{"observed_at":"2026-08-06T17:10:46.431037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:46.487036Z","title":"The link prediction problem for social networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.487036Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:f55abb824adf0cb36bf6f31e057e7bf80bc68d12b2519aacb46160b2178f78cb","observation_id":"01c7a941-1eef-4677-927d-5a8f56c73028","resolution":{"observed_at":"2026-08-06T17:10:46.487036Z","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-06T17:10:58.842693Z","title":"Evaluating graph neural networks for link prediction: Current pitfalls and new benchmarking","venue":null,"work_id":"9f70acbe-5bca-4072-89c4-0e5de8d78db7","year":2024},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.582367Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:5e28dea44ae43a77c4e92af665f577111a4fbe6a21d79e78b59fcebe03afce37","observation_id":"91120f4f-a0cc-46f8-b515-259a114f0a34","resolution":{"observed_at":"2026-08-06T17:10:58.936254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-06T06:17:37.090691Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-06T17:10:46.665665Z","title":"Variational graph auto-encoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.665665Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:9373f172641f4f80f1c9c019a03b53aeede0cec62ea5ca7808e4262bbebef3b0","observation_id":"da12c437-597e-4f7e-8df7-ecc300213cb7","resolution":{"observed_at":"2026-08-06T17:10:46.665665Z","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-06T17:10:58.627158Z","title":"Neural common neighbor with completion for link prediction","venue":null,"work_id":"9e7daf71-c3e7-4567-890b-256a877a95ea","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.742271Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:ff028435acf73f5cda27d29759a0b5107a4e05e8578b0d5194207c4fa92de2f4","observation_id":"5a61efc8-78b0-43ac-9fb1-8d4b40ab9e38","resolution":{"observed_at":"2026-08-06T17:10:58.741367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:58.406515Z","title":"Neo-gnns: Neighborhood overlap-aware graph neural networks for link prediction","venue":null,"work_id":"ebcb1f3b-10d3-4e29-8446-aa74f880868f","year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.823314Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:4df13913723ec60c0f0a17816f574d5e2f27ae372a4d0272060336eb6ede42cb","observation_id":"ad14b1ab-a0ae-46ea-a7eb-ea6670552baf","resolution":{"observed_at":"2026-08-06T17:10:58.489095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:58.192445Z","title":"Lpformer: an adaptive graph transformer for link prediction","venue":null,"work_id":"dd87caa4-f7e7-4871-9bed-5780ab54dd9f","year":2024},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.888812Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:f5836cfd1aec607e75e29ecd0b2971a576b12efe8b1ab06bb39d640b2a91d990","observation_id":"b9a83937-53b3-4aa0-9158-c3a648e39acb","resolution":{"observed_at":"2026-08-06T17:10:58.270317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:46.971722Z","title":"Good: A graph out-of-distribution benchmark","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:46.971722Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:c9460b0a65bb7d9e96c1ac2f5b0b7ff39eac917893cf0daf4b6abb3426d2a766","observation_id":"0af5290c-ccca-4321-8a13-17efe8fe187e","resolution":{"observed_at":"2026-08-06T17:10:46.971722Z","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-06T17:10:57.988857Z","title":"Ood-gnn: Out-of-distribution generalized graph neural network","venue":null,"work_id":"1fcf7b07-20a1-4d74-8813-e099c1d649dc","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.045710Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:a62307910b1da53dedb5cc304020c88d45ccfc469ea8b387e18f9aa16029fb6c","observation_id":"d6ddd7ae-4c58-42bc-a407-f0ab65f313ce","resolution":{"observed_at":"2026-08-06T17:10:58.091201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:57.690219Z","title":"Alleviating structural distribution shift in graph anomaly detection","venue":null,"work_id":"d6abff3e-7a13-4360-b662-0de0f03bfe70","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.163453Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:be4d6be5e3f72e90a4731833cb82f5c54f27f73184a5db1719cbfbf1de94cddb","observation_id":"364363b3-4957-44a9-bd9c-21983b6d37ef","resolution":{"observed_at":"2026-08-06T17:10:57.847592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.09637","last_updated":"2022-01-24T12:32:48Z","snapshot_observed_at":"2026-07-06T12:30:38.345126Z","submitted_at":"2022-01-24T12:32:48Z","title":"DrugOOD: Out-of-Distribution (OOD) Dataset Curator and Benchmark for AI-aided Drug Discovery -- A Focus on Affinity Prediction Problems with Noise Annotations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.09637","snapshot_observed_at":"2026-08-06T17:10:47.259414Z","title":"Drugood: Out-of-distribution (ood) dataset curator and benchmark for ai-aided drug discovery–a focus on affinity prediction problems with noise annotations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.259414Z"},"links":{"cited_paper":"/paper/2201.09637","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:d50746e4fa18539ae79fbd345e78bcf196482214560d1c52792328f03b370993","observation_id":"d5b8ac85-db2d-4b10-ba1b-b40dbd9e8357","resolution":{"observed_at":"2026-08-06T17:10:47.259414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:47.367139Z","title":"Wilds: A benchmark of in-the-wild distribution shifts","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.367139Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:c817d10b391cf95702e9dc729557ec0e317e7757c68216d54ca14c5acb6fd66a","observation_id":"3a1891e1-62af-44f1-96f2-631e6c7db228","resolution":{"observed_at":"2026-08-06T17:10:47.367139Z","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-06T17:10:57.486969Z","title":"Ood link prediction generalization capabilities of message-passing gnns in larger test graphs.Advances in Neural Information Processing Systems, 35:20257– 20272, 2022","venue":null,"work_id":"eb86825c-7e08-4713-92fb-57441035749f","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.454453Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:a63ca4ed4c177a326157b1cdfd340464b95a04910055c5d0c2ec559670d1efe7","observation_id":"e2fa89fd-8d01-4f23-86d1-3d0a631c5021","resolution":{"observed_at":"2026-08-06T17:10:57.593580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:57.201799Z","title":"Size-invariant graph representations for graph classification extrapolations","venue":null,"work_id":"f285cc0b-6d0d-4b26-8d46-5256b81bab59","year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.531898Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:780dcbab42c4c997dca285966c3d8ab9cebcabd12c83a62185c1dec4a8299137","observation_id":"7d086b96-7639-4813-99b6-87197ee57c70","resolution":{"observed_at":"2026-08-06T17:10:57.336717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08788","last_updated":"2025-07-16T16:14:48Z","snapshot_observed_at":"2026-07-06T18:30:02.349638Z","submitted_at":"2024-06-13T03:47:12Z","title":"Towards Understanding Link Predictor Generalizability Under Distribution Shifts","version":3},"cited_work":{"arxiv_id":"2406.08788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.08788","snapshot_observed_at":"2026-08-06T17:10:51.749673Z","title":"Towards Understanding Link Predictor Generalizability Under Distribution Shifts","venue":"cs.LG","work_id":"93c76fe1-553e-464e-928e-7df37e8f8b32","year":2024},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.600474Z"},"links":{"cited_paper":"/paper/2406.08788","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:5c1676d8f372e5c6b62a59461950d4e2f657376e63fdedc290718d33e0e2a111","observation_id":"2ebcce6c-504f-44a3-ad37-945b6ffa9837","resolution":{"observed_at":"2026-08-06T17:10:51.817212Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02893","last_updated":"2020-03-27T19:07:58Z","snapshot_observed_at":"2026-07-06T08:05:24.076802Z","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-06T17:10:47.675382Z","title":"Invariant risk minimization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.675382Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:dba03b9461c755335de1b750cf31757552da820a9af567a376525aba3c75c3de","observation_id":"52546bb0-dcf4-48a5-96c8-d85d6eb86aa5","resolution":{"observed_at":"2026-08-06T17:10:47.675382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:47.760400Z","title":"Out-of-distribution generalization via risk extrapolation (rex)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.760400Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:200c904cc27a71226a6c2d004460a59d84399a665932727264a9ca691ab8ce2f","observation_id":"b0b9815f-f18b-43d4-8096-e64fa06013a9","resolution":{"observed_at":"2026-08-06T17:10:47.760400Z","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-06T17:10:56.940438Z","title":"Graph out-of-distribution generalization via causal intervention","venue":null,"work_id":"21cc0fdb-cc77-47c2-91d0-71a73e70f4a4","year":2024},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.839656Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:ac7c1411a31726e0a2e346f68b4e78d7caff5d2a4143c0374c1cb97ffc1e2c56","observation_id":"c02a1de4-838e-4282-b199-9fa50b921f22","resolution":{"observed_at":"2026-08-06T17:10:57.031159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10726","last_updated":"2021-03-18T17:58:01Z","snapshot_observed_at":"2026-07-06T09:30:32.320227Z","submitted_at":"2020-06-18T17:55:28Z","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10726","snapshot_observed_at":"2026-08-06T17:10:47.949723Z","title":"Tent: Fully test-time adaptation by entropy minimization","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:47.949723Z"},"links":{"cited_paper":"/paper/2006.10726","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:45c8ba5f6afcbdd618e5087782e8999d6bee90c43a945482dea25a36e16f1644","observation_id":"922c1d73-8c7f-4fea-b3c4-49437a39dc79","resolution":{"observed_at":"2026-08-06T17:10:47.949723Z","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-06T17:10:56.719021Z","title":"Feed two birds with one scone: Exploiting wild data for both out-of-distribution generalization and detection","venue":null,"work_id":"1999796d-82d0-409c-aed9-2ef36560484f","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.031096Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:7634a20e786310758326d4476b4c97259d925ef72650aa048fc8a9a6c8c4a471","observation_id":"f2588709-0dcd-4b53-8458-4f8959a1bb7f","resolution":{"observed_at":"2026-08-06T17:10:56.781719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:56.556455Z","title":"Meta ood learning for continuously adaptive ood detection","venue":null,"work_id":"5c5c1da5-fd8d-40bf-8990-87dcd4175eaf","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.107317Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:b3dd4b3e6d8397a33c81ffca2c9249efeb8cabff7a02c80e58783b07a749faf0","observation_id":"a721b10b-2165-4577-869c-233f1a0d6435","resolution":{"observed_at":"2026-08-06T17:10:56.668942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.02914","last_updated":"2023-03-09T06:24:02Z","snapshot_observed_at":"2026-07-06T14:48:52.138798Z","submitted_at":"2023-02-06T16:38:43Z","title":"Energy-based Out-of-Distribution Detection for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.02914","snapshot_observed_at":"2026-08-06T17:10:48.185136Z","title":"Energy-based out-of-distribution detection for graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.185136Z"},"links":{"cited_paper":"/paper/2302.02914","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:528c9edecd2bda2a7e43d7a3f74a75b578ec9590ada996ec2e4900c7bab4d395","observation_id":"421ac729-8491-4239-b8c6-ecf1a4acd83d","resolution":{"observed_at":"2026-08-06T17:10:48.185136Z","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-06T17:10:56.363325Z","title":"Counterfactual reason- ing for out-of-distribution multimodal sentiment analysis","venue":null,"work_id":"3078f241-1017-4267-ba03-abbc9e987750","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.261898Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:f5f0de133101fe65314f7b995d5fa887a3d08234b47a377736eeaf408d2ce2dc","observation_id":"7da4fbd6-6b6b-467c-885c-86e0fa89459b","resolution":{"observed_at":"2026-08-06T17:10:56.452099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:56.156180Z","title":"Clear: Generative counter- factual explanations on graphs","venue":null,"work_id":"3621cac4-5edc-4f64-8767-ccf229779e9b","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.345712Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:ac13e6125cf7269d8f98fbe97045aac69016e68b8551d0782aee82c911f70156","observation_id":"94d66fd3-09e1-46a8-8d7b-d7c2313d71cd","resolution":{"observed_at":"2026-08-06T17:10:56.251925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:56.002505Z","title":"Learning from counterfactual links for link prediction","venue":null,"work_id":"97bbd211-53b1-428f-86f0-cddd1b6d3ff8","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.454644Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:a9549b64247f39d9c755fd92311099cddcd1113074f1c7bdb80cf64cdc4a5b0f","observation_id":"800cf6b2-c54f-45a6-a9c8-ef7b6bf26e22","resolution":{"observed_at":"2026-08-06T17:10:56.064440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:55.814188Z","title":"Labeling trick: A theory of using graph neural networks for multi-node representation learning","venue":null,"work_id":"4f193aac-cf6f-49bf-8d5b-cc0b637566bf","year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.518189Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:adbffe40a26707803cfc93f17d37ca8256da631412cabfc2663a0e95d852cb6f","observation_id":"58c22d9d-8047-4e39-bfea-6ca948df8a47","resolution":{"observed_at":"2026-08-06T17:10:55.894217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:55.606671Z","title":"On the equivalence between positional node embeddings and structural graph representations","venue":null,"work_id":"870c8016-8cd0-4d99-a8b3-f7ba2c82a922","year":2019},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.578545Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:4af5973e01faf4bf0720b7ff2e7160fbf7ecdd29cd96f7993e186b4d3d0da458","observation_id":"3d9ba654-ff0f-49a6-9b7e-210f266878df","resolution":{"observed_at":"2026-08-06T17:10:55.670866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:48.629912Z","title":"Link prediction based on graph neural networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.629912Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:f3e74ccb316e2a865d1a247da1f9c52acfb0a0b7b7435f88ee2f1e1279845d75","observation_id":"45779a5f-b7ba-4609-a4a8-938f9763cf72","resolution":{"observed_at":"2026-08-06T17:10:48.629912Z","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-06T17:10:55.432025Z","title":"Neural bellman-ford networks: A general graph neural network framework for link prediction","venue":null,"work_id":"484be19b-5efc-44b8-9407-6255ba345be3","year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.691688Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:7f5ac21b0583ccf83129a872a5cac570578bccc2b6a1ee25fbd23b9054619829","observation_id":"2a19c5e1-7297-47e2-bd15-e9b24dcc9416","resolution":{"observed_at":"2026-08-06T17:10:55.499203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.15486","last_updated":"2023-05-02T14:46:04Z","snapshot_observed_at":"2026-08-03T17:56:43.964388Z","submitted_at":"2022-09-30T14:20:07Z","title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.15486","snapshot_observed_at":"2026-08-06T17:10:48.757654Z","title":"Graph neural networks for link prediction with subgraph sketching","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.757654Z"},"links":{"cited_paper":"/paper/2209.15486","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:1d0e30dbf70d7b3220a9b1f56c19d327c634731c923c3ce02b47fee6bd0f9499","observation_id":"89638f6b-7e59-441a-a823-295d81b01456","resolution":{"observed_at":"2026-08-06T17:10:48.757654Z","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-06T17:10:55.230171Z","title":"Demystifying structural disparity in graph neural networks: Can one size fit all? Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"c00945d8-1012-4941-a3e9-37f1042f4f7e","year":2024},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.807686Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:4fc6baec78a5f03bad4659711534f31eec29fe40a640155e12414852da9bd917","observation_id":"615b84c2-b016-4f5a-85d6-cf86ae5d11a8","resolution":{"observed_at":"2026-08-06T17:10:55.342156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:55.045556Z","title":"Graphrnn: Generating realistic graphs with deep auto-regressive models","venue":null,"work_id":"e813db7b-2d72-4f76-a28d-20b84a9c0188","year":2018},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.863572Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:c4b9329ae83db5553c486f989d171072e3f450d54d540d45c6ab48f1a18ccc16","observation_id":"27edfeaf-07d9-4664-81d7-23dbcc7e7487","resolution":{"observed_at":"2026-08-06T17:10:55.142102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14734","last_updated":"2023-05-23T10:32:08Z","snapshot_observed_at":"2026-08-07T15:14:14.495714Z","submitted_at":"2022-09-29T12:55:03Z","title":"DiGress: Discrete Denoising diffusion for graph generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.14734","snapshot_observed_at":"2026-08-06T17:10:48.918797Z","title":"Digress: Discrete denoising diffusion for graph generation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.918797Z"},"links":{"cited_paper":"/paper/2209.14734","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:e02b42dfcfdbdc3e58814b00ffce32c4b77d37f63f8a295832c71c8b13db9431","observation_id":"65d62021-ff28-4eb6-8a58-e0321ca392fe","resolution":{"observed_at":"2026-08-06T17:10:48.918797Z","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-06T17:10:54.842571Z","title":"Graphdf: A discrete flow model for molecular graph generation","venue":null,"work_id":"2f131985-4a6e-4c87-94ea-1f7821805cd8","year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:48.973002Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:8e37c5179ef4e54d98a60628757c60cfcc40ebe70c5973b96d74207b6b86af7c","observation_id":"cd50664d-4d2a-495e-b624-1607adb80568","resolution":{"observed_at":"2026-08-06T17:10:54.948921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:54.674569Z","title":"Spectre: Spectral conditioning helps to overcome the expressivity limits of one-shot graph generators","venue":null,"work_id":"7b34a849-f115-439c-b976-73c072cac561","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.040999Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:83932e36698da6f2df03f401937aa2a5965e584e310f242a60760922068a0586","observation_id":"8ffefdea-d89b-4b67-b51f-e0257050629a","resolution":{"observed_at":"2026-08-06T17:10:54.759150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:54.486770Z","title":"Autore- gressive diffusion model for graph generation","venue":null,"work_id":"21a032e1-d9cf-4392-8e8e-9947570cbc31","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.090036Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:465c3c4bcae1dc313751f72e4acb74f918c85f5ad89a40fb222100c920a68f8c","observation_id":"aaf8c79d-2560-47b6-ac93-f954486dad31","resolution":{"observed_at":"2026-08-06T17:10:54.567275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:54.252320Z","title":"Deep coral: Correlation alignment for deep domain adaptation","venue":null,"work_id":"0e909fe8-d6b3-41c9-bb4f-19c1b6ee9b84","year":2016},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.141693Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:6caaeda412d77e0da7d6b84540f8915162843942f275a76b485ac732df341229","observation_id":"5171cbea-a3fc-4f92-b5ed-aff3ff156cd6","resolution":{"observed_at":"2026-08-06T17:10:54.395433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08731","last_updated":"2020-04-02T05:40:29Z","snapshot_observed_at":"2026-08-02T19:28:48.954133Z","submitted_at":"2019-11-20T06:43:41Z","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08731","snapshot_observed_at":"2026-08-06T17:10:49.192788Z","title":"Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization.arXiv preprint arXiv:1911.08731, 2019","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.192788Z"},"links":{"cited_paper":"/paper/1911.08731","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:ecba880005a7e8ecdf4e54ae914adf5bcfd7cb08c17c8d2b7e0a5cf667b43334","observation_id":"76ef5ed6-8918-4c00-9acf-412c3a92e5dc","resolution":{"observed_at":"2026-08-06T17:10:49.192788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:49.263327Z","title":"Domain-adversarial training of neural networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.263327Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:30aecda57ce79534673bd4a5a84159927eeeda1d20a1e2158341f9dd6b524f47","observation_id":"3b40de10-3360-46d8-a8cb-fbf8a2957d12","resolution":{"observed_at":"2026-08-06T17:10:49.263327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.01434","last_updated":"2020-07-02T23:08:07Z","snapshot_observed_at":"2026-08-07T18:31:23.290877Z","submitted_at":"2020-07-02T23:08:07Z","title":"In Search of Lost Domain Generalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.01434","snapshot_observed_at":"2026-08-06T17:10:49.315605Z","title":"In search of lost domain generalization","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.315605Z"},"links":{"cited_paper":"/paper/2007.01434","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:277fd0f7dae238e35b0d8e03a8ab802c91f644683ea31bbdbeb6fe2b9e237e33","observation_id":"769078c1-4f0a-4c73-b4e9-4f06648e3fa9","resolution":{"observed_at":"2026-08-06T17:10:49.315605Z","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-06T17:10:54.076757Z","title":"Learning invariant graph representations for out-of-distribution generalization","venue":null,"work_id":"a6a205ed-b74f-4035-80ae-fc0c70c94220","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.364875Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:8a013a6bc4e8eaef6586e05d314c8424e0f0033bc0bd499de5eebf3a28f6514d","observation_id":"caea5441-283c-46f4-ba3c-8cc4f40ee140","resolution":{"observed_at":"2026-08-06T17:10:54.154920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:53.920783Z","title":"Does invariant graph learning via environment augmentation learn invariance? Advances in Neural Information Processing Systems, 36:71486–71519, 2023","venue":null,"work_id":"f78fd423-c2e6-4624-af73-8f9313918d0d","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.420697Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:2e5a44d00e75ab257d4446f1ee93c815d271bb126422636b13d523e8cdab8448","observation_id":"d57d3808-ad8a-46e2-ba54-07711484b0fe","resolution":{"observed_at":"2026-08-06T17:10:53.995779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:53.708088Z","title":"Dynamic graph neural networks under spatio-temporal distribution shift","venue":null,"work_id":"814fa90a-67da-4932-a791-ca8827fa3a78","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.548692Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:f7cfdab0ad8fb4604fde9ce7535fb3d51775bf8dbed1f718777f9ee6a52c8c89","observation_id":"3b71f14d-6939-44d2-bf67-f0bda36bec8a","resolution":{"observed_at":"2026-08-06T17:10:53.788582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:53.522237Z","title":"Handling distribution shifts on graphs: An invariance perspective","venue":null,"work_id":"e3a9efce-2a0d-4e91-a513-932f72c23eb2","year":2022},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.652605Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:62d395edd14cd7a95d77a990e3a7c58e2191bf08b2ee3f4eb829507701bfbedd","observation_id":"61638a94-4fd5-42e4-842f-3282b005df14","resolution":{"observed_at":"2026-08-06T17:10:53.586274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05780","last_updated":"2025-04-10T11:41:23Z","snapshot_observed_at":"2026-07-06T20:33:29.458482Z","submitted_at":"2025-02-09T05:19:53Z","title":"GOLD: Graph Out-of-Distribution Detection via Implicit Adversarial Latent Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05780","snapshot_observed_at":"2026-08-06T17:10:49.778493Z","title":"Gold: Graph out-of-distribution detection via implicit adversarial latent generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.778493Z"},"links":{"cited_paper":"/paper/2502.05780","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:750ff5fe6142ac47ed0d8a2d750643c31d2aeaa7e321fcf3ad24241969447be6","observation_id":"8d0db294-f7e7-4f58-9316-61eb870a18e0","resolution":{"observed_at":"2026-08-06T17:10:49.778493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:49.899473Z","title":"Fast unfolding of communities in large networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.899473Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:84f86be0a12bd7da1361ebd7941df1750ca4dfcaab027d0faf729cc199524b81","observation_id":"9d497fc0-79f1-4966-b36c-887c751b802b","resolution":{"observed_at":"2026-08-06T17:10:49.899473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.15810","last_updated":"2021-06-30T04:59:19Z","snapshot_observed_at":"2026-07-06T11:24:26.208168Z","submitted_at":"2021-06-30T04:59:19Z","title":"Edge Proposal Sets for Link Prediction","version":1},"cited_work":{"arxiv_id":"2106.15810","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.15810","snapshot_observed_at":"2026-08-06T17:10:51.499151Z","title":"Edge Proposal Sets for Link Prediction","venue":"cs.SI","work_id":"70a8ab15-d3d7-459a-af61-25c6bda4453f","year":2021},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:49.980026Z"},"links":{"cited_paper":"/paper/2106.15810","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:b030a243fa572dfda227b54d6bab615095645ff89de70d76c4b3fd295977e01a","observation_id":"7cf4ea8f-b63a-4da3-9b9d-971801f9c131","resolution":{"observed_at":"2026-08-06T17:10:51.568646Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:50.093114Z","title":"Generative adversarial networks.Communications of the ACM, 63(11):139– 144, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.093114Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:fb33031250e57a2956e56a7a91aa5c3239ca28c2731e333f0c160440699e5ed1","observation_id":"99edbd36-66ab-4923-bb79-7d865604bcc0","resolution":{"observed_at":"2026-08-06T17:10:50.093114Z","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-06T17:10:53.345118Z","title":"Conditional structure generation through graph variational generative adversarial nets","venue":null,"work_id":"920e0611-b83d-4796-93fe-bdb26f7abdd1","year":2019},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.203010Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:ad8cde74d101fa008504a20bcbf9c532e00d960d2d2a386f184717311be33a06","observation_id":"109cfd6e-5d63-4763-9504-a3711bd7e15e","resolution":{"observed_at":"2026-08-06T17:10:53.435085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:50.310950Z","title":"Clustering and preferential attachment in growing networks","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.310950Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:ee146958908aa6711f8588ee99ed51122fb5db9f55a6e2403b3106f6f252b615","observation_id":"5a082ea5-9842-4c22-9ec5-74e86e1ba3cc","resolution":{"observed_at":"2026-08-06T17:10:50.310950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:50.457544Z","title":"A new status index derived from sociometric analysis","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.457544Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:bab7b1400cbcb2bfb60b18dc13242938f39139e851c91f8294b27d23d5b46dcb","observation_id":"203aa282-bf7f-4b96-893e-e707132a0eb0","resolution":{"observed_at":"2026-08-06T17:10:50.457544Z","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-06T17:10:53.088416Z","title":"Graphvae: Towards generation of small graphs using variational autoencoders","venue":null,"work_id":"bb33cdfc-b5e1-4e88-9a28-af44267c4987","year":2018},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.562239Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:7f71bd1e5343c0ea23a177d5183e99b53d408e864b5f3e57715e41d09976a707","observation_id":"ce68ef62-2509-4f85-b4fa-9af5e3a534a0","resolution":{"observed_at":"2026-08-06T17:10:53.205616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:52.868607Z","title":"Swingnn: Rethinking permutation invariance in diffusion models for graph generation","venue":null,"work_id":"10333ca1-eedd-4170-9cfa-e84148dc442f","year":2024},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.665059Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:9e8beb669b871f4d2d5ec554711dada12429e36b6206812d1c27094fde937ec7","observation_id":"c61bb0be-4b1f-4787-ae40-ad6e923bab21","resolution":{"observed_at":"2026-08-06T17:10:52.964629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:52.702220Z","title":"Semi-implicit variational inference","venue":null,"work_id":"c3b4cc10-bc3e-4e7b-8871-c91ba753c0d7","year":2018},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.761818Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:cde3277d05490ae245e5b55e7c8b03d35aa472a2929eea8b958ae6fbcfb3fd03","observation_id":"6691d052-624d-46e2-9b00-05b64e7a1fe4","resolution":{"observed_at":"2026-08-06T17:10:52.792327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:52.519468Z","title":"Semi-implicit graph variational auto-encoders","venue":null,"work_id":"3e744354-6eca-4910-ad19-96d90f7eb294","year":2019},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:50.876513Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:5ddaf2db3a3ed157cee7f8bb5146496a1a1632f8d80a22ec76b1abb89246d7bd","observation_id":"06487935-7732-4f55-b5b8-448ec85889d9","resolution":{"observed_at":"2026-08-06T17:10:52.606112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:52.350555Z","title":"Investigating and mitigating degree-related biases in graph convoltuional networks","venue":null,"work_id":"9966dccf-5488-4e4c-bf0e-1f870e904f57","year":2020},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:51.004048Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:5d64c6174d2715fdf807ef40ca79bc60f5f23caec93c6d0629fb8029bb76eba5","observation_id":"3ed88923-c7b3-4627-a4cb-308dcf4a172c","resolution":{"observed_at":"2026-08-06T17:10:52.430676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:10:52.240824Z","title":"On generalized degree fairness in graph neural networks","venue":null,"work_id":"26f305ce-ebb3-491a-97fb-a45c4f571187","year":2023},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:51.087067Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:162b5be0c08312c33c66d05c3af8e10dd0bae1e7e97e9144bea9216462e63dd8","observation_id":"f640a61b-ad9c-4e7b-bbc6-9b309fff8d4b","resolution":{"observed_at":"2026-08-06T17:10:52.287231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04407","last_updated":"2019-01-08T00:26:13Z","snapshot_observed_at":"2026-07-06T06:23:05.095698Z","submitted_at":"2018-02-13T00:29:11Z","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04407","snapshot_observed_at":"2026-08-06T17:10:51.183782Z","title":"Adversarially regularized graph autoencoder for graph embedding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:51.183782Z"},"links":{"cited_paper":"/paper/1802.04407","citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:d790d8afc579c4a7087f07d52f87067c05d9902372ea3ca383063b396eb778af","observation_id":"2f68705e-7732-4f08-a40e-7255c70a3f44","resolution":{"observed_at":"2026-08-06T17:10:51.183782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:10:51.258968Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:51.258968Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:4c66810fe7a3d0d800f88aace43f723485413eb3779e15e4ec35262aaf3471ab","observation_id":"c345a35b-aaf3-436b-899c-51c6ff1b8099","resolution":{"observed_at":"2026-08-06T17:10:51.258968Z","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-06T17:10:51.923714Z","title":"directions","venue":null,"work_id":"7cbfe4f8-4acb-456e-a87a-a6bdd5852c87","year":2003},"citing_paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T17:10:51.350709Z"},"links":{"citing_paper":"/paper/2507.11710"},"observation_digest":"sha256:0498b4f41f11db0a6f8d64516fd556b837ecfd0eb54858e8074067dd1a95e6ac","observation_id":"78adaa83-0df7-4f04-a40f-4de0e99a6097","resolution":{"observed_at":"2026-08-06T17:10:52.021035Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.11710","last_updated":"2025-07-15T20:30:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:04:26.260784Z","submitted_at":"2025-07-15T20:30:16Z","title":"Subgraph Generation for Generalizing on Out-of-Distribution Links"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":2,"verified_fuzzy":34},"total_outbound_references":60},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2507.11710."}