{"as_of":"2026-08-11T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4b7d11e09bb7f8b6d7a5d7ee081612ac655b4bf5b2bec95ed6b3ae1ae77b32e","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:51:26.533489Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.14964/citation-record","integrity":"/paper/2501.14964/integrity","json":"/paper/2501.14964/citation-record.json","paper":"/paper/2501.14964"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:26.822020Z","title":"Sub-center arcface: Boosting face recognition by large-scale noisy web faces","venue":null,"work_id":"6a2a3901-2b30-4ff1-835b-f455277ef3c6","year":2020},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.459778Z"},"links":{"citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:e427109bcb61b1ff43f144990b4856cc3278a018f56fec55cb5d03a35fc7a397","observation_id":"146548e5-b2ac-429a-9d3c-11a6cdfb1154","resolution":{"observed_at":"2026-08-10T14:51:26.826870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-10T23:39:48.575656Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-10T14:51:26.483149Z","title":"Geom-gcn: Geometric graph convolutional networks.arXiv preprint arXiv:2002.05287,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.483149Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:69a1d3b37cb2bae5472fa0f450605c340a24e25b4888f0618f11e73f9bf8545a","observation_id":"65033cf3-5946-4404-849c-2764c8630eac","resolution":{"observed_at":"2026-08-10T14:51:26.483149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05939","last_updated":"2016-03-02T04:52:08Z","snapshot_observed_at":"2026-08-10T23:35:24.844770Z","submitted_at":"2015-11-18T20:41:05Z","title":"Metric Learning with Adaptive Density Discrimination","version":2},"cited_work":{"arxiv_id":"1511.05939","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.05939","snapshot_observed_at":"2026-08-10T14:51:26.686282Z","title":"Metric Learning with Adaptive Density Discrimination","venue":"stat.ML","work_id":"72e933b2-dae0-46ab-8174-1789a26b8477","year":2015},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.488056Z"},"links":{"cited_paper":"/paper/1511.05939","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:509d7848f17556e1d5b2d5f589ceee37f74ad1b8a3bdc476d9b6a241c2c016d7","observation_id":"9301c884-8085-4cc3-a2c6-02fdadb4583b","resolution":{"observed_at":"2026-08-10T14:51:26.692934Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10903","last_updated":"2020-03-12T08:04:36Z","snapshot_observed_at":"2026-08-10T09:58:04.194039Z","submitted_at":"2019-07-25T08:57:45Z","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10903","snapshot_observed_at":"2026-08-10T14:51:26.493034Z","title":"Dropedge: Towards deep graph convolutional networks on node classification.arXiv preprint arXiv:1907.10903,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.493034Z"},"links":{"cited_paper":"/paper/1907.10903","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:3bca038bc69befc9b88f11582d26157f601342f247da13099040e32133d46ae3","observation_id":"c6b25a1e-a366-4d76-8b94-5003808473f5","resolution":{"observed_at":"2026-08-10T14:51:26.493034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03509","last_updated":"2021-05-10T02:23:20Z","snapshot_observed_at":"2026-07-06T09:53:43.248602Z","submitted_at":"2020-09-08T04:04:04Z","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03509","snapshot_observed_at":"2026-08-10T14:51:26.508622Z","title":"Masked label prediction: Unified message passing model for semi-supervised classification.arXiv preprint arXiv:2009.03509,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.508622Z"},"links":{"cited_paper":"/paper/2009.03509","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:75ac0f21e23001f5f146d2f68e209a9a378d70144536e35ede9da8602ce167b5","observation_id":"b0712cec-502a-4126-9ede-d974167009f7","resolution":{"observed_at":"2026-08-10T14:51:26.508622Z","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-10T14:51:26.793035Z","title":"Non-target-specific node injection attacks on graph neural networks: A hierarchical reinforcement learning approach","venue":null,"work_id":"258d879f-ac3b-4239-8507-9e96fdcc3b15","year":2025},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.513466Z"},"links":{"citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:f9a0ad02d46cbc9ab4f50639790b2a200183d900d7ffd6f648ba48ac80c59d48","observation_id":"29e69bb1-3379-4525-a437-26730ca72b7a","resolution":{"observed_at":"2026-08-10T14:51:26.797748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-10T14:51:26.518224Z","title":"Graph attention networks.arXiv preprint arXiv:1710.10903,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.518224Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:83125c44ea8fb79ff7c83c28a81aa4d191ea11ceacdd35c5ab6667e4b56cf600","observation_id":"e2f19d02-acf9-4593-8627-cff015e074d9","resolution":{"observed_at":"2026-08-10T14:51:26.518224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.04214","last_updated":"2019-10-14T22:09:35Z","snapshot_observed_at":"2026-08-10T16:27:56.677946Z","submitted_at":"2019-06-10T18:20:09Z","title":"Topology Attack and Defense for Graph Neural Networks: An Optimization Perspective","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.04214","snapshot_observed_at":"2026-08-10T14:51:26.523577Z","title":"Topology attack and defense for graph neural networks: An optimization perspective.arXiv preprint arXiv:1906.04214,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.523577Z"},"links":{"cited_paper":"/paper/1906.04214","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:a67e022c13600fbeab746e64baf19eb859faf02114f72d29f22f0fda19a1bbda","observation_id":"e1ddd136-80cf-434e-ae0a-7377e1049938","resolution":{"observed_at":"2026-08-10T14:51:26.523577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-10T14:51:26.528420Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.528420Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:a7f991f16120ff22433b6cc587b94946167c1c3ef4ccaf5a331f0405d816d09f","observation_id":"f9d73f23-a005-4614-914f-705392cae335","resolution":{"observed_at":"2026-08-10T14:51:26.528420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12223","last_updated":"2020-02-13T02:27:25Z","snapshot_observed_at":"2026-07-31T22:27:00.310523Z","submitted_at":"2019-09-26T16:20:37Z","title":"PairNorm: Tackling Oversmoothing in GNNs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.12223","snapshot_observed_at":"2026-08-10T14:51:26.533489Z","title":"Pairnorm: Tackling oversmoothing in gnns","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.533489Z"},"links":{"cited_paper":"/paper/1909.12223","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:83f5c4315f07a9679f0c471e08423acb8c346d0e7aa40f6b091756017fb1fee1","observation_id":"33c2c418-0031-4687-bd22-5296812b208c","resolution":{"observed_at":"2026-08-10T14:51:26.533489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1701.06538","last_updated":"2017-01-23T18:10:00Z","snapshot_observed_at":"2026-08-11T16:18:55.320420Z","submitted_at":"2017-01-23T18:10:00Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.06538","snapshot_observed_at":"2026-08-10T14:51:26.503340Z","title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer.arXiv preprint arXiv:1701.06538,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.503340Z"},"links":{"cited_paper":"/paper/1701.06538","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:56f1c895c6e69c2fbdf600e391374c5c54ed8d1484a69834db3ca13121e00a84","observation_id":"b8a33f61-8615-445f-a8c9-0dcf4504d151","resolution":{"observed_at":"2026-08-10T14:51:26.503340Z","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-07-06T05:10:16.862707Z","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-10T14:51:26.473403Z","title":"Semi-supervised classification with graph convolutional networks.arXiv preprint arXiv:1609.02907,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.473403Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:1e0286fe5a7a967dacdc059110a5a3192c8153cd10be6f803cdb57d96169b54a","observation_id":"3a0d56fa-eb6f-44ef-acce-3cef27faa17c","resolution":{"observed_at":"2026-08-10T14:51:26.473403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-10T14:51:26.449687Z","title":"How attentive are graph attention networks?arXiv preprint arXiv:2105.14491,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.449687Z"},"links":{"cited_paper":"/paper/2105.14491","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:2f40c6fda2256b16da0fc4186513dc442a95e511eb4e9b330f6091ff99004392","observation_id":"e256e2fb-5980-41e2-be9d-a0e9c881b678","resolution":{"observed_at":"2026-08-10T14:51:26.449687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-08-09T23:19:48.421057Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-10T14:51:26.455103Z","title":"Adaptive universal generalized pagerank graph neural network.arXiv preprint arXiv:2006.07988,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.455103Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:b7ae15ad134585994b71bace27cd1a87ed9d4f43729d9d4d9eb5ef46ea1861af","observation_id":"45228002-d333-425b-bab6-ef6be268cc21","resolution":{"observed_at":"2026-08-10T14:51:26.455103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10991","last_updated":"2023-09-06T06:58:11Z","snapshot_observed_at":"2026-08-10T06:11:19.584898Z","submitted_at":"2022-06-22T11:45:36Z","title":"Understanding convolution on graphs via energies","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.10991","snapshot_observed_at":"2026-08-10T14:51:26.464405Z","title":"Graph neural networks as gradient flows.arXiv preprint arXiv:2206.10991,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.464405Z"},"links":{"cited_paper":"/paper/2206.10991","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:94fd5763a09fea356432c6d57be0b4f34632c8562aaf157265ad8d94e61f4103","observation_id":"d48ef345-abcf-4700-8a07-1705e5eb7da3","resolution":{"observed_at":"2026-08-10T14:51:26.464405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09550","last_updated":"2019-05-26T05:21:04Z","snapshot_observed_at":"2026-07-06T07:54:54.802338Z","submitted_at":"2019-05-23T09:27:21Z","title":"Revisiting Graph Neural Networks: All We Have is Low-Pass Filters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.09550","snapshot_observed_at":"2026-08-10T14:51:26.478201Z","title":"Revisiting graph neural networks: All we have is low-pass filters.arXiv preprint arXiv:1905.09550,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.478201Z"},"links":{"cited_paper":"/paper/1905.09550","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:bb759822d2b275be4d67c9dc6555e0d514249c11cd742d82299a8c4a98ee7b24","observation_id":"d0fb193a-e20c-41d3-9fd9-46fff6f0bedb","resolution":{"observed_at":"2026-08-10T14:51:26.478201Z","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-10T14:51:26.807452Z","title":"Drew: Dynamically rewired message passing with delay","venue":null,"work_id":"0ce009ae-3265-4efc-9395-139f82a2b5bf","year":2025},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.468990Z"},"links":{"citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:39bd7b3c7fd325cd844294dcaff47facf752694d6bcde87f38bab738cd52a4c9","observation_id":"15173fff-907d-40c9-b4be-2fb821deed0b","resolution":{"observed_at":"2026-08-10T14:51:26.812117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00513","last_updated":"2023-03-15T16:54:00Z","snapshot_observed_at":"2026-08-03T15:41:10.199638Z","submitted_at":"2022-10-02T13:19:48Z","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00513","snapshot_observed_at":"2026-08-10T14:51:26.498276Z","title":"Gradient gating for deep multi-rate learning on graphs.arXiv preprint arXiv:2210.00513,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:26.498276Z"},"links":{"cited_paper":"/paper/2210.00513","citing_paper":"/paper/2501.14964"},"observation_digest":"sha256:de3c345388662cea3c6ecf4dbc2fb95a155a80a22d7af867e10954dd0532df3c","observation_id":"72faa079-8f2f-4976-a848-abb6b9f09896","resolution":{"observed_at":"2026-08-10T14:51:26.498276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.14964","last_updated":"2025-06-18T05:59:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T03:36:14.477420Z","submitted_at":"2025-01-24T22:49:53Z","title":"Personalized Layer Selection for Graph Neural Networks"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":18},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2501.14964."}