{"as_of":"2026-08-08T10:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d58ff89dffd7016754f05d77115e33c81dedbe2d27356a0e22424ff5ddcef6c5","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:19:32.445418Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T21:30:43.925179Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T21:31:39.372965Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"cited_work":{"arxiv_id":"2506.05957","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05957","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pruning spurious subgraphs for graph out-of-distribtuion generalization","venue":null,"work_id":"d3c3fe85-c2fe-4cc7-8834-973af6a0835f","year":2025},"citing_paper":{"arxiv_id":"2602.17071","last_updated":"2026-04-11T12:06:12Z","snapshot_observed_at":"2026-08-01T04:28:59.324747Z","submitted_at":"2026-02-19T04:26:57Z","title":"AdvSynGNN: Structure-Adaptive Graph Neural Nets via Adversarial Synthesis and Self-Corrective Propagation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-15T21:30:43.925179Z"},"links":{"cited_paper":"/paper/2506.05957","citing_paper":"/paper/2602.17071"},"observation_digest":"sha256:6ade2eab78e1fc6c7a8e288f7151f411168554085cfa28fbdbf4ecb96dfab4b8","observation_id":"025759ac-95c9-473f-8a1f-91fc955e1981","resolution":{"observed_at":"2026-05-15T21:31:39.375441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.05957/citation-record","integrity":"/paper/2506.05957/integrity","json":"/paper/2506.05957/citation-record.json","paper":"/paper/2506.05957"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:19:27.759891Z","title":"Invariance principle meets information bottleneck for out-of-distribution generalization.Advances in Neural Information Processing Systems, 34:3438–3450, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:27.759891Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:46ffd2e086476a6c160f3b720185434d616d235292dbc27f797e5f1b449b03f9","observation_id":"5ae9158d-ce6e-4276-9055-e77f6cbbf969","resolution":{"observed_at":"2026-08-07T10:19:27.759891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T10:19:27.851480Z","title":"Invariant risk minimization.arXiv preprint arXiv:1907.02893, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:27.851480Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:1c7b5510846873fd31b2de52c6fbfa8ebb54ccc55bcde8cc0d4e7b4eb7feb079","observation_id":"9bd8c6fa-d268-4d62-a675-9b2ca028cb57","resolution":{"observed_at":"2026-08-07T10:19:27.851480Z","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-07T10:19:27.914560Z","title":"The properties of known drugs","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:27.914560Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:9972bced2a643adf77ab8317ff31c6b69fcb4734b486a914bae069e24f0c8fe3","observation_id":"a1cee937-82be-417b-9445-c9cd645e3400","resolution":{"observed_at":"2026-08-07T10:19:27.914560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1308.3432","last_updated":"2013-08-15T15:19:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-08-15T15:19:34Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.3432","snapshot_observed_at":"2026-08-07T10:19:28.008937Z","title":"Estimating or propagating gradients through stochastic neurons for conditional computation.arXiv preprint arXiv:1308.3432, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.008937Z"},"links":{"cited_paper":"/paper/1308.3432","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:1cfcc63dd97cd89e9d65fb6abec71b764aa060a2a000039c02b123548ff3c118","observation_id":"b9b4e8fb-d43d-4d9f-a0e5-c4fdb2674f1c","resolution":{"observed_at":"2026-08-07T10:19:28.008937Z","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-07T10:19:38.348253Z","title":"Sizeshiftreg: a regularization method for improving size-generalization in graph neural networks.Advances in Neural Information Processing Systems, 35:31871–31885, 2022","venue":null,"work_id":"b6234d04-ba93-4fad-bdd1-89e415fbbac5","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.138405Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:fc6f149ee932f97f34bdb272dfdbef2375ff34775f7cbe7bc6a87b7bd696709b","observation_id":"aa5104c2-2f38-4f2e-80ec-767ec4262b6a","resolution":{"observed_at":"2026-08-07T10:19:38.462399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:38.069651Z","title":"Does invariant graph learning via environment augmentation learn invariance? InThirty-seventh Conference on Neural Information Processing Systems, 2023","venue":null,"work_id":"d0714d33-8a5e-4d22-804f-626fb2b356bd","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.215215Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:b6f3e414230f22ba04b5ebdbc7125735df49ed8f62939a420c5b834baf63d412","observation_id":"c8fef682-f5b3-45c9-9a4c-702c72eae67f","resolution":{"observed_at":"2026-08-07T10:19:38.168950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:37.849130Z","title":"Understanding and improving feature learning for out-of-distribution generalization.Advances in Neural Information Processing Systems, 36:68221–68275, 2023","venue":null,"work_id":"c74cf601-31fa-4283-9440-baebed66ab57","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.295790Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:5875e4759ececd1e1c6a9add8464af74f33fe206e4c8322469e80e5024073395","observation_id":"9ba89914-727c-4941-be1c-2a334aceba78","resolution":{"observed_at":"2026-08-07T10:19:37.913040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:37.668331Z","title":"Learning causally invariant representations for out-of-distribution generalization on graphs.Advances in Neural Information Processing Systems, 35:22131–22148, 2022","venue":null,"work_id":"b67e57d7-b85c-4c66-a2e1-d7fd641be19c","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.407862Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:89afe48fa05694df6f1efd71443908fc4ddd9628a984a29a868f766b77a25092","observation_id":"2254271b-2603-4f66-a94a-02ff77359a8b","resolution":{"observed_at":"2026-08-07T10:19:37.784379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:37.609989Z","title":"Environment inference for invariant learning","venue":null,"work_id":"86124adb-495e-4c46-9ba7-b336c021ffe6","year":2021},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.480682Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:a084985561e5cd1b34b2b8da880494e047b79ccfcf777ae29d4e4cca8e53e7d3","observation_id":"12dd7b86-316f-463e-8143-b5de3861b8be","resolution":{"observed_at":"2026-08-07T10:19:37.657608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:37.522708Z","title":"Debiasing graph neural networks via learning disentangled causal substructure.Advances in Neural Information Processing Systems, 35:24934–24946, 2022","venue":null,"work_id":"1899e733-9121-426b-9dfb-146867b4e36b","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.520208Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:9d44b55cca5492feaa4b3935466948bfc35858ae904ca0a765f6681fe7149418","observation_id":"8e014ad0-9bf6-4a93-b955-0c98f0553606","resolution":{"observed_at":"2026-08-07T10:19:37.561067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:28.623668Z","title":"Fast graph representation learning with pytorch geometric, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.623668Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:aac7e9dfca4a3feb766b9a0367e7837330be68224ad1424ecc3e8c24f5341bd9","observation_id":"881c8a07-d246-4f6c-8de0-47cfdcf80bed","resolution":{"observed_at":"2026-08-07T10:19:28.623668Z","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-07T10:19:28.683836Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.683836Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:a7f4fbccd12cc4e3bff7abedbf33f9496431974e768ecd1d7e67bd6b3633f987","observation_id":"8ea08b2d-c825-47f7-877f-edbcae84c7a4","resolution":{"observed_at":"2026-08-07T10:19:28.683836Z","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-07T10:19:28.722463Z","title":"GOOD: A graph out-of-distribution benchmark","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.722463Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:91a1949733c5ab094f1a29fc211b4612d9117f9fc6f7adc3d6bf637332a21442","observation_id":"699eb243-fae1-4b49-9c18-6a08d50caf2e","resolution":{"observed_at":"2026-08-07T10:19:28.722463Z","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-07T10:19:37.364986Z","title":"Joint learning of label and environ- ment causal independence for graph out-of-distribution generalization.Advances in Neural Information Processing Systems, 36, 2023","venue":null,"work_id":"381e9bc4-cc70-4b8d-93de-4d98d7aaf45f","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.766348Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:a524328a8a21328a15a332697ec496834d1cc2d4f9465a2bde11fa9d50109bba","observation_id":"e0c05fe9-5c56-455f-97f5-0fc852e11505","resolution":{"observed_at":"2026-08-07T10:19:37.430931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:37.238470Z","title":"G-mixup: Graph data augmentation for graph classification","venue":null,"work_id":"4cc55895-09ac-4919-814e-469cb2678801","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.810717Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:51f34cc3ea2a9a78a703f6746204da42c4c09c6591062cc1d40f16aff5a1253a","observation_id":"93c316b6-0348-4d7d-a949-270ad3e6698e","resolution":{"observed_at":"2026-08-07T10:19:37.284409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:37.091664Z","title":"Open graph benchmark: Datasets for machine learning on graphs.Advances in Neural Information Processing Systems, 33:22118–22133, 2020","venue":null,"work_id":"555a092e-1b89-499c-9791-25959b07d45f","year":2020},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.877584Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:5fe33b4a4346dd1985515ad3ba5698bc627a13ef92f21bcd856d97c903f04a83","observation_id":"d8adb953-8291-402b-9f71-3cda6f65dcda","resolution":{"observed_at":"2026-08-07T10:19:37.163248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.09548","last_updated":"2021-08-28T19:59:03Z","snapshot_observed_at":"2026-08-01T15:49:00.774229Z","submitted_at":"2021-02-18T18:50:31Z","title":"Therapeutics Data Commons: Machine Learning Datasets and Tasks for Drug Discovery and Development","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.09548","snapshot_observed_at":"2026-08-07T10:19:28.929456Z","title":"Therapeutics data commons: Machine learning datasets and tasks for drug discovery and development.arXiv preprint arXiv:2102.09548, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.929456Z"},"links":{"cited_paper":"/paper/2102.09548","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:7a00661c050a0f86c9d1b2cd91fe0229e2fae576c36b6ba34688b9ad0f2aec0a","observation_id":"67918fd9-1a69-44f6-b039-e8e94cd3d0c4","resolution":{"observed_at":"2026-08-07T10:19:28.929456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T10:19:28.981312Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:28.981312Z"},"links":{"cited_paper":"/paper/2201.09637","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:3d1213c84f4c5f4addc476dfdd0fe4d4cac4093ffe9d568421c03525a8c903c9","observation_id":"a15916b6-7b16-4685-9e01-1a450bc3c0b4","resolution":{"observed_at":"2026-08-07T10:19:28.981312Z","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-07T10:19:36.966775Z","title":"Graph invariant learning with subgraph co-mixup for out-of-distribution generalization","venue":null,"work_id":"1bba7a6b-5ecd-4183-87ad-955819a1f01c","year":2024},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.039759Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:97236c388a031a558d1fe324bf135c282d3038fb333f76b610468a1b2fc3a739","observation_id":"ad561732-8d08-47b6-a849-716bbd805913","resolution":{"observed_at":"2026-08-07T10:19:37.026437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.03908","last_updated":"2020-10-07T17:43:56Z","snapshot_observed_at":"2026-07-06T09:26:38.342143Z","submitted_at":"2020-06-06T16:21:51Z","title":"Enforcing Predictive Invariance across Structured Biomedical Domains","version":3},"cited_work":{"arxiv_id":"2006.03908","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.03908","snapshot_observed_at":"2026-08-07T10:19:32.692192Z","title":"Enforcing Predictive Invariance across Structured Biomedical Domains","venue":"cs.LG","work_id":"3441ced4-5d3e-46a1-bbad-2b3796d02d32","year":2020},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.118777Z"},"links":{"cited_paper":"/paper/2006.03908","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:771fa19e55d92e3c02e9d4113a02d380a176f6daf235092f0cb67660473fae4e","observation_id":"6956a8ed-a1dc-4743-b1d8-5af31cad433b","resolution":{"observed_at":"2026-08-07T10:19:32.774912Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T10:19:29.191462Z","title":"Adam: A method for stochastic optimization.arXiv preprint arXiv:1412.6980, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.191462Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:8a651a4d65ec2b947f8fac2a22fd12f0bbe23f1b402fb2dd0a39e07f8c30dfd2","observation_id":"5fe26058-8922-450a-a25a-178532b57bd2","resolution":{"observed_at":"2026-08-07T10:19:29.191462Z","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-07T10:19:29.257499Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.257499Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:c4c4e33d5f05a617cd967757fa06aa34afcccee9d7c78201ef853e7e30ee2c78","observation_id":"e52a109b-f9fa-4c67-89fa-ef66a6453ac4","resolution":{"observed_at":"2026-08-07T10:19:29.257499Z","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-07T10:19:36.823950Z","title":"Last layer re-training is sufficient for robustness to spurious correlations","venue":null,"work_id":"8039c9e4-7d82-45d5-a794-2fa17474493e","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.327014Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:a265f6dd0568f4ecec6569d81a4dc477833e9d984c7a4c698c530e6fa9c98369","observation_id":"317b3238-6065-4901-a553-e9baa5d78a04","resolution":{"observed_at":"2026-08-07T10:19:36.881133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:36.701137Z","title":"Wilds: A benchmark of in- the-wild distribution shifts","venue":null,"work_id":"cd292a4c-90f4-4e51-85c6-d3db720bdc91","year":2021},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.401960Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:678e0e7f2ac3683fa66ba7c27fd58fc42b6635ded15d96e474e1d86b718d67ce","observation_id":"4fd67809-96a7-4bb2-8582-3ab0b1244d54","resolution":{"observed_at":"2026-08-07T10:19:36.762317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:36.583942Z","title":"Robust optimization as data augmentation for large-scale graphs","venue":null,"work_id":"5871e7c2-2d3e-4d90-9305-56ac5d228df9","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.485374Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:c46ed4d0cab4b79a57fcbe0609767542df52a62d8e6de4c1c96ea7695d1ef9dd","observation_id":"79482327-acbb-40e0-bc30-1b3c22923fd8","resolution":{"observed_at":"2026-08-07T10:19:36.643597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:36.486086Z","title":"Out-of-distribution generalization via risk extrapolation (rex)","venue":null,"work_id":"867cab2b-b56d-480a-8165-2778fbf5dce4","year":2021},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.581361Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:2ff6bf186d1763e03caf52cabb1c6d8102a99dab7ccf54496fff8657296c4f4f","observation_id":"d0d5cffb-6a0d-44b2-8d04-46accd4b13f2","resolution":{"observed_at":"2026-08-07T10:19:36.533447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:29.647076Z","title":"A reduction of a graph to a canonical form and an algebra arising during this reduction.Nauchno-Technicheskaya Informatsiya, 2(9):12–16, 1968","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.647076Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:1fbf5a1d719985ca8b2a3519bbd2e90fbcdcb6ecedd8f70a14d9ca6f7bad30f8","observation_id":"296b8a57-ed0f-48dd-b745-a4f4b17a84dd","resolution":{"observed_at":"2026-08-07T10:19:29.647076Z","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-07T10:19:36.365163Z","title":"Ood-gnn: Out-of-distribution generalized graph neural network.IEEE Transactions on Knowledge and Data Engineering, 2022","venue":null,"work_id":"a463c296-4eb0-49b8-a030-3c390bacbbcc","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.689124Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:490832f148f11408acf6b13be59516bb745e4af1f13e23a27adcedccec96efe5","observation_id":"7c5a92a5-cfdf-4495-9196-e661db409fdc","resolution":{"observed_at":"2026-08-07T10:19:36.423610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:36.262543Z","title":"Learning invariant graph representations for out-of-distribution generalization","venue":null,"work_id":"9a2fd067-210e-4c5f-8d97-e67f16641d47","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.728204Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:c4dd6c3f0cd8717fe78388c1a5264219d8602ded7b0a85a4d3792034e6a344d0","observation_id":"7c8a9c06-fa01-4678-a377-2f6993976976","resolution":{"observed_at":"2026-08-07T10:19:36.311279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:36.107582Z","title":"Invariant node representation learning under distribution shifts with multiple latent environments.ACM Transactions on Information Systems, 42(1):1– 30, 2023","venue":null,"work_id":"f46aa52a-2dee-4a79-b6ff-378aab691bdc","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.767708Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:29d620ce0e2216650749e94c01b9b61fbe08856021d5c3e72d0aa789e466127d","observation_id":"9fb5ceaa-a0d7-4251-9648-97b184c10fe0","resolution":{"observed_at":"2026-08-07T10:19:36.173546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08076","last_updated":"2024-06-05T01:41:31Z","snapshot_observed_at":"2026-07-06T15:42:14.659345Z","submitted_at":"2023-06-13T18:46:28Z","title":"Graph Structure and Feature Extrapolation for Out-of-Distribution Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08076","snapshot_observed_at":"2026-08-07T10:19:29.813850Z","title":"Graph structure and feature extrapolation for out-of-distribution generalization.arXiv preprint arXiv:2306.08076, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.813850Z"},"links":{"cited_paper":"/paper/2306.08076","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:21846244ef4bb9254e182a4fdd4b2744a922f3721b80e77291e110268f934880","observation_id":"075a72d6-07bf-4dbf-82e2-94d442263d76","resolution":{"observed_at":"2026-08-07T10:19:29.813850Z","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-07T10:19:35.970758Z","title":"Graph structure extrapolation for out-of-distribution generalization","venue":null,"work_id":"c5844ccc-fd5c-4546-8ef5-dc550208d1af","year":2024},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.879008Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:616e94e8bf8f15ffecd94b7f3b52c8df23eed6d5b05bd83a07e93c8cc06d079b","observation_id":"331e7216-cdde-4d2f-9e27-ede23c27dd95","resolution":{"observed_at":"2026-08-07T10:19:36.039442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:35.770453Z","title":"Graph rationalization with environment- based augmentations","venue":null,"work_id":"888a2234-cf10-4a2b-9134-ecf65410b7b5","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.913641Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:f5441af24da623206efdf489123d0a6592f1c794f900f73b52240774c418a61b","observation_id":"9c2264b9-f546-4de5-a4da-de8fdb2e9acd","resolution":{"observed_at":"2026-08-07T10:19:35.882865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:35.489389Z","title":"Flood: A flexible invariant learning framework for out-of-distribution generalization on graphs","venue":null,"work_id":"e50738dd-1289-4d9a-a7b8-6e5fd42045d9","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:29.956232Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:418803e5dcd7eaf6c9c5a29aaaae3514ce294457b3acf455d640b21474b81b94","observation_id":"833c2327-28e6-4c0d-94f9-193aeca1a3e8","resolution":{"observed_at":"2026-08-07T10:19:35.690693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:30.017605Z","title":"Parameterized explainer for graph neural network.Advances in Neural Information Processing Systems, 33:19620–19631, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.017605Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:82841a587fdca08283f0be86c36f97d45f4192f3d38d491a2b8d06e01261f874","observation_id":"1ce8be4e-df53-4951-9e72-60d1bb262184","resolution":{"observed_at":"2026-08-07T10:19:30.017605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.00712","last_updated":"2017-03-05T16:59:44Z","snapshot_observed_at":"2026-08-05T03:48:52.905768Z","submitted_at":"2016-11-02T18:25:40Z","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.00712","snapshot_observed_at":"2026-08-07T10:19:30.067147Z","title":"The concrete distribution: A continuous relaxation of discrete random variables.arXiv preprint arXiv:1611.00712, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.067147Z"},"links":{"cited_paper":"/paper/1611.00712","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:0d27142a8ef12dee53f7a79ba820bd2e4f37d41654f60f28ee261dcc86d1e1c1","observation_id":"6d44db18-9435-473c-85a6-ad5cf82b5936","resolution":{"observed_at":"2026-08-07T10:19:30.067147Z","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-07T10:19:35.306741Z","title":"Interpretable and generalizable graph learning via stochastic attention mechanism","venue":null,"work_id":"7be49778-fedf-466c-a4c5-3bd68bd9b8a3","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.149773Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:89889639c47e6ef3551b26f1e286dd25718c373675e18eb08245d1021468bb6e","observation_id":"42f4d0be-e37c-4642-96af-117b63a1e6ff","resolution":{"observed_at":"2026-08-07T10:19:35.386309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:30.246351Z","title":"Pytorch: An imperative style, high-performance deep learning library, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.246351Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:ad698c631648f5468fcc8bbf9b3f0b81252a9f8f2482a711a6685642510d4679","observation_id":"8e7bdb8f-1e94-4fa2-858f-39908b72cf4b","resolution":{"observed_at":"2026-08-07T10:19:30.246351Z","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-07T10:19:30.338741Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.338741Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:5cd104a258abec967a05d2ee0fa756e44b7644b6972b669c2ce66a12174de265","observation_id":"e85196b3-6fff-4a49-857e-ef495d36cfc3","resolution":{"observed_at":"2026-08-07T10:19:30.338741Z","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-07T10:19:30.411468Z","title":"Gradient starvation: A learning proclivity in neural networks.Advances in Neural Information Processing Systems, 34:1256–1272, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.411468Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:e7142dc1b1dbf8cadfb8dc7c6a7119a0d54ea73249f2af6a7330511c47d52b2b","observation_id":"b0a76a1a-3aeb-421c-8615-1d7364738f20","resolution":{"observed_at":"2026-08-07T10:19:30.411468Z","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-07T10:19:35.056716Z","title":"On the spectral bias of neural networks: International conference on machine learning.arXiv, 2019","venue":null,"work_id":"1f88cb62-adfb-47d6-a929-de474613e10c","year":2019},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.529618Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:88e6732cc59cd7da37f108dfbaff41b45808e49a62f53725e1e123abaf2885ce","observation_id":"1796d800-1931-4a85-a937-51f2bf23a051","resolution":{"observed_at":"2026-08-07T10:19:35.142294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10903","last_updated":"2020-03-12T08:04:36Z","snapshot_observed_at":"2026-07-06T08:10:07.945422Z","submitted_at":"2019-07-25T08:57:45Z","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10903","snapshot_observed_at":"2026-08-07T10:19:30.640457Z","title":"Dropedge: Towards deep graph convolu- tional networks on node classification.arXiv preprint arXiv:1907.10903, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.640457Z"},"links":{"cited_paper":"/paper/1907.10903","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:4f23ad6d9ea0cc3a6e24974d1b9eaf0dfcc51af9d516862a9018722b28058eaf","observation_id":"4a7bce00-ecb2-4c27-baa4-dee6bb36769c","resolution":{"observed_at":"2026-08-07T10:19:30.640457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T10:19:30.793663Z","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":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.793663Z"},"links":{"cited_paper":"/paper/1911.08731","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:6b74d9dab192175d4bcd11eb2460114a659b50deb8ebc4a72c3add049399ccdc","observation_id":"b93b6ecd-adfa-4f71-b1bc-96b2ab37227c","resolution":{"observed_at":"2026-08-07T10:19:30.793663Z","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-07T10:19:30.891178Z","title":"The pitfalls of simplicity bias in neural networks.Advances in Neural Information Processing Systems, 33:9573–9585, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.891178Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:d1de116a05a9e38af603c49e745bab7fe54b658fb2d204ff90284d35e6dc3a21","observation_id":"cf28ca0c-d013-41d3-8018-f3eda54a3d74","resolution":{"observed_at":"2026-08-07T10:19:30.891178Z","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-07T10:19:34.929989Z","title":"Manning, Andrew Ng, and Christopher Potts","venue":null,"work_id":"5e0d651d-accb-43d8-9d78-ced2aca502ae","year":2013},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.921198Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:eebe272360e2da2fa3783218e0014df08921eaab0dfecc0eaf56d84b34e0cde4","observation_id":"c60ba7ff-cb0f-4930-874a-093ade83221c","resolution":{"observed_at":"2026-08-07T10:19:34.980793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:34.800635Z","title":"Unleashing the power of graph data augmentation on covariate distribution shift.Advances in Neural Information Processing Systems, 36, 2023","venue":null,"work_id":"eb713436-f416-42a5-99b0-463ce523e376","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:30.999218Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:cffd076d541d5f2c41b80bdb0ba020769085b1da42fa5726ff3e67d67c337bb1","observation_id":"ccf20227-4109-487a-8c1b-398c6e4eae78","resolution":{"observed_at":"2026-08-07T10:19:34.827139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:34.619851Z","title":"Deep learning and the information bottleneck principle, 2015","venue":null,"work_id":"704ccdce-cdfd-4c3b-8364-791857f52d47","year":2015},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.112498Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:24f5d8c908778120ff5f818e2ce770e1d2b63e938a05dc7757242f2801a6369a","observation_id":"acfef263-7fac-4f47-915f-e9f9a6919428","resolution":{"observed_at":"2026-08-07T10:19:34.726580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:34.470322Z","title":"Vapnik.The nature of statistical learning theory","venue":null,"work_id":"7634b28b-d470-4756-a80e-63833587df7a","year":1995},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.171823Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:a18e685c5efbc53dee71a41cff54d8145ece7c14433b09cabafb8406bedb8ac0","observation_id":"fe09550f-b12e-48db-8dd0-df2760c31307","resolution":{"observed_at":"2026-08-07T10:19:34.526006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-07T10:19:31.247964Z","title":"Graph attention networks.arXiv preprint arXiv:1710.10903, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.247964Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:ee9cd066e588bd7a55fabace0150ef1a69358e127868658a61ea7c732c97ecc3","observation_id":"4e8da241-3c1e-4ff6-a017-d047f9e47e9f","resolution":{"observed_at":"2026-08-07T10:19:31.247964Z","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-07T10:19:34.301399Z","title":"Advancing molecule invariant represen- tation via privileged substructure identification","venue":null,"work_id":"3e1e1bc0-7055-4c8a-a1cb-c6508eb90efc","year":2024},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.343571Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:f9009f83bee1eb8efdd172f8f7327aea19a86d7ad2de9865f59f026d7c74aae1","observation_id":"d0fb5c9f-176a-4108-b4c6-f3ee081000e0","resolution":{"observed_at":"2026-08-07T10:19:34.416430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02466","last_updated":"2024-08-16T08:25:42Z","snapshot_observed_at":"2026-08-07T20:11:41.584301Z","submitted_at":"2022-02-05T02:31:01Z","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.02466","snapshot_observed_at":"2026-08-07T10:19:31.465793Z","title":"Handling distribution shifts on graphs: An invariance perspective.arXiv preprint arXiv:2202.02466, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.465793Z"},"links":{"cited_paper":"/paper/2202.02466","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:be16d991b905a94451cacf0291dc53133eee39a3414250de7952b0916d99a1d0","observation_id":"9bcfc322-dbe5-4d9b-8ea9-5616e0879d97","resolution":{"observed_at":"2026-08-07T10:19:31.465793Z","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-07T10:19:34.165185Z","title":"Discovering invariant rationales for graph neural networks","venue":null,"work_id":"b9a33785-2121-4f80-9b03-3bd240e4ba65","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.558776Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:f8d7f94b5f37f0828d6eefcd44358669d796ca587702745849b9cc1604f82eff","observation_id":"39ec979b-77c2-4a9e-8191-611191eeb57b","resolution":{"observed_at":"2026-08-07T10:19:34.253383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:31.649571Z","title":"Moleculenet: a benchmark for molecular machine learning.Chemical science, 9(2):513–530, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.649571Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:c09fa946ffcbeecbefd59cbe51c5d55b18450d0b65dc754306c152f4088140cd","observation_id":"ed685275-35b8-43a9-b68a-e35f94aa0b92","resolution":{"observed_at":"2026-08-07T10:19:31.649571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-07T10:19:31.724411Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.724411Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:f9efac6ea08b1d9defe99ea73dee6313230e86cf1d4b7cad8c66e7b0f00beef2","observation_id":"df7776f3-010f-4723-b998-793b0b26edc5","resolution":{"observed_at":"2026-08-07T10:19:31.724411Z","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-07T10:19:33.938214Z","title":"Learning substructure invariance for out-of-distribution molecular representations","venue":null,"work_id":"e4ad9274-e293-43f1-969f-32eea132e25b","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.818511Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:4c10f92a65e6c4c9c1e0f4eb6f6d4d6fdbbb2c9702fc2180b96f8f296e57d874","observation_id":"569d6915-1afd-4151-a59d-66b322f06583","resolution":{"observed_at":"2026-08-07T10:19:34.047738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:33.734558Z","title":"Improving out- of-distribution robustness via selective augmentation","venue":null,"work_id":"de2c524b-15fc-4f01-81f5-c0e5d67661ff","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.889151Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:b1c3281a133718107be9abc5e6ae76aed359b2cf4c43b1a416a90db84d7f8b42","observation_id":"3e4bd95a-017a-483a-917e-92200d80ba98","resolution":{"observed_at":"2026-08-07T10:19:33.849734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:33.601318Z","title":"Empowering graph invariance learning with deep spurious infomax","venue":null,"work_id":"be76c532-5e28-4f95-934b-310081d4cd74","year":2024},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:31.997443Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:61337f6d61059dc444dc2ac0f25e0883baec1c4ab9e38f6233cb5e94d9b0b107","observation_id":"7863c61b-bf9f-4c90-9d98-7c154a9918a6","resolution":{"observed_at":"2026-08-07T10:19:33.659443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:33.458853Z","title":"Learning graph invariance by harnessing spuriosity","venue":null,"work_id":"027fa3cf-6546-4300-9fc6-65e8beeac175","year":2025},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:32.088792Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:4bcdb6395d80ad9b544c1040c4b2b92a4ea206663a8d896e4d3e13bbedeb9a0e","observation_id":"4343ce90-9017-4186-85e0-f39f89f8811e","resolution":{"observed_at":"2026-08-07T10:19:33.507188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:32.170857Z","title":"Gnnexplainer: Generating explanations for graph neural networks.Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:32.170857Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:08b0662d2e6d5290fe58623dff622590ff16de518ca93186aa52e9c83496fdee","observation_id":"a47c2eb2-d1da-4535-96c3-9a027bc3a607","resolution":{"observed_at":"2026-08-07T10:19:32.170857Z","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-07T10:19:33.317959Z","title":"Mind the label shift of augmentation-based graph ood generalization","venue":null,"work_id":"a9e2edc2-6208-44fd-aab0-1db1e700d6dd","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:32.260594Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:27c9b384c01e855a4b7d765f9a7a9c570e2bf58892b11779db017d5aefde7e84","observation_id":"f85fdc5a-9a53-42ec-9bde-db5946f954e4","resolution":{"observed_at":"2026-08-07T10:19:33.362524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:33.140140Z","title":"Explainability in graph neural networks: A taxonomic survey.IEEE transactions on pattern analysis and machine intelligence, 45(5):5782–5799, 2022","venue":null,"work_id":"0aa04183-42a9-4c1e-b41c-3feeee9114c4","year":2022},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:32.339693Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:5b79dbfe7b9ee3553a4f9045fbbc7a216a08904a1b8709f79ea0734f809c854d","observation_id":"bf9e3cd6-c425-4adc-aad6-a82705162323","resolution":{"observed_at":"2026-08-07T10:19:33.231185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:19:32.965115Z","title":"Learning invariant molecular representation in latent discrete space.Advances in Neural Information Processing Systems, 36, 2023","venue":null,"work_id":"caf0efdb-f9eb-4991-b11f-88743951b6ca","year":2023},"citing_paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization","version":4},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:32.445418Z"},"links":{"citing_paper":"/paper/2506.05957"},"observation_digest":"sha256:4bb7d6ca5418c2e9a6f6bcfa0da58357331a78d356daa981562a27de26e9d45a","observation_id":"abb3e4c5-41dc-48d2-a44c-7d35d6901231","resolution":{"observed_at":"2026-08-07T10:19:33.043598Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05957","last_updated":"2025-09-06T14:59:08Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T10:34:23.752473Z","submitted_at":"2025-06-06T10:34:48Z","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":62},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 1 inbound Pith citation observation for arXiv:2506.05957."}