{"as_of":"2026-08-16T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e65a68976aeb26105fd306886c62a96b3ca59e80ea64ea775177b25ed4d7fe6d","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:55:13.494583Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2507.20127/citation-record","integrity":"/paper/2507.20127/integrity","json":"/paper/2507.20127/citation-record.json","paper":"/paper/2507.20127"},"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-15T17:55:14.251471Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":"a187610d-bbc4-4de9-a385-f7788346a453","year":2017},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.243274Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:dd0941c9211ff9d5bcb2cf9a338ec25d6a4c0cbd2ab7103352c1c3dbf8551de6","observation_id":"080835a8-8996-40b0-aee3-a7491e9ecc2d","resolution":{"observed_at":"2026-08-15T17:55:14.255846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.239014Z","title":"Comprehensive study on zeroing neural network with high-order evolutionary formula, nonlinear functions, and variable parameter for time-changing matrix cholesky decomposition,","venue":null,"work_id":"eb35ef5d-42ce-4fcf-a4b3-62c113c6d1c6","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.248414Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:6f1dc43afc135f44bacbacbad0d0c2563b5b0a0681b7fb9259ad25d9582a92bf","observation_id":"8b70e6d1-7ee2-43ee-894e-820a16db2a92","resolution":{"observed_at":"2026-08-15T17:55:14.243432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.227081Z","title":"Nie-gcn: Neighbor item embedding-aware graph convolutional network for recommendation,","venue":null,"work_id":"a2dc69a3-15ad-4ff7-9173-ffc32268d7fe","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.252845Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:a43baa3a2f81ba8f77138de4bc558fd04638f9baee2ddb133cd1f274e8a3df95","observation_id":"88d2c577-759a-444e-8a04-c4eae6fdbcfc","resolution":{"observed_at":"2026-08-15T17:55:14.231069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.213525Z","title":"Contrastive graph clustering with adaptive filter,","venue":null,"work_id":"cbfff0cb-eeb1-4bf4-97cb-dc2b941d53e1","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.257217Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:91bd87cfd2c318548905f31066da69b8ae7771c29ae466f0427f309ea5dd0e46","observation_id":"2250db47-b95b-4b45-be59-00d29548c7a0","resolution":{"observed_at":"2026-08-15T17:55:14.217603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.201336Z","title":"Generalizing aggregation functions in gnns: building high capacity and robust gnns via nonlinear aggregation,","venue":null,"work_id":"32661920-574f-46a5-b0bf-67f37079853f","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.261698Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:9c4ae3f53eb555aa66b200b11f0a0363af2205778cb3bc8a1b67bd09598f1811","observation_id":"be7448cc-c496-4b9e-ac01-97e4a0503535","resolution":{"observed_at":"2026-08-15T17:55:14.205452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.189215Z","title":"Raw-gnn: Random walk aggregation based graph neural network,","venue":null,"work_id":"3a51feda-25eb-41ac-976f-b83c4cff97f8","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.265904Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:531091ed60c97dc9edc452f6ec40d060a731a34ffdf5d77861adaa8445d34991","observation_id":"126f13df-ee83-4d9a-8028-ad6d0fbb4afa","resolution":{"observed_at":"2026-08-15T17:55:14.193216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.176460Z","title":"What contributes more to the robustness of heterophilic graph neural networks?","venue":null,"work_id":"6c2a1112-44a4-47d7-be4c-c63e10242192","year":2025},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.270560Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:4d5a8b8b440f0673de7ef9a01275e0cca419743f03ced665882b623e3c24d087","observation_id":"6059c28c-cbf0-4256-a097-8a807bfbb3da","resolution":{"observed_at":"2026-08-15T17:55:14.180553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.163740Z","title":"Block modeling- guided graph convolutional neural networks,","venue":null,"work_id":"8acf3c99-451a-491b-a03f-7f840a2a3d97","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.274675Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:16fe0569effd2acb33f63415c80264a0c8842b721a35027a9e37e90d5a18a662","observation_id":"c15b547e-df66-4630-bb04-72b4b5cd2760","resolution":{"observed_at":"2026-08-15T17:55:14.167749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.150970Z","title":"Heterogeneous graph neural network via attribute completion,","venue":null,"work_id":"81c1e62b-35b4-426c-9e78-9df82306b97a","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.278872Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:d77135fa392c664ce9748871615113b9ab36174e7fe7db0ac8c67bfb3709d079","observation_id":"9a83b287-df25-40c7-9468-0ff6df93704e","resolution":{"observed_at":"2026-08-15T17:55:14.155347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.138520Z","title":"Finding global homophily in graph neural networks when meeting heterophily,","venue":null,"work_id":"a4f1e1c3-5bf3-4085-826d-c74130f54201","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.283067Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:55d7c98b0cb8877c40aae42e3f634d14cd6e20493b628455b3f309a338dbbaaa","observation_id":"a06b4dd4-db84-4946-8f5f-b24d9677cd1d","resolution":{"observed_at":"2026-08-15T17:55:14.142729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.125379Z","title":"Adaptive universal generalized pagerank graph neural network,","venue":null,"work_id":"b402d643-92e4-4b9a-9061-cf04487acf64","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.287059Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:aea20592c865905bc4643baeb5171aa716b396d82a38d8ac3ec78a169aeaa5b5","observation_id":"6d0a6241-84d8-4ebf-86bf-c7dcb01b1cd3","resolution":{"observed_at":"2026-08-15T17:55:14.129877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.111952Z","title":"Deformable graph convolu- tional networks,","venue":null,"work_id":"3362d9b6-36f3-4850-81ef-10071342bf46","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.291309Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:5d1159708552d3a85ecfe2647c604cc72401b98f00ab183c5af6de4142426bba","observation_id":"3cbe4fac-4746-4a48-9cd1-49c09822f3a4","resolution":{"observed_at":"2026-08-15T17:55:14.116103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.099704Z","title":"Graph pointer neural networks,","venue":null,"work_id":"e24dd9d4-cbb4-489f-9304-7d888582dcdb","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.295724Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:75d8b4e3fa2f6529b14543078ab6f613addec2e4311ab171fcd67a8ee16b9976","observation_id":"5cf07d7d-fab2-444f-9df5-ecd500237226","resolution":{"observed_at":"2026-08-15T17:55:14.103753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.086902Z","title":"Identifying and correcting label bias in machine learning,","venue":null,"work_id":"270a74cf-3002-47ca-82fc-e1abce04dde3","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.300425Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:80aa6f3df99f71cf14517288ccc679c8729466ce904082a7a14f55bc4382b62b","observation_id":"0076c538-88e1-4287-988f-82d970cfa25a","resolution":{"observed_at":"2026-08-15T17:55:14.091463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.074335Z","title":"Fairness in semi-supervised learning: Unlabeled data help to reduce discrimination,","venue":null,"work_id":"70027158-2871-4e17-9684-516c6cfb2dbf","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.305304Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:c9be270ea23e8015e98a8e49720162bca055c639d65286773e46b0b1e16dbc50","observation_id":"fb7b2e96-e832-4ece-9631-22fc1e5862a6","resolution":{"observed_at":"2026-08-15T17:55:14.078544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.061511Z","title":"Beyond low-frequency information in graph convolutional networks,","venue":null,"work_id":"db53095f-f418-403e-8077-6635c2f61075","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.309715Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:b08fb1fa74f23c06c6514ec302e7988f06a53603a4f2a622dfcd2a91d6739104","observation_id":"0be27bf7-09aa-4365-a02c-28e887ef72cc","resolution":{"observed_at":"2026-08-15T17:55:14.065952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.314056Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.314056Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:c36bc4d53b3f8d70b6bb260bee139b56a82ce32255c60dd86c958d8d7c58ea1f","observation_id":"ddb670d1-d76d-4b41-b096-3fc1ac620e5b","resolution":{"observed_at":"2026-08-15T17:55:13.314056Z","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-15T17:55:14.040777Z","title":"Evennet: Ignoring odd-hop neighbors improves robustness of graph neural networks,","venue":null,"work_id":"c8dd4af8-3a85-47c6-bb63-8f5e1a1e9508","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.318415Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:6c9cb564efe77da2935c3b50259f2d9cd0b2c1d8605553c9af0b3a004c80835b","observation_id":"5a8adb27-21db-4bc9-b848-294d09e43dbd","resolution":{"observed_at":"2026-08-15T17:55:14.044939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:14.027073Z","title":"Deepergcn: Training deeper gcns with generalized aggregation functions,","venue":null,"work_id":"30d64e16-69d7-4b9a-89a7-7d9b2c760563","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.322986Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:c5ada3562648abdc58b63bad770caaea8a0fb1fef1026d0f7becd2939c9a698a","observation_id":"cea3ffc9-3d4d-4269-87ba-b05d75b06edf","resolution":{"observed_at":"2026-08-15T17:55:14.032219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.327841Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.327841Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:07c8405976f9a1efe087431d1630ab21c2f0d45f65595ab88da9c9eb28b7ba70","observation_id":"9684613a-e9b5-463b-9d6f-bed1a26cd66e","resolution":{"observed_at":"2026-08-15T17:55:13.327841Z","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-15T17:55:14.005291Z","title":"Multi-view contrastive graph clustering,","venue":null,"work_id":"4e4c0894-206a-4598-972f-22246ef4d907","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.332054Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:99a5dcfa5685b36fb9b3c1736b88bb2b57b07d3c12b8e75060ab2852da816e5b","observation_id":"a676109e-3c5b-4182-8734-5e2d7afb87d6","resolution":{"observed_at":"2026-08-15T17:55:14.009695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.991981Z","title":"Beyond homophily: Reconstructing structure for graph-agnostic clustering,","venue":null,"work_id":"13ae6d66-5018-47be-ad64-1f43b53dddf5","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.336592Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:1c4b832f1dafb382b1260526e3f4401a96c1ce9ec170c4c66ba2ae60ed85f6a3","observation_id":"9226e0b7-0371-4558-aee6-b47562a3d2f4","resolution":{"observed_at":"2026-08-15T17:55:13.996241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.978513Z","title":"Graph data condensation via self- expressive graph structure reconstruction,","venue":null,"work_id":"16ca9448-94d2-4dbd-aa94-5873c6a2009e","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.341365Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:a51bedcacabde8253a43827b89d20a2b01a4b67578cd2ca7f531e0c6903ae902","observation_id":"f59132a0-b646-4739-93c2-266c355f9bca","resolution":{"observed_at":"2026-08-15T17:55:13.983136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.345988Z","title":"Deepgcns: Can gcns go as deep as cnns?","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.345988Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:7bc8e4373bc6f354f128b76525bcffb7a073ff48b8f652410c0f610507e5c737","observation_id":"98a42a07-b10d-4d55-9fa1-1d24668f99a5","resolution":{"observed_at":"2026-08-15T17:55:13.345988Z","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-15T17:55:13.956002Z","title":"CAST: A correlation- based adaptive spectralacm clustering algorithm on multi-scale data,","venue":null,"work_id":"1480a9e9-49db-4c8f-bc02-05c800b4af8a","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.350752Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:bf07bdb4daa74485dfad6122359d54a9118d0756fa5d38a5716e24546c38d469","observation_id":"cd3063db-cb71-4920-b511-efc377afa725","resolution":{"observed_at":"2026-08-15T17:55:13.960947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.941025Z","title":"Cdc: A simple framework for complex data clustering,","venue":null,"work_id":"36881881-408f-4312-a39b-5b035beb58b2","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.355057Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:933f088f54d03b1b2cf8cf8ca39f9b7608cdf9d0bed3ae4fd7fdf6f251bbbc3d","observation_id":"f5d9d3d3-82d1-4e1b-8c29-c1ca05aa6d0d","resolution":{"observed_at":"2026-08-15T17:55:13.945257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.928063Z","title":"Multi-scale attributed node embedding,","venue":null,"work_id":"591deedc-850b-4953-a3e6-2000ddbcf1c1","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.359123Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:4417e22b4fabfbaa20b563ecb6f4a62bc861e71e6dd543517607bbed95c1963a","observation_id":"de8920c9-854e-4519-9efe-d2450ce11b30","resolution":{"observed_at":"2026-08-15T17:55:13.932323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.913980Z","title":"A critical look at the evaluation of gnns under het- erophily: are we really making progress?","venue":null,"work_id":"2e1a818d-5fae-4ec8-a0e4-75739abf0afe","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.363729Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:fefa169f7d5ab32671bb6f7b55f9c38aa0463e1ff134a170c6897c773096b3d4","observation_id":"4b08b27b-3681-41cf-a8e7-2a649980757b","resolution":{"observed_at":"2026-08-15T17:55:13.919185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.900741Z","title":"Deep graph clustering via dual correlation reduction,","venue":null,"work_id":"29ffb628-3be2-4d10-bff6-1e0126d29162","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.368303Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:d5a406a6b2f52ae1d5212da44e2efdccbd1bd88d2231aef35c04800afa3cb4b7","observation_id":"fa0d0df6-aade-4778-b94f-12f8a633aab2","resolution":{"observed_at":"2026-08-15T17:55:13.905121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.886818Z","title":"Rethinking graph auto-encoder models for attributed graph clustering,","venue":null,"work_id":"d85879ba-508c-45cd-ae6b-e63b4e52cf82","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.372800Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:b312efd4b1aa38e5355fe58f23fa14385bc30ca6d1d2735bfacb116679fa854d","observation_id":"ef96f605-af48-4ecc-88cb-8071a6811e2c","resolution":{"observed_at":"2026-08-15T17:55:13.891773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.376867Z","title":"Open graph benchmark: Datasets for machine learning on graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.376867Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:23a72171aa29f83408b31149720aa946f5d3516e37eaa4775ffd7f24c6694519","observation_id":"40c36ba1-b2f6-4c2b-bb0a-2e2e8c849f47","resolution":{"observed_at":"2026-08-15T17:55:13.376867Z","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-15T17:55:13.381034Z","title":"Geom-gcn: Geometric graph convolutional networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.381034Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:e46048ce39b844fa42e25d842dde10e67cb1afccf2aaaf293614ac62e43a1c84","observation_id":"d00489c0-90db-49f1-91cd-c84249a6ad09","resolution":{"observed_at":"2026-08-15T17:55:13.381034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05755","last_updated":"2026-06-21T20:21:17Z","snapshot_observed_at":"2026-08-16T13:20:04.848985Z","submitted_at":"2024-09-09T16:11:07Z","title":"Revealing the Pitfalls and Re-Evaluating the Advancement of Heterophilic Graph Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05755","snapshot_observed_at":"2026-08-15T17:55:13.385028Z","title":"Are heterophily-specific gnns and homophily metrics really effective? evaluation pitfalls and new benchmarks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.385028Z"},"links":{"cited_paper":"/paper/2409.05755","citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:f67faa48d137d66d67fbe7243862c397e67ef645eece7bfe7b9a33bbcdbee835","observation_id":"d615514d-c99e-4aad-9091-036eb60f61cf","resolution":{"observed_at":"2026-08-15T17:55:13.385028Z","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-15T17:55:13.857965Z","title":"Attributed graph clustering: A deep attentional embedding approach,","venue":null,"work_id":"10cf4fe8-e327-4fe3-abf9-1178f6065201","year":2019},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.389440Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:19997418c503c34ced71a53de870ddff347fbeb99facb8fb294ae4d6dbdb91a0","observation_id":"b74cc05b-5337-45ae-ba8e-ba954a08b980","resolution":{"observed_at":"2026-08-15T17:55:13.862477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.844865Z","title":"Multi-scale graph attention subspace clustering network,","venue":null,"work_id":"14031bfb-4a8f-4bae-a542-12e19afea1d7","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.393739Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:28ece2a67feb9f0a2dc31e334e0f20abe6206f38e3679b63e164c4db1521ea56","observation_id":"75117416-7ce8-4e0a-8e94-32fc09348cca","resolution":{"observed_at":"2026-08-15T17:55:13.849481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.831509Z","title":"Simple spectral graph convolution,","venue":null,"work_id":"98d9b6bd-b719-4194-ac4f-3da18f1a8c0c","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.398222Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:cbb63438ee389227169ee4a04d4b948cb9e813cf213d895bbae260c440219c67","observation_id":"b7b9973a-9109-46d8-b739-1342251cb023","resolution":{"observed_at":"2026-08-15T17:55:13.835610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.817998Z","title":"Collaborative decision-reinforced self-supervision for attributed graph clustering,","venue":null,"work_id":"d17cc10e-64ed-45b3-ada6-609a703a61c9","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.402897Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:27c2791ec469e3726efe008b9aedc6096a7cf9755a5800e2826723cb1efd4c08","observation_id":"0d6df3e8-6d63-4eae-b5ca-eff0e89af48b","resolution":{"observed_at":"2026-08-15T17:55:13.822354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.04003","last_updated":"2019-08-12T05:02:33Z","snapshot_observed_at":"2026-08-14T13:52:38.336732Z","submitted_at":"2019-08-12T05:02:33Z","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","version":1},"cited_work":{"arxiv_id":"1908.04003","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.04003","snapshot_observed_at":"2026-08-15T17:55:13.529101Z","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","venue":"cs.LG","work_id":"75ba6e2b-2ab7-45c0-ba68-15cfc3938b05","year":2019},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.407662Z"},"links":{"cited_paper":"/paper/1908.04003","citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:2b217470049eb72df6f94fb6987a34c92887053dcb13b96d81355391602b06bc","observation_id":"a71d655b-dd5c-41af-9844-ff3e8034dd5b","resolution":{"observed_at":"2026-08-15T17:55:13.535236Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.412665Z","title":"Learning graph embedding with adversarial training methods,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.412665Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:5161b910a2f72ea176803a7c82887b4032704be4ef4e3adc4e79341728776342","observation_id":"ac482620-417f-41e3-a230-1a0e1b1bfe1d","resolution":{"observed_at":"2026-08-15T17:55:13.412665Z","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-15T17:55:13.797363Z","title":"Deep masked graph node clustering,","venue":null,"work_id":"1d3b9cbd-fe3f-493b-a13a-ffbacf4f980f","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.417127Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:266568dc21d41dfdb47cd44a16e0b54ace04de476cf12590c90c76706f42ed68","observation_id":"34cd2ebe-409d-4311-9b21-b51d71a683b9","resolution":{"observed_at":"2026-08-15T17:55:13.801349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.784024Z","title":"Every node is different: Dynamically fusing self-supervised tasks for attributed graph clustering,","venue":null,"work_id":"04d0c7d4-1e6b-4bc1-a0b5-368473b189ee","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.421281Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:8915bf5ff60cd9fdd845002f471ac93edde7ffd6e00a2014af55101421d7f202","observation_id":"82a2a685-fe4a-42db-bfd8-9be9f55f3a6f","resolution":{"observed_at":"2026-08-15T17:55:13.788291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.771088Z","title":"Contrastive multi-view representation learning on graphs,","venue":null,"work_id":"0ac1ad25-65c9-48a4-8c33-0bb60e1f9454","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.425442Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:d40075ddc063d7e31207232b878da64a8a0e078676a690f8d82c98dbad3f334d","observation_id":"0086afe1-882b-428a-af28-c8a6c3896ee8","resolution":{"observed_at":"2026-08-15T17:55:13.775217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.758525Z","title":"Structural deep clustering network,","venue":null,"work_id":"e671ec2e-2e36-4fa2-a68d-05967d6c70cc","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.429394Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:68d4d140681a52efe72d908ce9aa2743ce32766e1622910d014a3c70dd39b866","observation_id":"a5845c84-2486-4693-be0f-dcf8179165b9","resolution":{"observed_at":"2026-08-15T17:55:13.762665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.745674Z","title":"Deep fusion clustering network,","venue":null,"work_id":"9ac39317-66ef-44c0-a978-b337abb9f587","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.433619Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:992da530bcc306be11e2787ffb1ce770488df5c20285753bcd51f12f82fab667","observation_id":"6564abcf-d1c1-42d2-9c3c-4f07359763d0","resolution":{"observed_at":"2026-08-15T17:55:13.749560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.733138Z","title":"Simple contrastive graph clustering,","venue":null,"work_id":"3b41e168-c30d-40bc-8d41-23105dcb3b6d","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.438030Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:2519791d0bd0b31e1630958f30afcfcfc68326ba6a48cbe9095b1fb50f700ebd","observation_id":"f258e21f-609f-4645-a0cc-b01bdbd79786","resolution":{"observed_at":"2026-08-15T17:55:13.737117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.720564Z","title":"Cluster-guided contrastive graph clustering network,","venue":null,"work_id":"fbabc338-c86e-4f97-82de-b5925116b613","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.442239Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:b446adf2544ef8b87eb9338d12b638216d4b4f4e89b3e8c14e48830e645832e0","observation_id":"88f25e83-c65e-4d14-8e37-27ca668f93e6","resolution":{"observed_at":"2026-08-15T17:55:13.724605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.708041Z","title":"Adaptive graph encoder for attributed graph embedding,","venue":null,"work_id":"b37ba1d7-efc4-4f17-ac69-164cd7a80856","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.446145Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:9b5f1bc6a0f840f7d3cf4778ea8e6f97acbdc1085f104e28e2b2fa721bf2b574","observation_id":"a38dadc9-9d88-40ef-830e-890e39c9cedd","resolution":{"observed_at":"2026-08-15T17:55:13.712094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.695404Z","title":"Fine-grained attributed graph clustering,","venue":null,"work_id":"f743b19e-d323-469d-9b63-01b87ef40831","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.450596Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:874124a0a23fb3cf9ced8227828e5044a8a0cdd8a5b53e78db8a8b45db255025","observation_id":"0e89a1a7-ed74-4b99-8400-22d3bc02edce","resolution":{"observed_at":"2026-08-15T17:55:13.699425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.682367Z","title":"Robust graph structure learning under heterophily,","venue":null,"work_id":"35bd1a26-e362-4b77-8c18-76ae84bff0e7","year":2025},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.455119Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:6c6aa743555b07e6d44a19d7db70d6f0ed5a0ae93cb4928b6ae98b3591427f34","observation_id":"16625261-d201-4207-b12a-923b9f966001","resolution":{"observed_at":"2026-08-15T17:55:13.686678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.669325Z","title":"Unsupervised network embedding beyond homophily,","venue":null,"work_id":"4da6c5c6-6148-4bd2-a649-e255a4302066","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.459449Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:abb934d32b0956e9f464c0b3e8695c71c78960641054b6751d8dc1cc0205c0db","observation_id":"027a0c47-f254-45d1-8b2f-b01c9184f018","resolution":{"observed_at":"2026-08-15T17:55:13.673612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.655892Z","title":"Bootstrapped representation learning on graphs,","venue":null,"work_id":"0b89c957-686e-4d4a-8ad8-33141a774c0f","year":2021},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.463651Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:003b79a4aa61105f1fda5ad2e903288aa4abf4c814e0daf01f05de4eb58d3375","observation_id":"97a7af5e-d1ea-4630-ac06-ef0949ac84ee","resolution":{"observed_at":"2026-08-15T17:55:13.660568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.642821Z","title":"Progcl: Rethinking hard negative mining in graph contrastive learning,","venue":null,"work_id":"9860a707-a169-4ec9-a847-1a0ccf51afff","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.468450Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:45ec5182536380f1c094947d74191e90b44b69d791a0023f8904233c937108c7","observation_id":"89f4e04a-8ae9-4e62-8afc-e01a7c7ae615","resolution":{"observed_at":"2026-08-15T17:55:13.647026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.628439Z","title":"S3gc: scalable self- supervised graph clustering,","venue":null,"work_id":"eb9d11fd-a43a-4233-a028-a96a3832aa0e","year":2022},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.473008Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:fa0ece6b2ec15b767d1c7013caa132dabc1729179e5386628087378589316116","observation_id":"dc7b6756-e835-40ec-9ca8-4ef110d5bb51","resolution":{"observed_at":"2026-08-15T17:55:13.633387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.613221Z","title":"Dink- net: Neural clustering on large graphs,","venue":null,"work_id":"810a2ea3-d04b-4d01-8ef2-e160e3410fc3","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.477570Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:dae12de067a4be0936af4c556c7019f4256df14a232fb645d1f1655817c79419","observation_id":"9e551b20-97ea-4689-a0ca-b14dfdd79945","resolution":{"observed_at":"2026-08-15T17:55:13.617726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.599251Z","title":"Exploiting neigh- bor effect: Conv-agnostic gnn framework for graphs with heterophily,","venue":null,"work_id":"323b8b2d-d202-48bd-81bb-f2a1f0a77b7a","year":2023},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.481677Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:ad7342a58fb1a5eeb94ebedc1ea5d8a37cced3983ec24b9b70af89908d955cae","observation_id":"cc17a3d8-af54-46ad-9ec8-be5f0fd9e94d","resolution":{"observed_at":"2026-08-15T17:55:13.603883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.585453Z","title":"Pc-conv: Unifying homophily and het- erophily with two-fold filtering,","venue":null,"work_id":"69adac43-2a5e-4db7-9517-fceca27cd2d1","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.485866Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:beaab24e6c5226d601cfb0729a656e21cd95733cce0c4c910754286a8ca5941e","observation_id":"bc83f6d6-4609-499e-90f3-c696069039ee","resolution":{"observed_at":"2026-08-15T17:55:13.589996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.572349Z","title":"Deep Graph Contrastive Representation Learning,","venue":null,"work_id":"b1bc2113-4ba1-4b6a-9802-07884a2672d8","year":2020},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.490310Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:ada43d5f893e5e475e778949a1123ac6e2c4d7f2495a2875d0ded55525bde339","observation_id":"b77852a5-3f37-412f-b5f2-5656644d3593","resolution":{"observed_at":"2026-08-15T17:55:13.576608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:55:13.558469Z","title":"Hetergcl: graph contrastive learning framework on heterophilic graph,","venue":null,"work_id":"a764a813-c46e-47b1-a806-711160ce0a85","year":2024},"citing_paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T17:55:13.494583Z"},"links":{"citing_paper":"/paper/2507.20127"},"observation_digest":"sha256:bc6168d02b11ea6a569e4b86c4a45f1e0b9f0bef82321c8718c54c2eec35d4ea","observation_id":"8c49e48c-274d-4137-b1a8-dbfaccbee1d4","resolution":{"observed_at":"2026-08-15T17:55:13.562720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.20127","last_updated":"2025-07-27T04:52:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:34:39.044653Z","submitted_at":"2025-07-27T04:52:55Z","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":50},"total_outbound_references":58},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2507.20127."}