{"as_of":"2026-08-18T21:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7846129a2fa0462261f21398de2b64b6035fe7b596868a07a921a4db869d8b23","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:38:27.816101Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2506.19281/citation-record","integrity":"/paper/2506.19281/integrity","json":"/paper/2506.19281/citation-record.json","paper":"/paper/2506.19281"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:38:28.831740Z","title":null,"venue":null,"work_id":"5afc8b5c-b5ee-4ff4-b728-981298d95008","year":null},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.009179Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:7d0e70ab3609829fd17a175bacf405e72afcb23d44cee32017a1796d18ea664b","observation_id":"ad534051-ef38-44e1-a710-0f78c208f091","resolution":{"observed_at":"2026-08-15T18:38:28.836031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.796550Z","title":null,"venue":null,"work_id":"aa92f571-f583-4893-81a9-3d9aaf95d683","year":2023},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.161715Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:99115867c62dfa318617ac4da3f62c01f02b827c06f446b4536b364d764ae5b9","observation_id":"b8bf6289-f928-41d6-85e6-67d127247aa5","resolution":{"observed_at":"2026-08-15T18:38:28.801442Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.781627Z","title":null,"venue":null,"work_id":"ab1c12f8-9025-4d4e-92e3-e7e9b01450eb","year":2021},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.167264Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:b57d8ab4e24eb7108ac6ba4de439b347e5f44cd5717fc86fdb6f08ef1e976e75","observation_id":"0c0860bc-3651-4c1e-8774-be0d5143d0a9","resolution":{"observed_at":"2026-08-15T18:38:28.786379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.766403Z","title":null,"venue":null,"work_id":"24b27758-8d64-45d3-8ed4-f83f64f51943","year":1984},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.171962Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:9233737b977910273cc14a94e7f2ede6f5127a84c63d7439923eec3160747cee","observation_id":"f4ed2224-45aa-4fe2-af5d-32796bdd8698","resolution":{"observed_at":"2026-08-15T18:38:28.771358Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.03675","last_updated":"2017-02-28T05:37:37Z","snapshot_observed_at":"2026-08-17T16:11:25.545383Z","submitted_at":"2016-09-13T04:39:33Z","title":"Deep Coevolutionary Network: Embedding User and Item Features for Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.03675","snapshot_observed_at":"2026-08-15T18:38:27.179979Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.179979Z"},"links":{"cited_paper":"/paper/1609.03675","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:6434f883c8c952f0a8418febe3790ed288450e7adc25b4480b59de944b850285","observation_id":"a3f53151-0f7b-48fa-928b-ea14ce837f1b","resolution":{"observed_at":"2026-08-15T18:38:27.179979Z","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-15T18:38:28.649889Z","title":null,"venue":null,"work_id":"6fd8401d-4151-42c7-b896-af166e067420","year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.186715Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:0faed1e601d7bd6c9769990b4e2f82764984be219888ce87d833063625e1589d","observation_id":"0a03f481-3b27-4b46-86c8-ce3d3f4d6e86","resolution":{"observed_at":"2026-08-15T18:38:28.714673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.616827Z","title":null,"venue":null,"work_id":"3fcafb3f-7082-4583-9b1c-b14a96dacf55","year":1999},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.192420Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:6bd5872989f162520ae8292dabd9874938572e6fd89c26a35f4a623ebd27d8fe","observation_id":"88a268e5-34eb-4fd1-a95a-e0ec19760c9d","resolution":{"observed_at":"2026-08-15T18:38:28.623997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:27.270561Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.270561Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:0f8e540fa17d8818d76e6a1c299c1c05e0208d41945b8766865713412c31e0d2","observation_id":"65f2a03e-71a2-4bb4-b055-3acdead00598","resolution":{"observed_at":"2026-08-15T18:38:27.270561Z","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-08-18T03:09:05.320976Z","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-15T18:38:27.338951Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.338951Z"},"links":{"cited_paper":"/paper/2201.09637","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:e482360b0d4cea08941815c203fe7b93bd359ebeb48db8ed1f7556786d56942c","observation_id":"eda3622a-5bab-4a02-b85a-02b5531bd20c","resolution":{"observed_at":"2026-08-15T18:38:27.338951Z","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-15T18:38:28.586043Z","title":null,"venue":null,"work_id":"1bbefa56-f103-444d-b14c-2be5a80bca60","year":2024},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.344507Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:a605734b1a689aede7ed8fdc3cf90b7b73a012a5cb8e56cde6f41e64de874039","observation_id":"98d02a25-4c89-4cad-a219-0fc736b8bfb2","resolution":{"observed_at":"2026-08-15T18:38:28.590426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.459550Z","title":null,"venue":null,"work_id":"43071ddc-1c24-4b00-bd4d-1aff8b403331","year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.350540Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:d6e98487e74ab16defef9d89945defdbeb3a9cedcbd2d9169bca0e3fea2dc87c","observation_id":"ae3caf81-d5d2-46f0-b8c2-2b414ea56089","resolution":{"observed_at":"2026-08-15T18:38:28.509813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07987","last_updated":"2022-12-29T13:18:29Z","snapshot_observed_at":"2026-08-16T17:20:53.739007Z","submitted_at":"2022-02-16T10:59:06Z","title":"Out-Of-Distribution Generalization on Graphs: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07987","snapshot_observed_at":"2026-08-15T18:38:27.355554Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.355554Z"},"links":{"cited_paper":"/paper/2202.07987","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:0237e2b0f31d2701619ef2f90c4a7add2912ce436c3a36ca24aeb5652e9f5a85","observation_id":"c35ca129-c82d-483c-a95f-c3c36a0936e3","resolution":{"observed_at":"2026-08-15T18:38:27.355554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11153","last_updated":"2024-02-17T00:40:12Z","snapshot_observed_at":"2026-08-16T14:17:48.896677Z","submitted_at":"2024-02-17T00:40:12Z","title":"Beyond Generalization: A Survey of Out-Of-Distribution Adaptation on Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11153","snapshot_observed_at":"2026-08-15T18:38:27.401155Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.401155Z"},"links":{"cited_paper":"/paper/2402.11153","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:a98dcbe6dd5516e04bef749cda7fdd4f3dbaa581b90519a4eeb34c57c92d5129","observation_id":"d219ca60-78e5-4348-b6a1-596c6b0f9dbe","resolution":{"observed_at":"2026-08-15T18:38:27.401155Z","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-15T18:38:28.442388Z","title":null,"venue":null,"work_id":"7f12529d-7417-4421-9ec6-deb9f4193639","year":2021},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.468242Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:b0a69f1966a0f1beb44bc3b915017e0782b66245502594d8bf6b38a4b0ef66dc","observation_id":"90733adc-ba06-402f-ae4a-b363be949aa9","resolution":{"observed_at":"2026-08-15T18:38:28.449064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.425765Z","title":null,"venue":null,"work_id":"5756cf6e-9158-4a77-97e7-52b5e5bf1a08","year":2016},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.472732Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:acebec24791a42cb586258d1cefe2ad8fa212aa14d137871ef24e62fa5831a28","observation_id":"d63a0cc0-b5d3-464f-819e-a4d2c22fdb81","resolution":{"observed_at":"2026-08-15T18:38:28.430960Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:27.478343Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.478343Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:f0dcb7256f3e1f9bf46fef37d58add63a1d741e3b114f04d1ac8dbd3384f59dd","observation_id":"a373b9d9-df92-4bd7-8cc5-2d242b658a37","resolution":{"observed_at":"2026-08-15T18:38:27.478343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19361","last_updated":"2024-11-06T18:52:44Z","snapshot_observed_at":"2026-08-17T20:17:20.864622Z","submitted_at":"2024-10-25T07:53:32Z","title":"Engineering Trustworthy AI: A Developer Guide for Empirical Risk Minimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19361","snapshot_observed_at":"2026-08-15T18:38:27.535802Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.535802Z"},"links":{"cited_paper":"/paper/2410.19361","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:1165595b25abad521b26973f1b25484052703f447e18adbd7e94ed52834f1f8a","observation_id":"a3b70959-45a0-4022-a147-8363ca91f416","resolution":{"observed_at":"2026-08-15T18:38:27.535802Z","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-17T18:58:45.514336Z","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-15T18:38:27.605937Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.605937Z"},"links":{"cited_paper":"/paper/1911.08731","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:0ad90305f72b68381fb07136f739757ec245cad0d8a9a0d4e25c655872648b1b","observation_id":"bdc04622-cded-4ccd-8476-a98b3ce05048","resolution":{"observed_at":"2026-08-15T18:38:27.605937Z","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-15T18:38:28.280493Z","title":null,"venue":null,"work_id":"b3cf0644-c794-4e57-bf05-947b15819aae","year":2024},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.611515Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:82182a282dc9ac7d811215c6bf7ced0b259111434848dc55e471c008c809b386","observation_id":"27c09313-f446-425f-8b44-08a44e6e4705","resolution":{"observed_at":"2026-08-15T18:38:28.365721Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.213864Z","title":null,"venue":null,"work_id":"37aed73b-4871-4e86-a810-089ef108f96d","year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.616440Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:f48a566a89917ee9726fe013ef193ba04a395332574795ded0fa3ffcf2e59441","observation_id":"c511da13-ee28-4be2-8d34-ff399ad58c5f","resolution":{"observed_at":"2026-08-15T18:38:28.226026Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16374","last_updated":"2024-03-07T05:07:49Z","snapshot_observed_at":"2026-08-16T14:15:24.764871Z","submitted_at":"2024-02-26T07:52:40Z","title":"Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16374","snapshot_observed_at":"2026-08-15T18:38:27.621171Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.621171Z"},"links":{"cited_paper":"/paper/2402.16374","citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:78d8093839e5e40f262eb26252dc4cda5ed23984a3e823638ccbacf6781c10e5","observation_id":"50fe23b2-9393-4f30-bf3b-d7e7e4130404","resolution":{"observed_at":"2026-08-15T18:38:27.621171Z","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-15T18:38:28.196967Z","title":null,"venue":null,"work_id":"e08393c0-fd98-41cd-9a8d-e2573ae094af","year":2024},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.626246Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:97a28a85a9a3b77b2335acea2dfacbfa4fdf2524dcfab1f676a58c976748630d","observation_id":"2b9aaea1-1d6d-405b-a4c0-501debf89a18","resolution":{"observed_at":"2026-08-15T18:38:28.202309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.179984Z","title":null,"venue":null,"work_id":"fe070f0d-9d20-42d4-9542-76c7ef8672a8","year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.631669Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:eea1a345d9f48c37ee41e41b06cbb6fc81662942ab7855de56ad6104ac6bd21e","observation_id":"4eeeec44-283f-4646-ab9f-ff7b19dbf58c","resolution":{"observed_at":"2026-08-15T18:38:28.185273Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.145508Z","title":null,"venue":null,"work_id":"bde9c594-df1b-4aab-8595-bec2de674f4e","year":2021},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.635916Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:8962afeff4ba775b68840b12056691c93c9fd9650df0d1520ecc291617159de5","observation_id":"347fb8a2-bf9c-4390-8fd0-cd315089f6d6","resolution":{"observed_at":"2026-08-15T18:38:28.168647Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.040704Z","title":null,"venue":null,"work_id":"49bac11c-d4d4-4732-8ee0-c7d5dc13c387","year":2022},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.654132Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:777017df59b663c7d035793c4af66453513bbd52e2f3a4c0cb51ec7a02502878","observation_id":"898aeac4-9b8e-4ad6-8d36-0d06051d8c20","resolution":{"observed_at":"2026-08-15T18:38:28.068752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.026560Z","title":null,"venue":null,"work_id":"e64fa496-29c9-4363-a095-028630dc50e7","year":2020},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.720108Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:9975ee500380d91a7206677a0e051f6993041bab9c9b2905497fe0f907a51687","observation_id":"54fe5bb8-c12a-4cda-80c0-50907a5a1f7e","resolution":{"observed_at":"2026-08-15T18:38:28.030928Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.011263Z","title":null,"venue":null,"work_id":"70a5f0b0-c36e-4f69-98b0-2399a85f16cd","year":2019},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.789497Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:f02edabbd530909bfc60d2b57cefbb1eff92cab43497565787f974c4dde04ed9","observation_id":"3e5c7869-d98d-4f43-abf0-e0adfacfe6c0","resolution":{"observed_at":"2026-08-15T18:38:28.015924Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:27.950889Z","title":null,"venue":null,"work_id":"8521db35-61a9-47f5-920e-141be3902fd6","year":2021},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.816101Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:08a74c6bafcdef5bc7b888bfa2c193bc427bbff3410ed1b884216bae1255812b","observation_id":"38d69035-4cf0-429d-8d7a-81c3aedfaebc","resolution":{"observed_at":"2026-08-15T18:38:27.999332Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.813484Z","title":"IEEE transactions on neural networks 4, 6 (1993), 962–969","venue":null,"work_id":"057c2ad8-0dae-4003-b5c8-d8486c4127e6","year":1993},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.066059Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:cb56d181d5a960a3e0eefcadf96dfb513ac4fde2dedbff8934bbb315cf16ca5a","observation_id":"b4c785c7-ff94-4877-a466-05f7fcad51fd","resolution":{"observed_at":"2026-08-15T18:38:28.819695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:38:28.399019Z","title":"SIAM Journal on optimization 19, 4 (2009), 1574–1609","venue":null,"work_id":"8c28956d-7e1e-4353-a97a-63464103921c","year":2009},"citing_paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-15T18:38:27.482576Z"},"links":{"citing_paper":"/paper/2506.19281"},"observation_digest":"sha256:2191ace432362facc60e519fd55d9cd63d26e464edd75c0a316b6d69ac575d79","observation_id":"dbd7d692-604a-4a19-976e-27e3202bad54","resolution":{"observed_at":"2026-08-15T18:38:28.404611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19281","last_updated":"2025-06-24T03:25:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T03:09:56.067051Z","submitted_at":"2025-06-24T03:25:33Z","title":"Robust OOD Graph Learning via Mean Constraints and Noise Reduction"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":30},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2506.19281."}