{"as_of":"2026-08-22T00:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e5fe02b44f05bccc11d0ff5246bf01fe6e22cbcfae051f61ea4d4088f9702f3f","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:53:26.108683Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T01:03:58.850729Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.09891","last_updated":"2022-03-29T07:06:47Z","snapshot_observed_at":"2026-08-16T19:12:16.624565Z","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-16T05:53:26.108683Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20117","last_updated":"2025-05-03T16:45:38Z","snapshot_observed_at":"2026-08-18T05:20:49.374811Z","submitted_at":"2025-04-28T07:18:45Z","title":"ResearchCodeAgent: An LLM Multi-Agent System for Automated Codification of Research Methodologies","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T05:53:26.108683Z"},"links":{"cited_paper":"/paper/2010.09891","citing_paper":"/paper/2504.20117"},"observation_digest":"sha256:14b6691ecb7992e894831a074cad2232c941de489ec072c2181db7ae58fd436f","observation_id":"f1296b65-9ba9-42a8-abe2-cdb02cb7f513","resolution":{"observed_at":"2026-08-16T05:53:26.108683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09891","last_updated":"2022-03-29T07:06:47Z","snapshot_observed_at":"2026-08-16T19:12:16.624565Z","submitted_at":"2020-10-19T21:51:47Z","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","version":3},"cited_work":{"arxiv_id":"2010.09891","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.09891","snapshot_observed_at":"2026-08-07T01:03:58.850729Z","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","venue":"cs.LG","work_id":"1ba1bb2a-3eef-48a9-b095-a4263553fdaf","year":2020},"citing_paper":{"arxiv_id":"2506.12226","last_updated":"2025-06-13T21:03:49Z","snapshot_observed_at":"2026-08-13T16:48:11.025073Z","submitted_at":"2025-06-13T21:03:49Z","title":"Learning Causality for Modern Machine Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:49.673048Z"},"links":{"cited_paper":"/paper/2010.09891","citing_paper":"/paper/2506.12226"},"observation_digest":"sha256:9183efcc79efba5d76e289912e97499839a4cfdc383e5dfe8d79b30485bd3ba2","observation_id":"87faa61f-fcad-477d-8de7-37411e14ec3f","resolution":{"observed_at":"2026-08-07T01:03:58.969026Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09891","last_updated":"2022-03-29T07:06:47Z","snapshot_observed_at":"2026-08-16T19:12:16.624565Z","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-15T20:07:41.048876Z","title":"Flag: Adversarial data augmentation for graph neural networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.13344","last_updated":"2025-06-16T10:35:32Z","snapshot_observed_at":"2026-08-15T20:02:01.274062Z","submitted_at":"2025-06-16T10:35:32Z","title":"LapDDPM: A Conditional Graph Diffusion Model for scRNA-seq Generation with Spectral Adversarial Perturbations","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T20:07:41.048876Z"},"links":{"cited_paper":"/paper/2010.09891","citing_paper":"/paper/2506.13344"},"observation_digest":"sha256:9f971ce6640d162dde96689d91b36584fad17caa37929a4c0ac7b9eb0304a1a9","observation_id":"1e4f766d-e942-4b62-9896-d77ecf703004","resolution":{"observed_at":"2026-08-15T20:07:41.048876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09891","last_updated":"2022-03-29T07:06:47Z","snapshot_observed_at":"2026-08-16T19:12:16.624565Z","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-10T13:22:32.111902Z","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:46cb593774ece16349b28fd4705761b7a793ad93801adb6d9ee9ba18b4ce39e9","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-08-16T19:12:16.624565Z","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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2010.09891."}