{"as_of":"2026-08-07T17:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a90133372036136c393b3aeca2919a00b5a1bb8ad223a9cea21130a72435ae80","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-07T06:34:17.273281+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-04T07:55:01.106487Z","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":"2508.14683","last_updated":"2025-08-20T12:59:05Z","snapshot_observed_at":"2026-08-05T18:23:39.727386Z","submitted_at":"2025-08-20T12:59:05Z","title":"Improving Fairness in Graph Neural Networks via Counterfactual Debiasing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.14683","snapshot_observed_at":"2026-08-04T07:55:01.106487Z","title":"Improving fairness in graph neural networks via counterfactual debiasing.arXiv preprint arXiv:2508.14683,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.23469","last_updated":"2026-06-02T15:31:54Z","snapshot_observed_at":"2026-08-06T03:58:50.690228Z","submitted_at":"2025-10-27T16:07:36Z","title":"Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T07:55:01.106487Z"},"links":{"cited_paper":"/paper/2508.14683","citing_paper":"/paper/2510.23469"},"observation_digest":"sha256:feabe5f62850bac117bc1c72f7aa6cb6655dd7b0ebc12b80d89afc3c4eae1dd4","observation_id":"e1477338-4ce6-4356-bb85-2f8019800dec","resolution":{"observed_at":"2026-08-04T07:55:01.106487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14683/citation-record","integrity":"/paper/2508.14683/integrity","json":"/paper/2508.14683/citation-record.json","paper":"/paper/2508.14683"},"outbound":[],"paper":{"arxiv_id":"2508.14683","last_updated":"2025-08-20T12:59:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T18:23:39.727386Z","submitted_at":"2025-08-20T12:59:05Z","title":"Improving Fairness in Graph Neural Networks via Counterfactual Debiasing"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2508.14683."}