{"as_of":"2026-08-09T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3795a5a091eea90495364984fc5abb8cd195f21e45a4e8a41b853493aadfb0a0","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:29:58.086788Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.19108/citation-record","integrity":"/paper/2607.19108/integrity","json":"/paper/2607.19108/citation-record.json","paper":"/paper/2607.19108"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T13:29:50.595550Z","title":"Communication, Simulation, and Intelligent Agents: Implications of Personal Intelligent Machines for Medical Education","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:50.595550Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:070bbe827f760e14f56742c4caae7e2fcb569715d0c5b88ac9a1f44246b5c2ed","observation_id":"a04e584a-59ae-49de-b86b-4ab00787c2e0","resolution":{"observed_at":"2026-08-01T13:29:50.595550Z","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-01T13:29:50.714001Z","title":"Classification Problem Solving","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:50.714001Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:2c2c5af5960729767d238489797786007da7691448d184a5841eb7f86d748ebb","observation_id":"5181571e-acba-4874-ad46-741b12dde99b","resolution":{"observed_at":"2026-08-01T13:29:50.714001Z","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-01T13:29:50.868342Z","title":", title =","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:50.868342Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:b4a1a836b5f26dcc0fd2f6d19b6b29f69b1852545ef3f27e05475b4e3508814d","observation_id":"8e689d57-b0b4-4785-b8df-9e9a3ad1fe0c","resolution":{"observed_at":"2026-08-01T13:29:50.868342Z","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-01T13:29:50.963460Z","title":"New Ways to Make Microcircuits Smaller---Duplicate Entry","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:50.963460Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:17fa29edd164e5bdb266a5ef1f5d736b1bfbffe849cc6b3afedd65eb7f9684ac","observation_id":"29f1e72b-ce2c-4abd-9e41-4f7f379ee116","resolution":{"observed_at":"2026-08-01T13:29:50.963460Z","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-01T13:29:51.054840Z","title":"Clancey and Glenn Rennels , abstract =","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.054840Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:8a20259dd4032776faca74eb8846ef65bd3727bb37c3e9aaa0c2629a177aeb7e","observation_id":"89e92158-77bb-4b2c-9d42-29f9078c0567","resolution":{"observed_at":"2026-08-01T13:29:51.054840Z","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-01T13:29:51.175170Z","title":"and Rennels, Glenn R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.175170Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:1002182e89de6b1a59c4842e16619692b653bc0ae84e12e55f558be22ee15f28","observation_id":"4bc97787-4ae6-40f2-88a4-276d8965fac9","resolution":{"observed_at":"2026-08-01T13:29:51.175170Z","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-01T13:29:51.347651Z","title":"Poligon: A System for Parallel Problem Solving","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.347651Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:be363118ba1d4523431cca33e93f4dc026b8e6ec2489b30c0ba5066407e785bb","observation_id":"208fb90b-1f73-4034-9902-b43f8e2dc85a","resolution":{"observed_at":"2026-08-01T13:29:51.347651Z","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-01T13:29:51.489544Z","title":"Transfer of Rule-Based Expertise through a Tutorial Dialogue","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.489544Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:994c223c1fd7e564d28525d4c0850b86b0cb900e0d03939f69571e18d4ac63f5","observation_id":"0f8df6d2-de2f-4c9d-b83a-f2661d880832","resolution":{"observed_at":"2026-08-01T13:29:51.489544Z","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-01T13:29:51.567078Z","title":"The Engineering of Qualitative Models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.567078Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a9ed5bc08569556de88e6e0453676467dcd0bb87a6a390f05d58fe2822a9647f","observation_id":"b5e431ba-ff19-4fe4-ab54-72721a700d9a","resolution":{"observed_at":"2026-08-01T13:29:51.567078Z","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-01T13:29:51.645709Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.645709Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:85d81fbc61e90b7e6bde84067bb492c96d63d736dbc5ccc97b0ec105a2c038ad","observation_id":"b0b2c228-5126-477a-93f3-cc3a0743bc15","resolution":{"observed_at":"2026-08-01T13:29:51.645709Z","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-01T13:29:51.732087Z","title":"Pluto: The 'Other' Red Planet","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.732087Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:5bbebf5bc706f5f29620dc14498ad3a1b4ee8bc1d2c065575174e7405c8a4de8","observation_id":"e5ef28ab-198d-4ecb-b463-22321e84b386","resolution":{"observed_at":"2026-08-01T13:29:51.732087Z","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-01T13:29:51.808163Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.808163Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:f44f547d80210e3870dc0c2ea012957750f5c33bed4b99a00d13889e4e1a8e88","observation_id":"2ccf2f3a-9977-4e35-ac7c-61b998792f0d","resolution":{"observed_at":"2026-08-01T13:29:51.808163Z","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-01T13:29:51.889017Z","title":"Graph Learning in the Era of","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.889017Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:25c0e53e220fd341eafb73b118ef69b5887fa4f8e4f7a77458a9a67fddcec2ea","observation_id":"9bdfff38-6925-4e02-b511-314369105971","resolution":{"observed_at":"2026-08-01T13:29:51.889017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10727","last_updated":"2024-06-15T19:56:21Z","snapshot_observed_at":"2026-07-06T18:31:36.504766Z","submitted_at":"2024-06-15T19:56:21Z","title":"Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10727","snapshot_observed_at":"2026-08-01T13:29:51.975602Z","title":"arXiv preprint arXiv:2406.10727 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:51.975602Z"},"links":{"cited_paper":"/paper/2406.10727","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:315448b384f83232b4c5e4e4b77611937a8d193adfb3a2a4521b8fe34f742484","observation_id":"33a04f7a-11bb-4c0b-b5b3-e99ba88cd43a","resolution":{"observed_at":"2026-08-01T13:29:51.975602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-07-06T10:46:50.440586Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-01T13:29:52.052843Z","title":"arXiv preprint arXiv:2103.03036 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.052843Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a5afcb705c0228737cd2c2650b0b93791898ec3d9473595d8d0a2510b38f1ac1","observation_id":"8f85cb3f-91f8-4605-be8e-a48e2217f8b9","resolution":{"observed_at":"2026-08-01T13:29:52.052843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08685","last_updated":"2024-12-24T07:08:45Z","snapshot_observed_at":"2026-08-06T09:11:01.400113Z","submitted_at":"2024-08-16T11:58:34Z","title":"Can Large Language Models Improve the Adversarial Robustness of Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08685","snapshot_observed_at":"2026-08-01T13:29:52.157856Z","title":"arXiv preprint arXiv:2408.08685 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.157856Z"},"links":{"cited_paper":"/paper/2408.08685","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:3d58e904e9267ab44db786e9650eed05f26c6da3a3de66e2fc31dbc6da995eab","observation_id":"5fe6c8e6-fbad-4f6e-8d76-a59f736834c8","resolution":{"observed_at":"2026-08-01T13:29:52.157856Z","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-01T13:29:52.275803Z","title":"Rethinking Graph Structure Learning in the Era of","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.275803Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:b443d2917a7c84921f291245fca37f119f43d5af4e835b0e09f64c47f7c1ba21","observation_id":"a6191c60-2b38-4516-b010-380d96afe04b","resolution":{"observed_at":"2026-08-01T13:29:52.275803Z","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-01T13:29:52.397655Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.397655Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ca61475b2532fee85566c4863e795e61a7db1db6934990de3b9e84469e41312a","observation_id":"96f6b722-5bd9-4d7d-9051-8c83843e521c","resolution":{"observed_at":"2026-08-01T13:29:52.397655Z","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-01T13:29:52.502999Z","title":"Harnessing Explanations:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.502999Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ea1cecfb0b8e7a90dc5a603d8d4b4473d847d03a226572bf0aeda42f1e7ef064","observation_id":"ab0c0ed4-1a3f-4beb-a319-c7c33e46941b","resolution":{"observed_at":"2026-08-01T13:29:52.502999Z","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-01T13:29:52.582068Z","title":"Companion Proceedings of the ACM Web Conference 2024 , year=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.582068Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:2c26292bddc719e6d89ed170fb7be5ac5363b622325d00e0192bbbcff49065a0","observation_id":"b3523cc4-b9c7-4ca5-9456-02805d4926d2","resolution":{"observed_at":"2026-08-01T13:29:52.582068Z","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-01T13:29:52.686642Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.686642Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:062bad0bdb94290893ef1afc5c058b26c19fbd14c3cd9f62ce93c933f7b83a48","observation_id":"b8ea8e6d-6b60-4cf5-b0f9-b6224ad640d5","resolution":{"observed_at":"2026-08-01T13:29:52.686642Z","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-01T13:29:52.767104Z","title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.767104Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:9dfeac3e032363b29ef72277bc134141f6bae1a64877fa59c4f29095033749f2","observation_id":"afe194b9-7789-45b0-b659-5f7a9ebc172f","resolution":{"observed_at":"2026-08-01T13:29:52.767104Z","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-01T13:29:52.866889Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:52.866889Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ecefbec944f0a02585fe279d77c0ed76cf1d84643582df22cdc6291d65200ff3","observation_id":"56da4ef9-5342-4efd-83ec-ed52279776fc","resolution":{"observed_at":"2026-08-01T13:29:52.866889Z","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-01T13:29:53.063002Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:53.063002Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:d50b7776c0e19fd549c0ba7daa3da6d22c84d80c3ca958dc18613693ecb5c715","observation_id":"0c988886-6fbb-407c-8ecb-f15e8e818b44","resolution":{"observed_at":"2026-08-01T13:29:53.063002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-09T05:17:43.055948Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-01T13:29:53.256490Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:53.256490Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:04e78fe219c7542cb37b62d0836ec0e80fe324a2be92947b6574e00c9ac2b00e","observation_id":"a8e80baa-2eae-4e1d-b89d-11e338f23aa8","resolution":{"observed_at":"2026-08-01T13:29:53.256490Z","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-01T13:29:53.446803Z","title":"2021 , eprint=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:53.446803Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ed1380456ed28df2777e2231e2d5fb30be1f0476d78a7eaac93ffa178b01383b","observation_id":"6f5071f7-5112-4752-83ce-b683eea89d5c","resolution":{"observed_at":"2026-08-01T13:29:53.446803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04299","last_updated":"2024-06-07T03:09:35Z","snapshot_observed_at":"2026-08-05T12:37:12.699768Z","submitted_at":"2024-06-06T17:45:00Z","title":"NoisyGL: A Comprehensive Benchmark for Graph Neural Networks under Label Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04299","snapshot_observed_at":"2026-08-01T13:29:53.613715Z","title":"Advances in Neural Information Processing Systems Datasets and Benchmarks Track , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:53.613715Z"},"links":{"cited_paper":"/paper/2406.04299","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:c1105515bfe5d97675f46eb814d8a965b96da74e8770a1b97b11ec355314843a","observation_id":"527bdd1a-ecd6-4d47-9d48-5422dfda2106","resolution":{"observed_at":"2026-08-01T13:29:53.613715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09870","last_updated":"2025-03-01T14:35:37Z","snapshot_observed_at":"2026-07-06T18:30:54.899140Z","submitted_at":"2024-06-14T09:30:18Z","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09870","snapshot_observed_at":"2026-08-01T13:29:53.786918Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:53.786918Z"},"links":{"cited_paper":"/paper/2406.09870","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:40e4ad4a27d49631febb926bb2946ee3a5729fa56feee3ecd25839a88044cf70","observation_id":"34998482-615f-4261-a1e4-b3ea1fcd8ce6","resolution":{"observed_at":"2026-08-01T13:29:53.786918Z","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-01T13:29:53.934915Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:53.934915Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a827ea5756ee468395ec043ea4395aae891d7809e9330a26b8caa344b4f01275","observation_id":"e3faa0d5-1710-4e53-b31a-99046a39bcf8","resolution":{"observed_at":"2026-08-01T13:29:53.934915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-01T13:29:54.023499Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.023499Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:f8d4849cfcd77808ea6abafb996f8c2409b17c7a8952eff22227a53d11b4c4ab","observation_id":"7e5301fa-ca6a-4ffb-888d-a105210ec25b","resolution":{"observed_at":"2026-08-01T13:29:54.023499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T13:29:54.096926Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.096926Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:421321cd48999760a95b1fd5165a542504322fb57ad8a0656f9be7b62a05c074","observation_id":"ddfb62c6-18f6-459f-b3aa-7955b006466c","resolution":{"observed_at":"2026-08-01T13:29:54.096926Z","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-01T13:29:54.213408Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.213408Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:3c5a073293c63c71e78aec1c80eba20aed5ed1abcdc66e375b837fda7cb8130c","observation_id":"12496650-64b2-4ef9-a976-03c1170dfb0a","resolution":{"observed_at":"2026-08-01T13:29:54.213408Z","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-01T13:29:54.296024Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.296024Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:079f85bd9224db99324daedf042215855015fe1f3a3c0a2055d931bc1e84220e","observation_id":"a2095ce1-13c9-4316-a3fa-cae450c3b89a","resolution":{"observed_at":"2026-08-01T13:29:54.296024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-08-01T13:29:54.376422Z","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.376422Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:9fba2ae01c8ac06143abe366e91dc368dc1f8f2ddc0fbabe408ab4cd6a927702","observation_id":"1a89a488-396c-4adf-b019-6444d0844813","resolution":{"observed_at":"2026-08-01T13:29:54.376422Z","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-01T13:29:54.439915Z","title":"Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.439915Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a8058831423c2d630164adde646a996b3208190e2296604db56aeba3298ee412","observation_id":"29476126-1362-4191-baf1-5152f708d24a","resolution":{"observed_at":"2026-08-01T13:29:54.439915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12984","last_updated":"2024-02-20T13:13:13Z","snapshot_observed_at":"2026-08-04T11:41:59.976853Z","submitted_at":"2024-02-20T13:13:13Z","title":"Can GNN be Good Adapter for LLMs?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12984","snapshot_observed_at":"2026-08-01T13:29:54.497539Z","title":"Proceedings of the ACM Web Conference 2024 , year=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.497539Z"},"links":{"cited_paper":"/paper/2402.12984","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:9c06fa561b4c777d5b5da18c4c6d0732533669c223781d94f82e5bf0a19bd371","observation_id":"9b135562-c291-4921-bd9f-e273c8cbad24","resolution":{"observed_at":"2026-08-01T13:29:54.497539Z","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-01T13:29:54.558802Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.558802Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:14008133f7cc24f753faf06b733ba557d20b11cbaea5f97db07b591f315efcbb","observation_id":"e3cfb5b0-847e-410a-8fdd-32318476422a","resolution":{"observed_at":"2026-08-01T13:29:54.558802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00149","last_updated":"2024-07-12T23:01:32Z","snapshot_observed_at":"2026-07-06T16:25:46.699214Z","submitted_at":"2023-09-29T21:15:26Z","title":"One for All: Towards Training One Graph Model for All Classification Tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00149","snapshot_observed_at":"2026-08-01T13:29:54.619115Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.619115Z"},"links":{"cited_paper":"/paper/2310.00149","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:beffbe4d2d880bcdf9b606ec8b9bfa958b18953cc6174d9e50aa82dec90d9c4b","observation_id":"c59ff686-bab1-41c0-8da5-3539228d178c","resolution":{"observed_at":"2026-08-01T13:29:54.619115Z","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-01T13:29:54.679581Z","title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.679581Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:8e987e634cef3f89269649d940d225189311c42e0a179af9cc9911a365bb15f8","observation_id":"00edca19-4d1b-4e1b-b19c-c2f579afb9e6","resolution":{"observed_at":"2026-08-01T13:29:54.679581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19523","last_updated":"2024-03-07T02:45:36Z","snapshot_observed_at":"2026-07-06T15:35:45.200564Z","submitted_at":"2023-05-31T03:18:03Z","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.19523","snapshot_observed_at":"2026-08-01T13:29:54.692228Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.692228Z"},"links":{"cited_paper":"/paper/2305.19523","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:c514e4e0892480e547aebd2a28d2c1606a16eeac7abd781f31a404bc1ace09d6","observation_id":"71799542-4e9b-4a9f-8896-3d663611c3a4","resolution":{"observed_at":"2026-08-01T13:29:54.692228Z","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-01T13:29:54.742785Z","title":"Findings of the Association for Computational Linguistics: EMNLP 2024 , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.742785Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:6dc4317dc5bbaae0df4ca62ad74528fd5074ffb078d8a8352ba490ee2837e85c","observation_id":"4ad88021-3b66-4c8b-ba31-fa2cca3b2951","resolution":{"observed_at":"2026-08-01T13:29:54.742785Z","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-01T13:29:54.776588Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.776588Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:e80bec8c2c78ab213aca72fe0555d6fb86db97bfb9742e36a59bae7224a7afe7","observation_id":"7b9d8097-36de-455c-ba15-f47325ddb40f","resolution":{"observed_at":"2026-08-01T13:29:54.776588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.14080","last_updated":"2024-03-05T09:01:13Z","snapshot_observed_at":"2026-08-09T06:06:24.199391Z","submitted_at":"2019-10-30T18:47:37Z","title":"Contextual Text Denoising with Masked Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.14080","snapshot_observed_at":"2026-08-01T13:29:54.834570Z","title":"Proceedings of the 5th Workshop on Noisy User-generated Text , year=","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.834570Z"},"links":{"cited_paper":"/paper/1910.14080","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a6831a5d96949782e5aa983447eb27985f0fe5a6648efc83c8d9a92da3d1dccd","observation_id":"6268c423-a6f9-4581-8392-16098bae73e0","resolution":{"observed_at":"2026-08-01T13:29:54.834570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08206","last_updated":"2019-08-22T05:26:25Z","snapshot_observed_at":"2026-08-09T09:06:18.731619Z","submitted_at":"2019-08-22T05:26:25Z","title":"Denoising based Sequence-to-Sequence Pre-training for Text Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08206","snapshot_observed_at":"2026-08-01T13:29:54.974893Z","title":"Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing , year=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.974893Z"},"links":{"cited_paper":"/paper/1908.08206","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:55b9d1723992049742d2084155f6752f1fdd739984724461c6003e4974ae7044","observation_id":"a6793ee5-88ff-45bb-a15e-23bba9a49d1f","resolution":{"observed_at":"2026-08-01T13:29:54.974893Z","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":"10.18653/v1/w17-4414","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Text Normalisation System for Non-Standard","venue":null,"work_id":"78d654ca-d35e-4a07-8bdd-1410a4505236","year":2017},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.087948Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ba77ee115f75f6290d1e246ee4a1e7da621516db4eea94ba7ed6e0eea2e5e6be","observation_id":"ced5461c-b6bb-4bc3-80b9-1e1ef269c4e1","resolution":{"observed_at":"2026-08-01T13:33:55.064334Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-01T13:29:55.230005Z","title":"Natural Language Generation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.230005Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ed47ea296e48edc059c15ca05f09669892e79f276cd9d8ec13fb67e69351f9de","observation_id":"8482fb05-8a2e-4dab-a745-ab6e255494af","resolution":{"observed_at":"2026-08-01T13:29:55.230005Z","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-01T13:29:55.326269Z","title":"2019 , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.326269Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:d1dbfdff3f9ef249c4d01e8406a9462fa00831bdeec87c08a139bc9b102d1cd1","observation_id":"dd687a10-3355-437d-9391-7baf9fd8ec35","resolution":{"observed_at":"2026-08-01T13:29:55.326269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11945","last_updated":"2024-06-17T17:49:19Z","snapshot_observed_at":"2026-08-06T04:09:55.575646Z","submitted_at":"2024-06-17T17:49:19Z","title":"GAugLLM: Improving Graph Contrastive Learning for Text-Attributed Graphs with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11945","snapshot_observed_at":"2026-08-01T13:29:55.438619Z","title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.438619Z"},"links":{"cited_paper":"/paper/2406.11945","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:63f1e75d14420b6f4d2fa0f1be42f07df2a4d8455289e231761241b98e4c9725","observation_id":"3de31c5a-a4e6-41d9-a342-fe344cd0a598","resolution":{"observed_at":"2026-08-01T13:29:55.438619Z","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-01T13:29:55.538873Z","title":"IEEE Transactions on Neural Networks and Learning Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.538873Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:b7435d2526cd056a7ad6c99bdb3dadb6e87b69bef400ccd56759f7d43e505ddb","observation_id":"1df0f002-6388-489b-a6af-295f51f654c1","resolution":{"observed_at":"2026-08-01T13:29:55.538873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.09778","last_updated":"2023-03-17T05:20:24Z","snapshot_observed_at":"2026-08-08T22:01:42.647936Z","submitted_at":"2023-03-17T05:20:24Z","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.09778","snapshot_observed_at":"2026-08-01T13:29:55.647413Z","title":"Proceedings of the ACM Web Conference 2023 , year=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.647413Z"},"links":{"cited_paper":"/paper/2303.09778","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:329670a9b4099d6c65dde208514de4640ecd26b5a4f792c99c1d8bb4002cdb4a","observation_id":"637ac7e7-7a0b-4706-8d88-cca0bac3a94d","resolution":{"observed_at":"2026-08-01T13:29:55.647413Z","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-01T13:29:55.797541Z","title":"2022 , eprint=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.797541Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:5db049c8bb207cf8d6e13de9fca56d5368a7bcde4756616d1bc67945018dbed7","observation_id":"94e78cfb-f472-4a92-bdf0-e9757a66330d","resolution":{"observed_at":"2026-08-01T13:29:55.797541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.06367","last_updated":"2022-01-17T11:57:29Z","snapshot_observed_at":"2026-07-06T12:27:56.817457Z","submitted_at":"2022-01-17T11:57:29Z","title":"Towards Unsupervised Deep Graph Structure Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.06367","snapshot_observed_at":"2026-08-01T13:29:55.974365Z","title":"Proceedings of the ACM Web Conference 2022 , year=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:55.974365Z"},"links":{"cited_paper":"/paper/2201.06367","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:116a7ea70ac83d34f246b8ddf7157fc541d694d32948c1d8187e96006dbe0bfd","observation_id":"43d2e605-d74a-4226-87d0-80ffe0fb7125","resolution":{"observed_at":"2026-08-01T13:29:55.974365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00800","last_updated":"2023-10-01T21:50:03Z","snapshot_observed_at":"2026-07-06T16:26:13.862006Z","submitted_at":"2023-10-01T21:50:03Z","title":"GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00800","snapshot_observed_at":"2026-08-01T13:29:56.128491Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.128491Z"},"links":{"cited_paper":"/paper/2310.00800","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:8e566fe3ac7d77a443c9c39d82fd0db98c3ad9e8b9df1a14bd553bedc1c7f4d2","observation_id":"21c30b6c-36f4-46ea-b49b-cdd5070f47dc","resolution":{"observed_at":"2026-08-01T13:29:56.128491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.09612","last_updated":"2023-06-16T04:05:58Z","snapshot_observed_at":"2026-07-06T15:43:19.498986Z","submitted_at":"2023-06-16T04:05:58Z","title":"GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.09612","snapshot_observed_at":"2026-08-01T13:29:56.261064Z","title":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.261064Z"},"links":{"cited_paper":"/paper/2306.09612","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:b8f3cecba813ded0d2f38e480234ae8e86cf543f9acf3a7c651240208af0bfb5","observation_id":"7e81dd84-e729-4566-9e66-c6e4110bf7fa","resolution":{"observed_at":"2026-08-01T13:29:56.261064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.10205","last_updated":"2022-09-08T05:59:46Z","snapshot_observed_at":"2026-08-09T08:48:48.996140Z","submitted_at":"2022-08-22T11:03:36Z","title":"LTE4G: Long-Tail Experts for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.10205","snapshot_observed_at":"2026-08-01T13:29:56.395987Z","title":"Proceedings of the 31st ACM International Conference on Information and Knowledge Management , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.395987Z"},"links":{"cited_paper":"/paper/2208.10205","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:10b78499792a3cb6050c2f53f8270149456917eba470cb8e105f0b38bef0b93d","observation_id":"c563a9f4-4b01-4904-983d-e5af90ddc90d","resolution":{"observed_at":"2026-08-01T13:29:56.395987Z","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-01T13:29:56.514465Z","title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.514465Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a5d5138937eea509bb6b79975f9bec142c86ebe0e79631193f1c8c99fd9f8d71","observation_id":"92f2d833-252c-44ba-b40c-c888d6643615","resolution":{"observed_at":"2026-08-01T13:29:56.514465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.12917","last_updated":"2022-06-26T16:29:36Z","snapshot_observed_at":"2026-07-06T13:24:46.164797Z","submitted_at":"2022-06-26T16:29:36Z","title":"TAM: Topology-Aware Margin Loss for Class-Imbalanced Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.12917","snapshot_observed_at":"2026-08-01T13:29:56.675226Z","title":"International Conference on Machine Learning , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.675226Z"},"links":{"cited_paper":"/paper/2206.12917","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:2a2120506392f2101f993db14dab4ab9394620bb7e7d4f640f25bdd21e24b504","observation_id":"03ef6850-93eb-4127-94d1-4c4d38136acb","resolution":{"observed_at":"2026-08-01T13:29:56.675226Z","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-01T13:29:56.807708Z","title":"Proceedings of the 30th ACM International Conference on Multimedia , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.807708Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:a284bad6bc458861ce856cb274c2d6542d6a6d8b016c118607d6def37170523b","observation_id":"e2026d9c-3d22-4694-9093-6c59cd105b15","resolution":{"observed_at":"2026-08-01T13:29:56.807708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.01303","last_updated":"2022-04-27T21:57:05Z","snapshot_observed_at":"2026-08-05T02:22:26.423250Z","submitted_at":"2022-04-04T08:22:30Z","title":"GraFN: Semi-Supervised Node Classification on Graph with Few Labels via Non-Parametric Distribution Assignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.01303","snapshot_observed_at":"2026-08-01T13:29:56.915053Z","title":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.915053Z"},"links":{"cited_paper":"/paper/2204.01303","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:c72e54bcf930031cba5cf862c17589739dd7c0429c09d9d043ea26d85d6f4c6d","observation_id":"cacbe7d4-2b57-4252-8563-cfc50bf18820","resolution":{"observed_at":"2026-08-01T13:29:56.915053Z","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-01T13:29:56.996594Z","title":"2021 , eprint=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.996594Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:afc29d6be6d554cff50cd1e4aac142a7421b009a074bb69bcc7b696154e48206","observation_id":"dd65f05c-ccf8-42c5-adef-50e89fea23aa","resolution":{"observed_at":"2026-08-01T13:29:56.996594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.07451","last_updated":"2023-06-03T01:42:37Z","snapshot_observed_at":"2026-08-06T10:05:29.484362Z","submitted_at":"2021-06-14T14:23:08Z","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.07451","snapshot_observed_at":"2026-08-01T13:29:57.109558Z","title":"Transactions on Machine Learning Research , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.109558Z"},"links":{"cited_paper":"/paper/2106.07451","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:e7418dd442b46781259abe111ac75b8b1322c55ddf43eca0c874c2c05cca4774","observation_id":"8638cb88-1128-4501-9033-97af44ed0fbd","resolution":{"observed_at":"2026-08-01T13:29:57.109558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.06614","last_updated":"2023-02-26T04:06:24Z","snapshot_observed_at":"2026-08-07T07:46:13.511303Z","submitted_at":"2022-11-12T09:25:32Z","title":"Robust Training of Graph Neural Networks via Noise Governance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.06614","snapshot_observed_at":"2026-08-01T13:29:57.250025Z","title":"Proceedings of the 16th ACM International Conference on Web Search and Data Mining , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.250025Z"},"links":{"cited_paper":"/paper/2211.06614","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ac16ba4839dea047ae5a3a837aae8e86a1b9a66c668ede3bf4aa91e1bc3f7864","observation_id":"18c68a3e-6a3c-4289-9de8-9ec78c0bffde","resolution":{"observed_at":"2026-08-01T13:29:57.250025Z","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-01T13:29:57.375099Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.375099Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:dc12d9ecc2e1cbc0d1beee15020709f6af66a5d3e46834dac72e2d1a6f124f5d","observation_id":"09de08f3-6f8b-4ada-a8d1-8bc3aa72ab22","resolution":{"observed_at":"2026-08-01T13:29:57.375099Z","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-01T13:29:57.508577Z","title":"International Conference on Machine Learning , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.508577Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:94eabaa9e010b1fb1780cb0ab874d2ba789219abee03f0d48b69c80dca988213","observation_id":"8ac5c8f1-a760-425a-bc0a-14d24b43e3c2","resolution":{"observed_at":"2026-08-01T13:29:57.508577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-08-09T07:12:13.529182Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-01T13:29:57.675045Z","title":"arXiv preprint arXiv:2007.02901 , year=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.675045Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:db0aeb717201e0578afeedccb706b71b82ad2560d984cac1a9e9d6a92cbfb26a","observation_id":"72f0c56e-1aa7-4fd7-a8b2-79ee5de4a263","resolution":{"observed_at":"2026-08-01T13:29:57.675045Z","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-01T13:29:57.800561Z","title":"Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.800561Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:ed4b032713c20d9a1598735227468cf81eb6f543505f4ab8e67211f3238a8424","observation_id":"c44b83c2-1b25-4b42-a18a-b80c00bc7371","resolution":{"observed_at":"2026-08-01T13:29:57.800561Z","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-01T13:29:57.922395Z","title":"Advances in Neural Information Processing Systems Datasets and Benchmarks Track , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.922395Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:e4d0f5d0e69a24e15babcca5779259120c7217ed996df1fe249f3d0661d81e11","observation_id":"29ee90d3-68ee-4b97-8ace-5e3cea2e89dc","resolution":{"observed_at":"2026-08-01T13:29:57.922395Z","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-01T13:29:58.086788Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:58.086788Z"},"links":{"citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:2678822bd60b5b6a1b5a8899165859069220fa4d4d90f12ec5d8913e9255946a","observation_id":"ac7d5351-2957-4367-bd74-f87f6a932e35","resolution":{"observed_at":"2026-08-01T13:29:58.086788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":67,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":68},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 0 inbound Pith citation observations for arXiv:2607.19108."}