{"as_of":"2026-08-15T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8a10fc75a3d78241d0a19c600ad4b4aa6404ed895c5c0cf39faa7cc094520e77","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:51:16.308913Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.16144/citation-record","integrity":"/paper/2412.16144/integrity","json":"/paper/2412.16144/citation-record.json","paper":"/paper/2412.16144"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.089312Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.089312Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:bc1096c363de30e3fe437429cccef0f040e28b9d4cc0a7cc59ec32a00915bb3b","observation_id":"f4f20dc9-d7c6-4e19-adde-407d72b47b8c","resolution":{"observed_at":"2026-08-11T10:51:16.089312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.095011Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.095011Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:a0f7f1e59bc3bc8188e5fd244f6c3d408a5cb1a042311ded55b98bfb80af1e0b","observation_id":"f86659fd-c101-4ae1-9edc-416ba7cf83a1","resolution":{"observed_at":"2026-08-11T10:51:16.095011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.924767Z","title":null,"venue":null,"work_id":"ea22f15e-26e8-4cbf-b763-cff8a7ff942c","year":2016},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.098984Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:5d60ec18e965d7ded1343267c4c0affa2fcc67b201b2bca5d7d785bc6cb0193e","observation_id":"9f7145f7-9908-4fed-af52-3e02bf92199b","resolution":{"observed_at":"2026-08-11T10:51:16.928060Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.915192Z","title":"B.; Patel, S.; Ramage, D.; Segal, A.; and Seth, K","venue":null,"work_id":"f08fe979-0dec-4d7f-aa52-e9aa61640f24","year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.102412Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:05b68886b3e2b2477ebd17d6f8e4aac0feacd06f91941274d62072338d2f1b5e","observation_id":"57f807e3-e4ef-4ed9-90a5-66a7ff9aaa95","resolution":{"observed_at":"2026-08-11T10:51:16.918815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.905680Z","title":null,"venue":null,"work_id":"8624d090-601a-4bab-9512-fece24d2329e","year":2011},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.105884Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:32f66ac196f3213faa6ed15ac30d44791374f28470541f6de983add8978f39d7","observation_id":"cb0d2c39-3820-499a-9531-9c19c2b9cc34","resolution":{"observed_at":"2026-08-11T10:51:16.909106Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14491","snapshot_observed_at":"2026-08-11T10:51:16.109470Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.109470Z"},"links":{"cited_paper":"/paper/2105.14491","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:1af857200357cf43fd6d2a9415af47b6fb7ae5a3bd4b6407c4b3335f3578985c","observation_id":"a0e440e7-ad0d-45d1-b635-922e5252dce1","resolution":{"observed_at":"2026-08-11T10:51:16.109470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-08-12T23:06:05.148534Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-11T10:51:16.113665Z","title":"M.; Bruna, J.; Cohen, T.; and Veličković, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.113665Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:2b69516edb13f1aa2608bd9550847894b4ab46d2998b407be1ad3ba9e76b7529","observation_id":"6b68cd74-0626-4360-a51e-64bfea8a4a69","resolution":{"observed_at":"2026-08-11T10:51:16.113665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.895790Z","title":"M.; Bruna, J.; LeCun, Y.; Szlam, A.; and Vandergheynst, P","venue":null,"work_id":"c608d1eb-8835-4ae9-bac9-59e5047da96a","year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.117584Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:ab2b8965781fe857d5cd4be7afe0ad17c8fa35051cf552aafaf45a5708af8296","observation_id":"8ed86c85-88ad-4a0e-8e04-6ceb7d4d10f9","resolution":{"observed_at":"2026-08-11T10:51:16.899836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2105.03170","last_updated":"2021-05-07T11:27:23Z","snapshot_observed_at":"2026-08-14T13:17:40.072747Z","submitted_at":"2021-05-07T11:27:23Z","title":"FedGL: Federated Graph Learning Framework with Global Self-Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.03170","snapshot_observed_at":"2026-08-11T10:51:16.121285Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.121285Z"},"links":{"cited_paper":"/paper/2105.03170","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:c57563280b1c9d9bbfe852b050d248c05f59613a5e872d5009345062e2b9da43","observation_id":"1c29477f-2d31-4394-a460-4555c2f1735d","resolution":{"observed_at":"2026-08-11T10:51:16.121285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.01370","last_updated":"2021-11-02T04:58:03Z","snapshot_observed_at":"2026-08-13T22:52:58.719107Z","submitted_at":"2021-11-02T04:58:03Z","title":"FedGraph: Federated Graph Learning with Intelligent Sampling","version":1},"cited_work":{"arxiv_id":"2111.01370","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.01370","snapshot_observed_at":"2026-08-11T10:51:16.622833Z","title":"FedGraph: Federated Graph Learning with Intelligent Sampling","venue":"cs.LG","work_id":"508346bd-6460-4c49-ba7a-7babd5653fbe","year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.125178Z"},"links":{"cited_paper":"/paper/2111.01370","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:5d75203552a1326cf1177a59e8c2fbe5e4ee0230f432462edc9b68829323a46f","observation_id":"50e3f239-8c77-4541-a534-c71bd44dec43","resolution":{"observed_at":"2026-08-11T10:51:16.626942Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.885907Z","title":null,"venue":null,"work_id":"fe656686-59b4-4ec0-8c8d-75760f8613b8","year":2022},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.129072Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:d765caa24490f77c0077b8d58b5aebff0f2bdcc95f74e782b1f296e24165a5a4","observation_id":"f6590624-0a01-4195-bfe7-c2f8edf0dbe2","resolution":{"observed_at":"2026-08-11T10:51:16.889409Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.876042Z","title":null,"venue":null,"work_id":"b589e843-04df-419d-8f5f-87c88eca5b19","year":1953},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.132444Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:96090b1103ba223492c1812b57b809c7fec478f28cfd3398090106eed8938312","observation_id":"dccb0d63-9d5a-418f-a4d9-463b37d13724","resolution":{"observed_at":"2026-08-11T10:51:16.879722Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2003.13461","last_updated":"2020-11-06T04:07:31Z","snapshot_observed_at":"2026-08-02T16:42:32.296692Z","submitted_at":"2020-03-30T13:19:37Z","title":"Adaptive Personalized Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.13461","snapshot_observed_at":"2026-08-11T10:51:16.135599Z","title":"M.; and Mahdavi, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.135599Z"},"links":{"cited_paper":"/paper/2003.13461","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:d579b0c0d9b3370266b63a87e493f76180a65fb3b1b7bd9e05f785e80066bf76","observation_id":"bc81ad5a-0916-460b-b6e7-f2461c131158","resolution":{"observed_at":"2026-08-11T10:51:16.135599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.866128Z","title":null,"venue":null,"work_id":"917de6ea-0e78-4cb2-8d98-898fd66ba614","year":1963},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.139355Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:496f6b1708f05cce8261e285c5a050b8465140188af0e93ad14a1f85f712eaf9","observation_id":"534a1f8b-84cc-4ae5-9247-85531171df6d","resolution":{"observed_at":"2026-08-11T10:51:16.869996Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1712.06038","last_updated":"2017-12-17T00:54:54Z","snapshot_observed_at":"2026-08-15T01:15:11.601599Z","submitted_at":"2017-12-17T00:54:54Z","title":"The proximal point method revisited","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.06038","snapshot_observed_at":"2026-08-11T10:51:16.142630Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.142630Z"},"links":{"cited_paper":"/paper/1712.06038","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:5476ea60caa92bbc016709fc2caa17a023e78caaccaaf6704881cbbeb1f1c4ad","observation_id":"e6ecfe14-7de9-4658-ba7d-9cd1e253b320","resolution":{"observed_at":"2026-08-11T10:51:16.142630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.07512","last_updated":"2015-06-24T19:53:45Z","snapshot_observed_at":"2026-08-14T22:43:04.181462Z","submitted_at":"2015-06-24T19:53:45Z","title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization","version":1},"cited_work":{"arxiv_id":"1506.07512","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.07512","snapshot_observed_at":"2026-08-11T10:51:16.590647Z","title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization","venue":"stat.ML","work_id":"98fdc1bd-2632-40d3-98f7-549aeaa1b462","year":2015},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.146419Z"},"links":{"cited_paper":"/paper/1506.07512","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:1df5e526785a325e4f7bff881aa5e1cbbff2e76cd2705e3b744e5baf0dfcf27f","observation_id":"c8e42de7-a507-4f1a-811d-b5ca9e72a814","resolution":{"observed_at":"2026-08-11T10:51:16.595514Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.855765Z","title":null,"venue":null,"work_id":"4e123a33-68ac-4fd0-9a99-2e9fb4960251","year":1976},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.150217Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:a8f6906ec8efe1e83856322916a2b589f10ca768e4605a32f10d98cc1173dd29","observation_id":"9ce3de62-1a44-4a4d-8e24-64c1c6864d08","resolution":{"observed_at":"2026-08-11T10:51:16.859396Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.845764Z","title":null,"venue":null,"work_id":"031d77b0-9cba-49ec-ae53-9d84024ba7dd","year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.153434Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:a7f8b6a4600ecc77b9d637137cccad2509ce7e515d5d4c468e88913844254ffe","observation_id":"24dfa026-2f4d-4abc-b9a0-561c1c9acb1d","resolution":{"observed_at":"2026-08-11T10:51:16.849217Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.835210Z","title":null,"venue":null,"work_id":"4aa3d0bf-9177-46e1-b1a0-fc74485e5033","year":1975},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.156447Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:67ed4183ea8d2eed7e99d7daa05a92ee9bad7cc5658073421d37f27b06c4d1b6","observation_id":"37ee5286-528a-4350-b890-1318cfa97b87","resolution":{"observed_at":"2026-08-11T10:51:16.838796Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1706.02216","last_updated":"2018-09-10T14:26:58Z","snapshot_observed_at":"2026-08-14T20:55:31.779433Z","submitted_at":"2017-06-07T14:51:05Z","title":"Inductive Representation Learning on Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02216","snapshot_observed_at":"2026-08-11T10:51:16.159764Z","title":"L.; Ying, R.; and Leskovec, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.159764Z"},"links":{"cited_paper":"/paper/1706.02216","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:16b2c408932b336a41af090435cd1f5606f5139ec82a332ba8aa5aaf414e8b28","observation_id":"c198b6a3-f154-415c-a641-fd1c5b58332e","resolution":{"observed_at":"2026-08-11T10:51:16.159764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.07145","last_updated":"2021-09-08T00:22:55Z","snapshot_observed_at":"2026-08-06T20:53:44.444031Z","submitted_at":"2021-04-14T22:11:35Z","title":"FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.07145","snapshot_observed_at":"2026-08-11T10:51:16.163144Z","title":"S.; Rong, Y.; Zhao, P.; Huang, J.; Annavaram, M.; and Avestimehr, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.163144Z"},"links":{"cited_paper":"/paper/2104.07145","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:c003600df32ae665b765784e777599b56b2a25f7daa4853d32ea3b51929ccdf9","observation_id":"8f9d2233-1f5a-4ee9-bfb2-aff60de1b4b9","resolution":{"observed_at":"2026-08-11T10:51:16.163144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.05163","last_updated":"2015-06-16T22:31:09Z","snapshot_observed_at":"2026-08-14T22:44:08.546380Z","submitted_at":"2015-06-16T22:31:09Z","title":"Deep Convolutional Networks on Graph-Structured Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.05163","snapshot_observed_at":"2026-08-11T10:51:16.166649Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.166649Z"},"links":{"cited_paper":"/paper/1506.05163","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:281824be5f78ea0431d8bd4915a9b6072acf06bafb705d2024f92baa96589b39","observation_id":"10e24a96-6bcd-46b9-a6e3-b552f2f1dcf0","resolution":{"observed_at":"2026-08-11T10:51:16.166649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.825514Z","title":null,"venue":null,"work_id":"83dccd2e-274d-492f-942a-0f6ef27a4835","year":2001},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.170149Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:8ea45d419cbb84c555c7d7fea706fb1f778a54dfa096f3afd1aa6c6b520f7532","observation_id":"c778a841-818f-42c2-af0c-3ad950b64bcc","resolution":{"observed_at":"2026-08-11T10:51:16.828906Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1909.06335","last_updated":"2019-09-13T17:26:20Z","snapshot_observed_at":"2026-08-13T05:03:48.556310Z","submitted_at":"2019-09-13T17:26:20Z","title":"Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.06335","snapshot_observed_at":"2026-08-11T10:51:16.174153Z","title":"H.; Qi, H.; and Brown, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.174153Z"},"links":{"cited_paper":"/paper/1909.06335","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:8928e3f3d852cc07690bd22ccdd09ac99593596a5dee475ba026e39036e791b5","observation_id":"54d1a444-d423-457f-b371-049e6835f2a2","resolution":{"observed_at":"2026-08-11T10:51:16.174153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-14T00:38:29.685908Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-11T10:51:16.178177Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.178177Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:ad73bfe92df3634c41a97389221459413836da31824642f7ca61d3c8be1c7274","observation_id":"c5b331e1-763f-4188-a5e3-c40e91ac76fc","resolution":{"observed_at":"2026-08-11T10:51:16.178177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.01332","last_updated":"2020-03-03T04:49:21Z","snapshot_observed_at":"2026-08-09T00:12:39.478411Z","submitted_at":"2020-03-03T04:49:21Z","title":"Heterogeneous Graph Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.01332","snapshot_observed_at":"2026-08-11T10:51:16.182047Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.182047Z"},"links":{"cited_paper":"/paper/2003.01332","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:3d8ed262a6362f6f40bc818bc63361587a2a3bf44796821496fa02b08ab349dd","observation_id":"692c02c4-9083-411b-9529-61a4c7012b8b","resolution":{"observed_at":"2026-08-11T10:51:16.182047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.815591Z","title":null,"venue":null,"work_id":"95510a99-31e8-40b5-8fa9-545844c38d41","year":2012},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.185712Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:85ddc1245bb753715ff095ed88a814e6f23b15c810ec1e08032d692a9e91f6cc","observation_id":"e363fc1e-5613-47a2-9464-b3b88e3ef715","resolution":{"observed_at":"2026-08-11T10:51:16.819290Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-11T10:51:16.189645Z","title":"P.; and Ba, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.189645Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:1f6fcdde8fabc896a618ba309fddafd8c44a6125617ba6b3e4e4cf4e9ae91251","observation_id":"b09481cc-9584-484a-8641-b050ecd2ac6b","resolution":{"observed_at":"2026-08-11T10:51:16.189645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-11T10:51:16.193640Z","title":"N.; and Welling, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.193640Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:5a727a9c9b3eb5311b1954a957c84c11d5970b1cffbf54288a0be3db81d16361","observation_id":"fca85967-2c7a-488e-878c-ab88c0bb8d5b","resolution":{"observed_at":"2026-08-11T10:51:16.193640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.805215Z","title":null,"venue":null,"work_id":"c8c58600-b342-44a5-9e93-5ef93c409d15","year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.197282Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:c27b5a6a87381423d01f9c298f829221e8c5dd5b5fc54a5195b6ebf56a7ac4fb","observation_id":"caf19745-06fd-4c83-94e5-79bf5dcf49a7","resolution":{"observed_at":"2026-08-11T10:51:16.809041Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1904.03751","last_updated":"2019-08-19T12:53:49Z","snapshot_observed_at":"2026-08-14T16:50:20.494749Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03751","snapshot_observed_at":"2026-08-11T10:51:16.201976Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.201976Z"},"links":{"cited_paper":"/paper/1904.03751","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:907f964ae4ba6518c986891d956e78c079aef3d7f51303d1af6ac0863556b368","observation_id":"83709793-6896-4cff-9d3b-1d0a40a0e15c","resolution":{"observed_at":"2026-08-11T10:51:16.201976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.06127","last_updated":"2020-04-21T18:58:23Z","snapshot_observed_at":"2026-08-15T01:11:14.928056Z","submitted_at":"2018-12-14T19:28:29Z","title":"Federated Optimization in Heterogeneous Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.06127","snapshot_observed_at":"2026-08-11T10:51:16.205620Z","title":"K.; Zaheer, M.; Sanjabi, M.; Talwalkar, A.; and Smith, V","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.205620Z"},"links":{"cited_paper":"/paper/1812.06127","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:7a66a363935ecbf4012186f3e55a9d5aa062f9e47052134469e854f7802df835","observation_id":"3db58ef4-92fc-4615-a229-763cb399a20d","resolution":{"observed_at":"2026-08-11T10:51:16.205620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02189","last_updated":"2020-06-25T06:45:52Z","snapshot_observed_at":"2026-08-14T16:08:56.121684Z","submitted_at":"2019-07-04T02:04:56Z","title":"On the Convergence of FedAvg on Non-IID Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.02189","snapshot_observed_at":"2026-08-11T10:51:16.209325Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.209325Z"},"links":{"cited_paper":"/paper/1907.02189","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:43744b81f9e223923621d46566a1d4557e38d86cdeb948a8fb61ddbf8d0cfe8e","observation_id":"4f9ecb93-0763-400d-9fa8-45f0162568bd","resolution":{"observed_at":"2026-08-11T10:51:16.209325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.794936Z","title":null,"venue":null,"work_id":"d4260828-ce88-451e-ab90-2270dc376e0d","year":1993},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.213995Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:1b3d6d4e4fd00d35456b4ac1d1cc15ff76ea04c784922d62c426e757c2132b57","observation_id":"cf7266ce-93b8-46a2-a01b-0f6c6cfb52a9","resolution":{"observed_at":"2026-08-11T10:51:16.798457Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.217550Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.217550Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:ee90851bdef9190bea6d3c7c46a6d2290871834d4d5d9f1de5324b988b9b0934","observation_id":"7aba0fdb-2bbb-464f-b7a7-740b38da8222","resolution":{"observed_at":"2026-08-11T10:51:16.217550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.05629","last_updated":"2023-01-26T22:54:08Z","snapshot_observed_at":"2026-08-14T22:09:52.579364Z","submitted_at":"2016-02-17T23:40:56Z","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.05629","snapshot_observed_at":"2026-08-11T10:51:16.221033Z","title":"B.; Moore, E.; Ramage, D.; and y Arcas, B","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.221033Z"},"links":{"cited_paper":"/paper/1602.05629","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:4e77b6df84651cb1233af227dc6b580d7ad4540f9a1c9cbaf7fa4db27a4ec5c2","observation_id":"487d8355-6816-476b-85dc-7754b2c8314c","resolution":{"observed_at":"2026-08-11T10:51:16.221033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14213","last_updated":"2022-04-13T18:30:03Z","snapshot_observed_at":"2026-08-15T05:07:46.081457Z","submitted_at":"2021-11-28T19:03:39Z","title":"Local Learning Matters: Rethinking Data Heterogeneity in Federated Learning","version":3},"cited_work":{"arxiv_id":"2111.14213","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.14213","snapshot_observed_at":"2026-08-11T10:51:16.467912Z","title":"Local Learning Matters: Rethinking Data Heterogeneity in Federated Learning","venue":"cs.LG","work_id":"438c1524-de32-41d0-a506-8b3d83dfa6a9","year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.224644Z"},"links":{"cited_paper":"/paper/2111.14213","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:1a7a368662500175bc1bdc9df5ff9eabd2eef823c3f9604f5ea2258a395a1291","observation_id":"e8e1efab-faaa-4980-84df-1318a62b3b79","resolution":{"observed_at":"2026-08-11T10:51:16.472177Z","resolver_source":"local_arxiv","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":"2003.00295","last_updated":"2021-09-08T23:37:17Z","snapshot_observed_at":"2026-08-13T06:06:10.844945Z","submitted_at":"2020-02-29T16:37:29Z","title":"Adaptive Federated Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00295","snapshot_observed_at":"2026-08-11T10:51:16.228634Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.228634Z"},"links":{"cited_paper":"/paper/2003.00295","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:6e3c0001176bbbe35427a0c29b1da50b4ab7a3b54edda7ca70ee09a2fbfb3487","observation_id":"9643b646-3bce-41e6-9011-1b974fba1c61","resolution":{"observed_at":"2026-08-11T10:51:16.228634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.779022Z","title":null,"venue":null,"work_id":"896c0401-ac5e-473d-a495-b0b7054bb77a","year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.232009Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:d8a136b2364a396c9bfa50103eb0c1b34c637b495803dad52f3dcecaebef61eb","observation_id":"c33b9803-d2ca-4c40-9853-1f562ce81cb5","resolution":{"observed_at":"2026-08-11T10:51:16.782302Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.769432Z","title":null,"venue":null,"work_id":"92e3250e-2f43-4747-b84f-0bfe44a2ffd9","year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.235732Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:9f0cab01d2b87c288dcbe42b2854519fe93c06d8dc60ac65060706ef4e1f138d","observation_id":"97492ef1-e858-4c25-aee4-b4d198669119","resolution":{"observed_at":"2026-08-11T10:51:16.772807Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1109.2415","last_updated":"2011-12-01T16:06:06Z","snapshot_observed_at":"2026-08-15T04:35:33.487515Z","submitted_at":"2011-09-12T09:45:02Z","title":"Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization","version":2},"cited_work":{"arxiv_id":"1109.2415","doi":null,"metadata_source":"pith","pith_arxiv_id":"1109.2415","snapshot_observed_at":"2026-08-11T10:51:16.442478Z","title":"Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization","venue":"cs.LG","work_id":"0b4fc8e1-92b1-445a-8686-53acdf6cb231","year":2011},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.239217Z"},"links":{"cited_paper":"/paper/1109.2415","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:52738ef712064e8507c82f9137b62d8d1cee0cc5c2c14af2324aa8b44cc0b264","observation_id":"a326cdca-a004-46c2-ab14-f02b58e7de3e","resolution":{"observed_at":"2026-08-11T10:51:16.446371Z","resolver_source":"local_arxiv","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":"2211.00216","last_updated":"2023-08-25T07:26:35Z","snapshot_observed_at":"2026-08-15T00:26:30.995640Z","submitted_at":"2022-11-01T01:57:00Z","title":"Distributed Graph Neural Network Training: A Survey","version":2},"cited_work":{"arxiv_id":"2211.00216","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.00216","snapshot_observed_at":"2026-08-11T10:51:16.428059Z","title":"Distributed Graph Neural Network Training: A Survey","venue":"cs.LG","work_id":"56e0ff90-7e24-4ee3-9413-586a5b47a1cf","year":2022},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.243995Z"},"links":{"cited_paper":"/paper/2211.00216","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:6d563b2a13d42af770c056f8b380a0a0c31fbb85600a93b0e3cc09f77058c0de","observation_id":"10d774cb-bfad-4ef2-9f21-cb3db37b640c","resolution":{"observed_at":"2026-08-11T10:51:16.431941Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.759703Z","title":null,"venue":null,"work_id":"f517b4f2-6e9f-4394-bcf2-53e2af87ddf5","year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.248062Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:649e36835fd3424e6012825a5feebdd2e173d4325089ebe204e369c05ab560d6","observation_id":"730712b4-13ba-43da-81f8-cfde59ea3637","resolution":{"observed_at":"2026-08-11T10:51:16.762903Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1909.12946","last_updated":"2019-10-02T22:32:23Z","snapshot_observed_at":"2026-08-14T00:36:17.633494Z","submitted_at":"2019-09-19T21:31:14Z","title":"Towards Federated Graph Learning for Collaborative Financial Crimes Detection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.12946","snapshot_observed_at":"2026-08-11T10:51:16.251142Z","title":"L.; Watanabe, Y.; Loyola, P.; Klyashtorny, D.; Ludwig, H.; and Bhaskaran, K","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.251142Z"},"links":{"cited_paper":"/paper/1909.12946","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:d40c65043a10d74a9e24e8354d72162efb5650fad411f69d6f06d5eb3e856382","observation_id":"87b18c05-1394-42ac-949b-50f933ace117","resolution":{"observed_at":"2026-08-11T10:51:16.251142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.749729Z","title":null,"venue":null,"work_id":"ca8afb42-b865-4e64-9f3e-84e0b508a809","year":1981},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.255409Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:b0fbcd83030e173a60fd48c261eae9c21b0e19e75e7649360e78ede59eb26555","observation_id":"c863c40d-9f72-4042-a9a4-586b5d55917a","resolution":{"observed_at":"2026-08-11T10:51:16.753164Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.740056Z","title":null,"venue":null,"work_id":"e200e522-cd08-4e7a-9875-7b4484a517dc","year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.259199Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:b11ca1a6169f89fe576ea604058239986b3ffab2fe9d0da17968c50646e8b429","observation_id":"aa97125a-2403-4ab6-880e-8b7c332febef","resolution":{"observed_at":"2026-08-11T10:51:16.743384Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.729680Z","title":null,"venue":null,"work_id":"ee594822-a1ea-42ec-bb40-c6277e2333e3","year":1990},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.263326Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:ac2414fc3e2810bb70951e7dff1d93b1748438edd8b747837cacbfd301f28d89","observation_id":"b1eb7866-dc4d-4620-9f0e-497edc63cad7","resolution":{"observed_at":"2026-08-11T10:51:16.732922Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.267165Z","title":"N.; Kaiser, L","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.267165Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:0bed7272d1e9089860bd2afa8b729edbe1e8b2f1b647b1665582d0ceba5e6a49","observation_id":"cd93b770-0456-44b9-99fb-4b4eab48b623","resolution":{"observed_at":"2026-08-11T10:51:16.267165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-11T10:51:16.270466Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.270466Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:048ee4e472edef58c27fd9ede9c1fff99242db40e9402459d13a2178961abe93","observation_id":"d92fa122-001b-406f-87c4-22c4952a574a","resolution":{"observed_at":"2026-08-11T10:51:16.270466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.10983","last_updated":"2022-03-26T05:58:34Z","snapshot_observed_at":"2026-08-14T01:35:03.974001Z","submitted_at":"2022-03-21T13:44:37Z","title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.10983","snapshot_observed_at":"2026-08-11T10:51:16.274084Z","title":"S.; and Lin, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.274084Z"},"links":{"cited_paper":"/paper/2203.10983","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:75d6c59eec84812c9fdb5c71315cb14c95bf5930bf69e21e022bb605de1ab78b","observation_id":"9bd2c9f2-1963-414b-b1dc-b2ed57b5faba","resolution":{"observed_at":"2026-08-11T10:51:16.274084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.713416Z","title":null,"venue":null,"work_id":"a8657f37-89b3-466e-bd8a-48c29c876555","year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.277730Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:74737b66a3f75f42d9de55a9f13ece5330b267eda82f49ebfdadc6f4da97e606","observation_id":"03601ffd-653a-4c6d-a051-bc92b3cd9213","resolution":{"observed_at":"2026-08-11T10:51:16.717536Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2201.12433","last_updated":"2023-12-18T05:12:49Z","snapshot_observed_at":"2026-08-14T23:55:47.742140Z","submitted_at":"2022-01-28T21:39:16Z","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.12433","snapshot_observed_at":"2026-08-11T10:51:16.281145Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.281145Z"},"links":{"cited_paper":"/paper/2201.12433","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:ef59857cb2457d12f6784d8a17ddce2d016477a2b9b343ad03b5aac4ea4920e6","observation_id":"687aa235-6aea-410c-9677-39daa0345800","resolution":{"observed_at":"2026-08-11T10:51:16.281145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.702556Z","title":"M.; Cheng, Z.; Chen, L.; Joe-Wong, C.; and Liu, T","venue":null,"work_id":"d2923148-1975-4136-a31f-a587fbb8549d","year":2023},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.284425Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:f1c9b1dfa1c1d36a687bacad7b86dab78b382f6124c03c07ed1f797613cf6c8d","observation_id":"9606805b-7cec-4bb0-b651-a26969466014","resolution":{"observed_at":"2026-08-11T10:51:16.706416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.692898Z","title":null,"venue":null,"work_id":"e6fce36f-9197-4245-9d3c-bd695732b66a","year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.287468Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:c9ccc2ba8b37a6dcba2a81d3a5e0748967777da7291cba041c5a38d8cc60ab0f","observation_id":"535ea4b5-0f15-47b0-ae19-41c9b22b1567","resolution":{"observed_at":"2026-08-11T10:51:16.696311Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.682648Z","title":null,"venue":null,"work_id":"8a2a2c4f-b032-49f1-b77c-ab190e54b6bf","year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.291238Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:6ae6415e9e035c8b6d303ab99b96004fb8bc085e5b9e19451b1d14bc0e8a0c9a","observation_id":"790c5921-8765-4564-ab48-edb77e265d36","resolution":{"observed_at":"2026-08-11T10:51:16.686378Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2106.13430","last_updated":"2021-11-06T13:48:57Z","snapshot_observed_at":"2026-08-12T03:14:36.239556Z","submitted_at":"2021-06-25T04:58:55Z","title":"Subgraph Federated Learning with Missing Neighbor Generation","version":6},"cited_work":{"arxiv_id":"2106.13430","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.13430","snapshot_observed_at":"2026-08-11T10:51:16.370765Z","title":"Subgraph Federated Learning with Missing Neighbor Generation","venue":"cs.LG","work_id":"995be450-48d1-4e58-a245-b580b84546db","year":2021},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.294177Z"},"links":{"cited_paper":"/paper/2106.13430","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:fe3c607babc5eb7deba0526f7779561688a9a2894a0122a8114c748a19910884","observation_id":"2cf43f5d-5cca-4c80-b9e3-96e9097c32d0","resolution":{"observed_at":"2026-08-11T10:51:16.375025Z","resolver_source":"local_arxiv","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":"1911.08415","last_updated":"2019-11-26T03:10:26Z","snapshot_observed_at":"2026-08-12T10:09:16.296742Z","submitted_at":"2019-11-11T07:48:43Z","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","version":2},"cited_work":{"arxiv_id":"1911.08415","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.08415","snapshot_observed_at":"2026-08-11T10:51:16.356487Z","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","venue":"eess.SP","work_id":"c81b643f-ef81-4336-be48-1e89c07c0b10","year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.297807Z"},"links":{"cited_paper":"/paper/1911.08415","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:ebc52bcf4be155179761985554cb7dcf74aa71a8c5a165a7070f6c42ab6f5fee","observation_id":"4c576e04-a07b-4825-ad3a-957a34d697e0","resolution":{"observed_at":"2026-08-11T10:51:16.360752Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.672607Z","title":null,"venue":null,"work_id":"87b2baee-2ca3-4cca-a5ac-26e7e9eeb35d","year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.302129Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:01d88b03f9fa1fa23962754b609c7a70e4d81654888182462a81cb45ec01e456","observation_id":"efa63a50-2f1e-4eb6-9656-d6e4e0fc7c4c","resolution":{"observed_at":"2026-08-11T10:51:16.676320Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:51:16.662388Z","title":null,"venue":null,"work_id":"b847c64c-74fe-4fc7-bd80-3a2b69901230","year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.305614Z"},"links":{"citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:e1abb8bac4c98db214696a7dff6052bf5c87b13a75d66dd4cfe3adbec2d5c171","observation_id":"c8974383-456d-411e-a242-a24e018b7236","resolution":{"observed_at":"2026-08-11T10:51:16.666162Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2011.03248","last_updated":"2020-11-06T09:21:34Z","snapshot_observed_at":"2026-08-12T05:59:11.836172Z","submitted_at":"2020-11-06T09:21:34Z","title":"ASFGNN: Automated Separated-Federated Graph Neural Network","version":1},"cited_work":{"arxiv_id":"2011.03248","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.03248","snapshot_observed_at":"2026-08-11T10:51:16.338910Z","title":"ASFGNN: Automated Separated-Federated Graph Neural Network","venue":"cs.LG","work_id":"8f4ee6a7-481b-46df-b934-826e3474cc38","year":2020},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.308913Z"},"links":{"cited_paper":"/paper/2011.03248","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:bb07a184b6b7e757927237d3ede84bc55f9d4e0c08005537f150f7c4c18ed8bd","observation_id":"634d7ade-7d8b-47cc-8f8f-3067bd22c701","resolution":{"observed_at":"2026-08-11T10:51:16.345765Z","resolver_source":"local_arxiv","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"}}],"paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":8,"verified_fuzzy":3},"total_outbound_references":60},"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 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2412.16144."}