{"as_of":"2026-08-22T03:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48d43b25d12eb34cd651c207a1b2d5b9264bf15ff709903032b41f66979baff5","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:25:32.672853Z","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-12T07:56:35.218035Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-08-07T19:05:45.864913Z","title":"and Oh, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.10208","last_updated":"2025-02-14T15:03:43Z","snapshot_observed_at":"2026-08-16T17:08:10.858076Z","submitted_at":"2025-02-14T15:03:43Z","title":"SGS-GNN: A Supervised Graph Sparsification method for Graph Neural Networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T19:05:45.864913Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2502.10208"},"observation_digest":"sha256:afc5bd9d18bfce4617a79ec56af803e62a71f186ffc16f41b9a2a91f183bfda6","observation_id":"b1c38bd9-a411-4dfe-8ce6-ba176f6d2b01","resolution":{"observed_at":"2026-08-07T19:05:45.864913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-08-16T05:25:32.672853Z","title":"How to Find Your Friendly N eighborhood: Graph Attention Design with Self-Supervision,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.20744","last_updated":"2025-04-29T13:24:37Z","snapshot_observed_at":"2026-08-21T15:16:15.953684Z","submitted_at":"2025-04-29T13:24:37Z","title":"DB-GNN: Dual-Branch Graph Neural Network with Multi-Level Contrastive Learning for Jointly Identifying Within- and Cross-Frequency Coupled Brain Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T05:25:32.672853Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2504.20744"},"observation_digest":"sha256:5de5d6990b6141d83201fd271c175cd6a203b4eebfed4891525107d646b661a7","observation_id":"eca92a60-9de2-4eda-b773-b8453e683cfc","resolution":{"observed_at":"2026-08-16T05:25:32.672853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-08-16T05:16:13.613581Z","title":"How to find your friendly neighborhood: Graph attention design with self-supervision","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.613581Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:d791dede061eee3844b9c426ffe8d573a88bb95c20cf8c316420a8cfb7abf515","observation_id":"b108c3e2-29a0-41b2-bddf-156972c54fea","resolution":{"observed_at":"2026-08-16T05:16:13.613581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":"2204.04879","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Oh, A","venue":null,"work_id":"b96011c5-d51a-4607-8418-50f5f7b41aae","year":2022},"citing_paper":{"arxiv_id":"2604.07383","last_updated":"2026-05-08T22:00:25Z","snapshot_observed_at":"2026-08-11T13:56:04.068458Z","submitted_at":"2026-04-08T02:42:55Z","title":"SCOT: Multi-Source Cross-City Transfer with Optimal-Transport Soft-Correspondence Objective","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T18:48:32.793783Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2604.07383"},"observation_digest":"sha256:b9cc4126f9cee319d843d657a7a84ebb0a4ad48221ae7dd1a98f3be92bbdfa5a","observation_id":"713b9752-3edc-4505-8aa7-02d65cb27d7c","resolution":{"observed_at":"2026-05-10T23:55:50.590679Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":"2204.04879","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Oh, A","venue":null,"work_id":"b96011c5-d51a-4607-8418-50f5f7b41aae","year":2022},"citing_paper":{"arxiv_id":"2604.07383","last_updated":"2026-05-08T22:00:25Z","snapshot_observed_at":"2026-08-11T13:56:04.068458Z","submitted_at":"2026-04-08T02:42:55Z","title":"SCOT: Multi-Source Cross-City Transfer with Optimal-Transport Soft-Correspondence Objective","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T01:27:24.613788Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2604.07383"},"observation_digest":"sha256:4822d429605f79af5f6cdc093500cbf913be3ad1758892e678de3600902ebd4d","observation_id":"a9487b75-c848-436c-856d-5ec89a7f6ba7","resolution":{"observed_at":"2026-05-12T07:56:35.299403Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":"2204.04879","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Oh, A","venue":null,"work_id":"b96011c5-d51a-4607-8418-50f5f7b41aae","year":2022},"citing_paper":{"arxiv_id":"2604.20082","last_updated":"2026-04-22T00:57:06Z","snapshot_observed_at":"2026-08-17T01:17:40.635765Z","submitted_at":"2026-04-22T00:57:06Z","title":"Concept Graph Convolutions: Message Passing in the Concept Space","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T00:16:59.207965Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2604.20082"},"observation_digest":"sha256:fdf7e3b8cb1375ace0118ed43e439b29b59b1cab1131c114812c2a50983c2382","observation_id":"e3649777-f032-436e-916d-01231469fc1d","resolution":{"observed_at":"2026-05-10T00:19:46.928582Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2204.04879/citation-record","integrity":"/paper/2204.04879/integrity","json":"/paper/2204.04879/citation-record.json","paper":"/paper/2204.04879"},"outbound":[],"paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2204.04879."}