{"as_of":"2026-08-14T16:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:918e76857b81c161db8fddd1942beea22d23f77004c748424b111c8f1e164a52","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-14T06:32:32.682623+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-13T22:23:45.536624Z","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:b313703c9545b452170bc450f48cad16b56628ee4df6af92ab5629107d23f26c","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-13T22:23:45.536624Z","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:d5493b6637f3c6cd152078cbc721595ece84809da67436c3860b4b97e4fa8e72","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-13T22:23:45.536624Z","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:229900cc39081b49ade9b4b8893568ff358f97bb50ffb16b736ba27efd199aac","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:04:05.764870Z","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-13T22:23:45.536624Z","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:e8f85f692baf1c5f04d5e8e16539f215d9289abe8ec769a158c653e87a649da5","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-13T22:23:45.536624Z","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:850e16dce997fbac71cf509d59a1c482bd3be112376e4347ef3fc3657427b989","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:d65c92c03b2321ed502fc6f51273857188e7300e7d9b317fd6dbd2d21ef92976","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:b8885a7d37c4bd9de3831b522f47dee9451086f6e6837e874512dd8b6608c403","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:2091f0f8215c4cac266239574637a3df29f6a149295b43ba23bebdf7166ad1c3","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-13T22:23:45.536624Z","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:cd531d0c818779c6648bbdea87ec4d3522baf066f470cb385c67662dd13e9d9e","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:625148174a60649df0357b9efe7cb8185f039bf8e88bf43358be7c309b1b60a4","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-13T16:54:15.611794Z","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-13T22:23:45.536624Z","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:7d86d6349b1580b2c4731c5c6d970594aec67e405eab651555c5faad03c736ab","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-13T22:23:45.536624Z","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:71828f7722db9110a71bda1bcbc70902b35412f1f0008982bd939870605f07c4","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-13T22:23:45.536624Z","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:129232fad9155949a918a8fc72f7d89414ce4fb487158b587dacbd3c280b771b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:a29eec2ce3d2c912a5727d9c1895db60ad0eca0c81845ce547ad6e736e7501eb","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-12T23:43:59.046125Z","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-13T22:23:45.536624Z","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:c084bf77b6e9be5b0a25177460d90239c605982187f790c368deeb95545baf09","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:c5db4f6e87936d41ebfa16db07e95fde5fc972802c85fb505174edb739305f08","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-13T22:23:45.536624Z","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:4d20f1709746f2107cf459fdef644d2884dbb479813e2e6a48d4a271d92d244a","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-13T22:23:45.536624Z","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:bf5ec48f0f974c4f5597c7f19838453ff0bce66b0019228e955efb52bde71358","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T09:05:55.324880Z","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-13T22:23:45.536624Z","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:4e15d286e7693705b99b8240b9645b494f638fe775c9f8dbd88c0b2bdc811b99","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-13T22:23:45.536624Z","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:5f972bc4d65a0944cfb8b975c9058b76aa801f6eacac65a4a48af96511bd9e83","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:2b1a8b15ec763b3059a7334ee948ccacd4d65b750b3027c4e30f9862cb7af0ce","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-13T12:50:04.628459Z","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-13T22:23:45.536624Z","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:dde30e18017056f6dd4bdee8eb0b85264e65697e9d9888e2be90b681e1a85810","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-13T22:23:45.536624Z","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:9377053d1ba1a118e6100d6700bc8b232f6570548be87b3dda3c4335f0181017","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:a4177cdd7e769b0184a92700bd17b96d4d8299e892d6b6b6be312d79100bb17e","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:62736bc33e90e672098ff1461a96947a387d699df6427fa8fd58c97f105260de","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:211066189717c6fab3120a50136c4bf9d07289a78613d6acb0f8196300c98c24","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:f025eb2f1abd8fb0cc8b37bb29c2f6b6f8c01d21dc265c0fdfb0f6e60bc0b03e","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:882f48ff3d65143e260a94440bf360d390a676b517252057bb95a2dc95e43823","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-13T22:23:45.536624Z","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:0837a8cab84287caf5d2163fd9b7c28a946fe0661af8ca05a19152bd615d298b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T14:15:25.826246Z","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-13T22:23:45.536624Z","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:4253353a35a106a414dc31aa26f01689b26e09bb83ff00f6565315293b47ecf8","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-13T22:23:45.536624Z","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:f0575f5ca93ca8f13870578160f865a14c0ea25b3dc7cddbc53231b9df71e9d9","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:c3b3013d30c037b942f93f001fafaa66ddfff8fa44db14ada81b2443fe683971","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T14:17:01.634903Z","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-13T22:23:45.536624Z","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:fedc379e8b5f0ad5f8e3ecfc5d2a2e3a60a28c37613da8bf575b2ee40e17920d","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-13T22:23:45.536624Z","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:f04886cdb3c39e8f292036fa51964b5d6a74dbbcd79fe7a8b03fa27eabfe6a09","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:ccfa79fdef80c0e922459d1a8793fa566aa162ff15e97d706872c58bf14eba5d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:6e6785cc41f707946913b85674b13c66cee650ab0c795b3ce7cd69f2f36dea5b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:df32e52184aa00d07577810231336d546f4878ec2b81cf029f0a0e536c4831b6","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T08:06:00.989531Z","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-13T22:23:45.536624Z","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:a685108c8994450a898e4c67e9d1b5b1d802b372e18104370033349065a36ec5","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-13T22:23:45.536624Z","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:a65a289316507a683e8bd60b1a9a0c4416a2feb1654b600a27a228394047a817","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-13T22:23:45.536624Z","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:9d455cc2a02be1d6307d747c1b127b6ac9b4b7f931fd239049a7fedcaf1835e2","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-13T22:23:45.536624Z","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:8e9afdcd1d81860705c3d4e89234f3e6bb5fdada8c0347b886537b0baa703d8e","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:8ec1d1cf7d768f32d8731438cc4e4539fc2123ba094565c2093de25d4da3ec1c","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:a7047cce927cc8fd136de286a743de8ab63d0f0c69a4567c50974a316dc9069b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:ccf599563764c5f4912a090101b26d6f0b28eddfc9a4a6a6544b87a9d1ad9565","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-10T00:20:15.328424Z","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-13T22:23:45.536624Z","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:92cf587a66ed03779c62951cedc33b453a735598820e3e9b2bc73db78649831a","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-13T22:23:45.536624Z","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:f564a90095e5f2303296b30393a0cd30b9a9cae15ed55b1acd495d35469029f6","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-13T22:23:45.536624Z","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:0f9bcb575f4506f9b8d2d8bd772bef7bb9d02ee10adc9a94a94aeca06a9613b0","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:b9d11d267348ffe936a66c1358e41019aa98b3ed7ef70d764501f5707b3d3d00","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-13T22:23:45.536624Z","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:260de2cc72ae55f15bdd9ddaa06e6dc1ca8e289f8bca8b0650c0a5c098319e9c","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:d206969f82323d0256910c70a6ae423c74aba90d13eb0821db6427351513638a","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-13T22:23:45.536624Z","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:e698c4433f4d556fa8ace5dd05b0353c93e099c2ca3fdece0b6905736dee8a5f","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-13T22:23:45.536624Z","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:0e66f23899fb302b99fd356000a1c2acef872581c0f917438429ed92a900530a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:4ba11b43acb272b6436a0e4e5b65d69d2078ae0e382d172c96ec310fc69d2548","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:c4ee22fca81adf5b568873cc6b128ed697e382011d24d4e5fb297b02f7e171cd","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:ec8760d4170a42970016b04e73f50f31ad748062fc97ecc4ad8dbfa18f9907ba","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:6ad6407e00c4871d977579f99e85dd1afae49c4b936dfd30eb566dd6cefc28c4","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:c310cb728de8d675f23bd32d6417d77b1dbe183c28a80012c2c3a78f5ff61c75","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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:48a7338961203aac33ed2c646ec88667af10f7078f190d13d4cc17d0fc79987d","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-13T22:23:45.536624Z","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:0a75c52c25970e03f07d9cbb7730b72be38d1be536e6bef678dc8c4a8d35fdd1","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-13T22:23:45.536624Z","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:255f0e9b3e952ba72b9c26062acae98fa59534bbee4ced0ede71eb52648ff94a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T22:23:45.536624Z","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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2507.11710."}