{"as_of":"2026-08-07T16:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8b0fdc1a64a9f9db446b16c4fe8aafe6389469ab5010cf110367ebe7595df5c7","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:33:53.278064Z","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-16T05:50:40.313406Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-07T15:33:53.278064Z","title":"A survey on fairness for machine learning on graphs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-07T15:24:42.492640Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.278064Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:1861e713da8f72eec5ad11900247d4d017471845554e06e551ccb7ecb82417dd","observation_id":"8b218b09-17dd-4104-bca2-d3cc8d2ef98e","resolution":{"observed_at":"2026-08-07T15:33:53.278064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-07T13:18:21.922850Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22114","last_updated":"2025-05-28T08:41:35Z","snapshot_observed_at":"2026-08-07T13:12:33.382823Z","submitted_at":"2025-05-28T08:41:35Z","title":"BiMi Sheets: Infosheets for bias mitigation methods","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:18:21.922850Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2505.22114"},"observation_digest":"sha256:e4396208e9b1a550dc2a938919618f1528627234d95d33ca67fd7d19ba3a34c7","observation_id":"64d20e88-b0ad-4f0e-801e-117fe22e3af0","resolution":{"observed_at":"2026-08-07T13:18:21.922850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-06T20:10:40.952523Z","title":"A survey on fairness for machine learning on graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-06T20:01:24.123580Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.952523Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:826231a290ebc3b8564d80aeb4179b12945e15da7427fe241b2bdfc68c39d51d","observation_id":"997747b4-c4aa-4347-911b-606abff19e34","resolution":{"observed_at":"2026-08-06T20:10:40.952523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-06T17:08:12.874371Z","title":"A survey on fairness for machine learning on graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.874371Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:86f0c341f3cf2e3bd146ed3f914cd20efc2ad6ca267482cd2bc293d2c3f0c11e","observation_id":"15ab9774-5494-4d1c-83b4-ce7a9da81120","resolution":{"observed_at":"2026-08-06T17:08:12.874371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":"2205.05396","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on fairness for machine learning on graphs","venue":null,"work_id":"4d6e492a-2da4-4ceb-919a-be739eff2f2f","year":2022},"citing_paper":{"arxiv_id":"2604.02342","last_updated":"2026-02-08T21:18:34Z","snapshot_observed_at":"2026-07-06T22:51:44.663367Z","submitted_at":"2026-02-08T21:18:34Z","title":"Homophily-aware Supervised Contrastive Counterfactual Augmented Fair Graph Neural Network","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-16T05:47:52.655756Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2604.02342"},"observation_digest":"sha256:a08fbfaf94328ac93caf52adf3e070be8a594e22d168dde57de943f5ae7ae4d8","observation_id":"9c8a3488-500a-4653-9e9d-189947b61653","resolution":{"observed_at":"2026-05-16T05:50:40.315083Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.05396/citation-record","integrity":"/paper/2205.05396/integrity","json":"/paper/2205.05396/citation-record.json","paper":"/paper/2205.05396"},"outbound":[],"paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on 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-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 5 inbound Pith citation observations for arXiv:2205.05396."}