{"as_of":"2026-08-06T08:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf74379844bc5cff22f8954a5f6f586cbf6adb7e867d6318882d390c667d3919","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:29:52.157856Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T08:46:07.754457Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.08685","last_updated":"2024-12-24T07:08:45Z","snapshot_observed_at":"2026-07-06T19:01:32.237848Z","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":"2408.08685","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.08685","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0b44489c-b921-453a-b0a5-eee69768401f","year":2024},"citing_paper":{"arxiv_id":"2510.08952","last_updated":"2026-05-05T05:35:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-10T02:59:19Z","title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-18T08:45:51.992431Z"},"links":{"cited_paper":"/paper/2408.08685","citing_paper":"/paper/2510.08952"},"observation_digest":"sha256:45b97b92d9c59a164e60d442b14ff9fa395b5c0e2b28e1c9f6a1489ab1e1caec","observation_id":"dfee304a-4a96-442e-ac52-77f96e837a12","resolution":{"observed_at":"2026-05-18T08:46:07.757046Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08685","last_updated":"2024-12-24T07:08:45Z","snapshot_observed_at":"2026-07-06T19:01:32.237848Z","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-03T02:15:00.058583Z","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:b07cede16386df5ef36c034dbba053761213e2fa911114242785fd47ba6136b7","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"}}],"links":{"evidence":"/evidence","html":"/paper/2408.08685/citation-record","integrity":"/paper/2408.08685/integrity","json":"/paper/2408.08685/citation-record.json","paper":"/paper/2408.08685"},"outbound":[],"paper":{"arxiv_id":"2408.08685","last_updated":"2024-12-24T07:08:45Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:01:32.237848Z","submitted_at":"2024-08-16T11:58:34Z","title":"Can Large Language Models Improve the Adversarial Robustness of Graph Neural Networks?"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.08685."}