{"as_of":"2026-08-17T17:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce01d96d2dedc3583082e5fd80dab6284075fa6549ee06753763c538b8201f97","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:38:27.715632Z","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-07-03T23:09:01.765967Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.03681","last_updated":"2022-02-16T17:11:22Z","snapshot_observed_at":"2026-08-17T12:04:37.806489Z","submitted_at":"2022-01-10T22:44:30Z","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.03681","snapshot_observed_at":"2026-08-11T16:38:27.715632Z","title":"Loveland, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.09947","last_updated":"2024-12-13T08:11:40Z","snapshot_observed_at":"2026-08-16T16:05:05.572201Z","submitted_at":"2024-12-13T08:11:40Z","title":"Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:27.715632Z"},"links":{"cited_paper":"/paper/2201.03681","citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:ec5d82267436944371aa62ba033a80bf187591775b793eb297f7ca3f8fc1e709","observation_id":"d243dfa4-e4a9-41a4-b5c0-e6157fef8183","resolution":{"observed_at":"2026-08-11T16:38:27.715632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.03681","last_updated":"2022-02-16T17:11:22Z","snapshot_observed_at":"2026-08-17T12:04:37.806489Z","submitted_at":"2022-01-10T22:44:30Z","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.03681","snapshot_observed_at":"2026-08-03T00:05:35.216116Z","title":"Fairedit: Preserving fairness in graph neural networks through greedy graph editing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.11802","last_updated":"2026-05-29T13:06:09Z","snapshot_observed_at":"2026-08-15T14:24:01.618348Z","submitted_at":"2026-02-12T10:29:44Z","title":"Structural Bias Beyond Homophily: A Study of Fairness in Link Prediction","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T00:05:35.216116Z"},"links":{"cited_paper":"/paper/2201.03681","citing_paper":"/paper/2602.11802"},"observation_digest":"sha256:4a411f4c2d339afc3ea01e2b3a313a0cb039097fa3da64decf8ee365e55e3cd5","observation_id":"2dce9111-66c1-4643-9732-a177ec531106","resolution":{"observed_at":"2026-08-03T00:05:35.216116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.03681","last_updated":"2022-02-16T17:11:22Z","snapshot_observed_at":"2026-08-17T12:04:37.806489Z","submitted_at":"2022-01-10T22:44:30Z","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing","version":3},"cited_work":{"arxiv_id":"2201.03681","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.03681","snapshot_observed_at":"2026-07-03T23:09:01.765967Z","title":"arXiv preprint arXiv:2201.03681 , year=","venue":null,"work_id":"f4195306-131d-462e-91d7-213a14188f1f","year":null},"citing_paper":{"arxiv_id":"2606.17684","last_updated":"2026-06-16T08:50:30Z","snapshot_observed_at":"2026-08-15T21:49:34.627289Z","submitted_at":"2026-06-16T08:50:30Z","title":"Geometrical fairness in graph neural networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-26T22:48:17.726756Z"},"links":{"cited_paper":"/paper/2201.03681","citing_paper":"/paper/2606.17684"},"observation_digest":"sha256:899fb5265dfa2f45375c6688242578961ba12174e5c27157acc147e9fc8f1822","observation_id":"18e725d7-a76f-43d4-b845-dc03b8d101df","resolution":{"observed_at":"2026-07-03T23:09:01.767512Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.03681/citation-record","integrity":"/paper/2201.03681/integrity","json":"/paper/2201.03681/citation-record.json","paper":"/paper/2201.03681"},"outbound":[],"paper":{"arxiv_id":"2201.03681","last_updated":"2022-02-16T17:11:22Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T12:04:37.806489Z","submitted_at":"2022-01-10T22:44:30Z","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2201.03681."}