{"as_of":"2026-08-16T23:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0c66e3adb237ae3e2fb2fdbc36893e4f9fcb6a7a0a0d643385e02f6d4a5f667","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-16T06:30:59.297886+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-15T21:31:25.348213Z","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-14T20:52:58.927860Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.04187","last_updated":"2022-02-08T23:00:26Z","snapshot_observed_at":"2026-08-16T17:22:40.730814Z","submitted_at":"2022-02-08T23:00:26Z","title":"FMP: Toward Fair Graph Message Passing against Topology Bias","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.04187","snapshot_observed_at":"2026-08-15T21:31:25.348213Z","title":"Fmp: Toward fair graph message passing against topology bias,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.348213Z"},"links":{"cited_paper":"/paper/2202.04187","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:178486c066d06f9bf2b9c597de7ad3db233806c89c4084f3b00b7d5f1a198ca7","observation_id":"d60ec492-d37c-4792-93a2-9551f0aa4995","resolution":{"observed_at":"2026-08-15T21:31:25.348213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.04187","last_updated":"2022-02-08T23:00:26Z","snapshot_observed_at":"2026-08-16T17:22:40.730814Z","submitted_at":"2022-02-08T23:00:26Z","title":"FMP: Toward Fair Graph Message Passing against Topology Bias","version":1},"cited_work":{"arxiv_id":"2202.04187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.04187","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.04187 , year=","venue":null,"work_id":"e81e1459-b4e3-410d-b09f-3c1a9c65d268","year":null},"citing_paper":{"arxiv_id":"2605.12701","last_updated":"2026-05-12T19:54:25Z","snapshot_observed_at":"2026-08-15T03:04:08.909371Z","submitted_at":"2026-05-12T19:54:25Z","title":"Do Fair Models Reason Fairly? Counterfactual Explanation Consistency for Procedural Fairness in Credit Decisions","version":1},"reference_index":295,"source":"arxiv_source","source_observed_at":"2026-05-14T20:50:02.096278Z"},"links":{"cited_paper":"/paper/2202.04187","citing_paper":"/paper/2605.12701"},"observation_digest":"sha256:7f62453a4d7284d40335982249d565e60fdf576a79b37c6a5af565e7b58f1f99","observation_id":"afb177a6-8cc5-47ef-b4df-ba4da16b5304","resolution":{"observed_at":"2026-05-14T20:52:58.930641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.04187/citation-record","integrity":"/paper/2202.04187/integrity","json":"/paper/2202.04187/citation-record.json","paper":"/paper/2202.04187"},"outbound":[],"paper":{"arxiv_id":"2202.04187","last_updated":"2022-02-08T23:00:26Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:22:40.730814Z","submitted_at":"2022-02-08T23:00:26Z","title":"FMP: Toward Fair Graph Message Passing against Topology Bias"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2202.04187."}