{"as_of":"2026-08-16T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f214fc46bc365dfdb1fc864123b7e1a04800f9edf07ab6852ade28e2ded37572","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.355044Z","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-11T16:38:28.560832Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.06017","last_updated":"2024-06-18T03:55:04Z","snapshot_observed_at":"2026-08-16T16:04:43.675828Z","submitted_at":"2024-03-09T21:33:26Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","version":2},"cited_work":{"arxiv_id":"2403.06017","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.06017","snapshot_observed_at":"2026-08-11T16:38:28.560832Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","venue":"cs.LG","work_id":"e5abdd1e-96a9-4bff-9e04-4a59c5556f1b","year":2024},"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":36,"source":"pdf_text","source_observed_at":"2026-08-11T16:38:28.176642Z"},"links":{"cited_paper":"/paper/2403.06017","citing_paper":"/paper/2412.09947"},"observation_digest":"sha256:be7e0024c55431b2a44da4db6bc86a10c5cdc8ef874a7e00ca24045f0beee493","observation_id":"99030d10-8294-4b1e-81d5-d534b74da175","resolution":{"observed_at":"2026-08-11T16:38:28.611678Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06017","last_updated":"2024-06-18T03:55:04Z","snapshot_observed_at":"2026-08-16T16:04:43.675828Z","submitted_at":"2024-03-09T21:33:26Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06017","snapshot_observed_at":"2026-08-15T21:31:25.355044Z","title":"Addressing shortcomings in fair graph learning datasets: Towards a new benchmark,","venue":null,"work_id":null,"year":2024},"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":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.355044Z"},"links":{"cited_paper":"/paper/2403.06017","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:e25f26724abefd0a04560bca94ec7b8ff1fdc1afe982df3742d5c4a9826d1b6e","observation_id":"23e613c1-a67b-40df-bc58-303e832a73b4","resolution":{"observed_at":"2026-08-15T21:31:25.355044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.06017/citation-record","integrity":"/paper/2403.06017/integrity","json":"/paper/2403.06017/citation-record.json","paper":"/paper/2403.06017"},"outbound":[],"paper":{"arxiv_id":"2403.06017","last_updated":"2024-06-18T03:55:04Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:04:43.675828Z","submitted_at":"2024-03-09T21:33:26Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark"},"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:2403.06017."}