{"as_of":"2026-08-06T16:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a488e8806549a3917348f74138767a6da478926d28fbda746bd1da5c03b9bca9","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:30:11.471492Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2010.09891","last_updated":"2022-03-29T07:06:47Z","snapshot_observed_at":"2026-07-06T10:05:59.736442Z","submitted_at":"2020-10-19T21:51:47Z","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.09891","snapshot_observed_at":"2026-08-02T21:30:11.471492Z","title":"Flag: Adversarial data augmentation for graph neural networks.arXiv preprint arXiv:2010.09891,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.20019","last_updated":"2026-05-29T19:12:14Z","snapshot_observed_at":"2026-08-06T11:29:43.817952Z","submitted_at":"2026-02-23T16:25:35Z","title":"Learning Discriminative and Generalizable Anomaly Detector for Dynamic Graph with Limited Supervision","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T21:30:11.471492Z"},"links":{"cited_paper":"/paper/2010.09891","citing_paper":"/paper/2602.20019"},"observation_digest":"sha256:31dffacf9842645fd44884e959828c7493d78595e0248352a9cb5d699e006c6a","observation_id":"1f904fc5-304b-42a2-810c-9f3613e8635b","resolution":{"observed_at":"2026-08-02T21:30:11.471492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2010.09891/citation-record","integrity":"/paper/2010.09891/integrity","json":"/paper/2010.09891/citation-record.json","paper":"/paper/2010.09891"},"outbound":[],"paper":{"arxiv_id":"2010.09891","last_updated":"2022-03-29T07:06:47Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:05:59.736442Z","submitted_at":"2020-10-19T21:51:47Z","title":"Robust Optimization as Data Augmentation for Large-scale Graphs"},"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 1 inbound Pith citation observation for arXiv:2010.09891."}