{"as_of":"2026-08-15T19:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:756618f38b37e18778f43ad3d81666f3d3aafeec11dde3f177020a97b647cee4","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:55:27.847877Z","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-12T05:39:23.350164Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.01820","last_updated":"2022-08-03T02:48:26Z","snapshot_observed_at":"2026-08-14T00:46:47.295333Z","submitted_at":"2022-08-03T02:48:26Z","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.01820","snapshot_observed_at":"2026-08-12T15:55:27.847877Z","title":"arXiv preprint arXiv:2208.01820 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.13821","last_updated":"2024-11-27T06:12:01Z","snapshot_observed_at":"2026-08-15T12:57:11.568080Z","submitted_at":"2024-11-21T03:59:07Z","title":"Heterophilic Graph Neural Networks Optimization with Causal Message-passing","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T15:55:27.847877Z"},"links":{"cited_paper":"/paper/2208.01820","citing_paper":"/paper/2411.13821"},"observation_digest":"sha256:83b11965bde761b12b7ce2a064c8b58a0c4abf4afbea9069aa9e1e859394d0e3","observation_id":"3e00c3dc-127d-45f8-90a4-8042543d71f5","resolution":{"observed_at":"2026-08-12T15:55:27.847877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.01820","last_updated":"2022-08-03T02:48:26Z","snapshot_observed_at":"2026-08-14T00:46:47.295333Z","submitted_at":"2022-08-03T02:48:26Z","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning","version":1},"cited_work":{"arxiv_id":"2208.01820","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.01820","snapshot_observed_at":"2026-08-12T05:39:23.350164Z","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning","venue":"cs.LG","work_id":"4f47542d-b553-4cfe-b31d-775f20e2cd4d","year":2022},"citing_paper":{"arxiv_id":"2412.00261","last_updated":"2024-11-29T21:22:35Z","snapshot_observed_at":"2026-08-14T06:59:35.085831Z","submitted_at":"2024-11-29T21:22:35Z","title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T05:39:23.318601Z"},"links":{"cited_paper":"/paper/2208.01820","citing_paper":"/paper/2412.00261"},"observation_digest":"sha256:98f75d8ed89a42bb133704932d1f01f160f4ec8b3b38a06421b6cee75b814e6c","observation_id":"1478f689-4cbb-4707-abd0-6491f483b031","resolution":{"observed_at":"2026-08-12T05:39:23.355325Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2208.01820","last_updated":"2022-08-03T02:48:26Z","snapshot_observed_at":"2026-08-14T00:46:47.295333Z","submitted_at":"2022-08-03T02:48:26Z","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.01820","snapshot_observed_at":"2026-08-02T15:19:39.854317Z","title":"arXiv preprint arXiv:2208.01820 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16198","last_updated":"2026-04-29T01:34:00Z","snapshot_observed_at":"2026-08-02T15:19:31.910815Z","submitted_at":"2026-04-29T01:34:00Z","title":"A Survey on GNN-based Link Prediction: Techniques, Applications, and Challenges","version":1},"reference_index":139,"source":"arxiv_source","source_observed_at":"2026-08-02T15:19:39.854317Z"},"links":{"cited_paper":"/paper/2208.01820","citing_paper":"/paper/2607.16198"},"observation_digest":"sha256:f7c285d008da52b0d126292e98dd3dbeda1f2dc12d73b0bdcb335654d96a0a0e","observation_id":"bb42ac7a-da96-46d1-8f67-679cd6c8ac35","resolution":{"observed_at":"2026-08-02T15:19:39.854317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.01820","last_updated":"2022-08-03T02:48:26Z","snapshot_observed_at":"2026-08-14T00:46:47.295333Z","submitted_at":"2022-08-03T02:48:26Z","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.01820","snapshot_observed_at":"2026-07-31T04:39:47.537535Z","title":"arXiv preprint arXiv:2208.01820 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28525","last_updated":"2026-07-30T17:01:20Z","snapshot_observed_at":"2026-08-15T18:26:11.871427Z","submitted_at":"2026-07-30T17:01:20Z","title":"Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors","version":1},"reference_index":190,"source":"arxiv_source","source_observed_at":"2026-07-31T04:39:47.537535Z"},"links":{"cited_paper":"/paper/2208.01820","citing_paper":"/paper/2607.28525"},"observation_digest":"sha256:c161fdf83a6e37dde6706bd8409e6264bbd78bcb3a5272c19d48d35af7fb109b","observation_id":"4645be1f-4057-4245-85ae-eace17b0dd92","resolution":{"observed_at":"2026-07-31T04:39:47.537535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2208.01820/citation-record","integrity":"/paper/2208.01820/integrity","json":"/paper/2208.01820/citation-record.json","paper":"/paper/2208.01820"},"outbound":[],"paper":{"arxiv_id":"2208.01820","last_updated":"2022-08-03T02:48:26Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T00:46:47.295333Z","submitted_at":"2022-08-03T02:48:26Z","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning"},"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 4 inbound Pith citation observations for arXiv:2208.01820."}