{"as_of":"2026-08-08T03:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b910a501fb74035cbcb164952788fb87da8be702e1a4e0951e6c60b0c99b4da9","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-07T11:25:07.489809Z","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-23T06:27:38.201497Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.03365","last_updated":"2025-08-05T10:31:51Z","snapshot_observed_at":"2026-08-05T17:38:45.921309Z","submitted_at":"2024-01-31T11:03:58Z","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":"2402.03365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03365","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Heterophily-aware fair recommendation using graph convolu- tional networks","venue":null,"work_id":"207d6ef2-1fd2-4f51-b063-b21c32d462aa","year":2024},"citing_paper":{"arxiv_id":"2502.15699","last_updated":"2026-04-28T16:56:51Z","snapshot_observed_at":"2026-07-06T20:40:39.302105Z","submitted_at":"2025-01-06T07:31:52Z","title":"Disentangling Popularity and Quality: An Edge Classification Approach for Fair Recommendation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T06:26:11.248543Z"},"links":{"cited_paper":"/paper/2402.03365","citing_paper":"/paper/2502.15699"},"observation_digest":"sha256:a3f231d41035c8358cdafeaddf0f129775a33e74c521187cfabf0b17bedb506b","observation_id":"2d0aa3a1-187e-4d6c-91d8-1b4efd3f6892","resolution":{"observed_at":"2026-05-23T06:27:38.205860Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03365","last_updated":"2025-08-05T10:31:51Z","snapshot_observed_at":"2026-08-05T17:38:45.921309Z","submitted_at":"2024-01-31T11:03:58Z","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":"2402.03365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03365","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Heterophily-aware fair recommendation using graph convolu- tional networks","venue":null,"work_id":"207d6ef2-1fd2-4f51-b063-b21c32d462aa","year":2024},"citing_paper":{"arxiv_id":"2504.13614","last_updated":"2026-05-05T15:56:15Z","snapshot_observed_at":"2026-07-06T21:11:24.852957Z","submitted_at":"2025-04-18T10:42:16Z","title":"Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T19:24:48.300461Z"},"links":{"cited_paper":"/paper/2402.03365","citing_paper":"/paper/2504.13614"},"observation_digest":"sha256:fbc4190e93f9d3033f4745cd4b4676bc6897e83347d45fa027128fac006120e7","observation_id":"64d7e8b0-7646-4ed6-bc8d-6bb296e0e6fd","resolution":{"observed_at":"2026-05-22T19:25:03.720322Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03365","last_updated":"2025-08-05T10:31:51Z","snapshot_observed_at":"2026-08-05T17:38:45.921309Z","submitted_at":"2024-01-31T11:03:58Z","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03365","snapshot_observed_at":"2026-08-07T04:24:55.245368Z","title":"Heterophily-aware fair recommendation using graph convolutional networks.CoRR, abs/2402.03365, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10658","last_updated":"2025-06-12T12:47:35Z","snapshot_observed_at":"2026-08-07T15:18:52.318803Z","submitted_at":"2025-06-12T12:47:35Z","title":"Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:55.245368Z"},"links":{"cited_paper":"/paper/2402.03365","citing_paper":"/paper/2506.10658"},"observation_digest":"sha256:d8dd9079057f7654f71bf3b7bf4fb31985108cb3c6cfbe3a0752845c5c9c0919","observation_id":"55e6777e-9113-4361-8878-d10b824f74ca","resolution":{"observed_at":"2026-08-07T04:24:55.245368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03365","last_updated":"2025-08-05T10:31:51Z","snapshot_observed_at":"2026-08-05T17:38:45.921309Z","submitted_at":"2024-01-31T11:03:58Z","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03365","snapshot_observed_at":"2026-08-07T11:25:07.489809Z","title":"Gholinejad, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17234","last_updated":"2025-06-03T07:28:02Z","snapshot_observed_at":"2026-08-07T11:19:37.498404Z","submitted_at":"2025-06-03T07:28:02Z","title":"Graph Neural Networks in Multi-Omics Cancer Research: A Structured Survey","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:07.489809Z"},"links":{"cited_paper":"/paper/2402.03365","citing_paper":"/paper/2506.17234"},"observation_digest":"sha256:3d3d4f3a8d1953cf00cd6b6a4d746ce22f4a689fb139bb7fae158f5a0667547c","observation_id":"a6a9b322-6846-45b3-9cd8-6321ebd51dd3","resolution":{"observed_at":"2026-08-07T11:25:07.489809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03365","last_updated":"2025-08-05T10:31:51Z","snapshot_observed_at":"2026-08-05T17:38:45.921309Z","submitted_at":"2024-01-31T11:03:58Z","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":"2402.03365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03365","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Heterophily-aware fair recommendation using graph convolu- tional networks","venue":null,"work_id":"207d6ef2-1fd2-4f51-b063-b21c32d462aa","year":2024},"citing_paper":{"arxiv_id":"2507.19067","last_updated":"2026-04-29T09:13:38Z","snapshot_observed_at":"2026-08-02T06:49:42.703606Z","submitted_at":"2025-07-25T08:29:32Z","title":"PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-19T02:57:27.702617Z"},"links":{"cited_paper":"/paper/2402.03365","citing_paper":"/paper/2507.19067"},"observation_digest":"sha256:689438f4deb5e0d0fef44095181c0ba530fb6622b1ad96d1c552cc01e4ebe304","observation_id":"0202c616-bbfd-49e6-88cc-bd22630602dd","resolution":{"observed_at":"2026-05-19T03:02:00.727068Z","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/2402.03365/citation-record","integrity":"/paper/2402.03365/integrity","json":"/paper/2402.03365/citation-record.json","paper":"/paper/2402.03365"},"outbound":[],"paper":{"arxiv_id":"2402.03365","last_updated":"2025-08-05T10:31:51Z","latest_version":4,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-05T17:38:45.921309Z","submitted_at":"2024-01-31T11:03:58Z","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2402.03365."}