{"as_of":"2026-08-15T19:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3d11b3bdee4630f38281f254242335b6ff40ec075dcf934f44c6f3635757aa0","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-15T06:32:42.880941+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:43:12.531700Z","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-04T08:39:42.421001Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.09769","last_updated":"2024-09-30T05:56:58Z","snapshot_observed_at":"2026-08-13T04:40:06.944390Z","submitted_at":"2024-01-18T07:36:38Z","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09769","snapshot_observed_at":"2026-08-07T15:43:12.531700Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14033","last_updated":"2025-05-22T05:47:24Z","snapshot_observed_at":"2026-08-13T22:21:46.253958Z","submitted_at":"2025-05-20T07:30:45Z","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:12.531700Z"},"links":{"cited_paper":"/paper/2401.09769","citing_paper":"/paper/2505.14033"},"observation_digest":"sha256:880ef902a6be37a8b6f82119ed74f859d51966cba7e48edad06547195d72fd29","observation_id":"0e188a22-b3cc-4ab2-a292-eedb32a023cd","resolution":{"observed_at":"2026-08-07T15:43:12.531700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09769","last_updated":"2024-09-30T05:56:58Z","snapshot_observed_at":"2026-08-13T04:40:06.944390Z","submitted_at":"2024-01-18T07:36:38Z","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09769","snapshot_observed_at":"2026-08-05T16:00:51.569270Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19071","last_updated":"2025-08-28T09:15:01Z","snapshot_observed_at":"2026-08-14T02:04:40.658006Z","submitted_at":"2025-08-26T14:28:31Z","title":"Dynamic Triangulation-Based Graph Rewiring for Graph Neural Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T16:00:51.569270Z"},"links":{"cited_paper":"/paper/2401.09769","citing_paper":"/paper/2508.19071"},"observation_digest":"sha256:8565fdfa4ed552efe6e22505c23ba0a2ca2e564dc264e1244c86eeb7f1969c9e","observation_id":"df6ad198-2fe1-4360-a5a0-6017d18448f0","resolution":{"observed_at":"2026-08-05T16:00:51.569270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09769","last_updated":"2024-09-30T05:56:58Z","snapshot_observed_at":"2026-08-13T04:40:06.944390Z","submitted_at":"2024-01-18T07:36:38Z","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","version":4},"cited_work":{"arxiv_id":"2401.09769","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.09769","snapshot_observed_at":"2026-07-04T08:39:42.421001Z","title":null,"venue":null,"work_id":"57060264-b236-40f6-a517-01da9de38393","year":2024},"citing_paper":{"arxiv_id":"2606.22180","last_updated":"2026-07-01T14:51:03Z","snapshot_observed_at":"2026-08-07T13:14:40.368155Z","submitted_at":"2026-06-20T18:21:15Z","title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T11:08:42.798812Z"},"links":{"cited_paper":"/paper/2401.09769","citing_paper":"/paper/2606.22180"},"observation_digest":"sha256:cab787e5c29671d5c5e15bc847db6a81d4a8a81f7e5b7db8c6f8a0316354a8d9","observation_id":"4225f3ea-168a-4d4f-b6d6-0dd2b9593eec","resolution":{"observed_at":"2026-07-04T08:39:42.422650Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09769","last_updated":"2024-09-30T05:56:58Z","snapshot_observed_at":"2026-08-13T04:40:06.944390Z","submitted_at":"2024-01-18T07:36:38Z","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","version":4},"cited_work":{"arxiv_id":"2401.09769","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.09769","snapshot_observed_at":"2026-07-04T08:39:42.421001Z","title":null,"venue":null,"work_id":"57060264-b236-40f6-a517-01da9de38393","year":2024},"citing_paper":{"arxiv_id":"2606.22180","last_updated":"2026-07-01T14:51:03Z","snapshot_observed_at":"2026-08-07T13:14:40.368155Z","submitted_at":"2026-06-20T18:21:15Z","title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-02T21:54:14.675992Z"},"links":{"cited_paper":"/paper/2401.09769","citing_paper":"/paper/2606.22180"},"observation_digest":"sha256:ebaeca3435b8cf4a7fc019401dc89285501638a6390af7454dd16c44cbccfa28","observation_id":"c6ec29dc-c49e-4c19-a0c9-fa19e6aeb255","resolution":{"observed_at":"2026-07-02T21:57:25.486735Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09769","last_updated":"2024-09-30T05:56:58Z","snapshot_observed_at":"2026-08-13T04:40:06.944390Z","submitted_at":"2024-01-18T07:36:38Z","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09769","snapshot_observed_at":"2026-08-01T06:31:21.258312Z","title":"Learning from graphs with heterophily: Progress and future, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21885","last_updated":"2026-07-24T01:29:28Z","snapshot_observed_at":"2026-08-15T09:05:17.028182Z","submitted_at":"2026-07-24T01:29:28Z","title":"Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T06:31:21.258312Z"},"links":{"cited_paper":"/paper/2401.09769","citing_paper":"/paper/2607.21885"},"observation_digest":"sha256:b167662870eadc725487a8aa978c2e8b7551cc0c2f177a38cec5cc7c010158be","observation_id":"40037a1a-69f8-4399-b7a1-ee854666abce","resolution":{"observed_at":"2026-08-01T06:31:21.258312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.09769/citation-record","integrity":"/paper/2401.09769/integrity","json":"/paper/2401.09769/citation-record.json","paper":"/paper/2401.09769"},"outbound":[],"paper":{"arxiv_id":"2401.09769","last_updated":"2024-09-30T05:56:58Z","latest_version":4,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-13T04:40:06.944390Z","submitted_at":"2024-01-18T07:36:38Z","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2401.09769."}