{"as_of":"2026-08-13T01:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:835c6b38a40fc5c1012d77f5aa6c1153756da19b07a5f3858ce2e5612a44407d","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-12T06:34:41.77262+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-10T22:53:26.760312Z","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-10T22:53:27.192551Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.08549","last_updated":"2022-01-21T05:49:15Z","snapshot_observed_at":"2026-08-12T13:57:29.302647Z","submitted_at":"2022-01-21T05:49:15Z","title":"Fair Node Representation Learning via Adaptive Data Augmentation","version":1},"cited_work":{"arxiv_id":"2201.08549","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.08549","snapshot_observed_at":"2026-08-10T22:53:27.192551Z","title":"Fair Node Representation Learning via Adaptive Data Augmentation","venue":"cs.LG","work_id":"8b556df2-9433-4f5d-b3f5-4596bc89015c","year":2022},"citing_paper":{"arxiv_id":"2501.00595","last_updated":"2024-12-31T18:48:30Z","snapshot_observed_at":"2026-08-12T13:04:40.137406Z","submitted_at":"2024-12-31T18:48:30Z","title":"Unbiased GNN Learning via Fairness-Aware Subgraph Diffusion","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:53:26.760312Z"},"links":{"cited_paper":"/paper/2201.08549","citing_paper":"/paper/2501.00595"},"observation_digest":"sha256:a000ccd94615a04cb23762b3a331805b63becf1ab4fbffb8a0b06fab9f23de8f","observation_id":"3fb5ec37-8fc0-4040-9e05-89dae682db82","resolution":{"observed_at":"2026-08-10T22:53:27.198845Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.08549/citation-record","integrity":"/paper/2201.08549/integrity","json":"/paper/2201.08549/citation-record.json","paper":"/paper/2201.08549"},"outbound":[],"paper":{"arxiv_id":"2201.08549","last_updated":"2022-01-21T05:49:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:57:29.302647Z","submitted_at":"2022-01-21T05:49:15Z","title":"Fair Node Representation Learning via Adaptive Data Augmentation"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2201.08549."}