{"as_of":"2026-08-07T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:792dc19abea9ade840cba0d0cf9dd3741bb8b71c1166926eaf58d2cd44c5b392","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:59:23.894061Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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.13368/citation-record","integrity":"/paper/2507.13368/integrity","json":"/paper/2507.13368/citation-record.json","paper":"/paper/2507.13368"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:59:11.162741Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:11.162741Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:13384161a677e9fa0ae3a8a705ad4541ef607f62f5b17b6d7b4fd0e736a2e45f","observation_id":"88373e66-2315-4e5f-9270-9b28359518ce","resolution":{"observed_at":"2026-08-06T18:59:11.162741Z","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-06T18:59:37.698276Z","title":"Fastgcn: Fast learning with graph convolutional networks via importance sampling","venue":null,"work_id":"e0e7311a-1270-409a-af14-10e137a16e8d","year":2018},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:11.318579Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:b73ae8ce57d77a14c076866008a9502d2c8d90d4d04b227783f18c755fd9b3a2","observation_id":"c269de7e-7a82-4e88-9ff8-4c76a5aec972","resolution":{"observed_at":"2026-08-06T18:59:37.784224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:37.595769Z","title":null,"venue":null,"work_id":"8364353b-5a1c-4c21-841f-999e554d8ab1","year":2020},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:11.476304Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:959be5982ed23016b990f640c2d628169c8b7c2b1669f94b576b33f3b92572a7","observation_id":"bb5d1240-97e0-4cd8-9fed-0fd1c0109fe1","resolution":{"observed_at":"2026-08-06T18:59:37.644701Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:37.474522Z","title":"Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks","venue":null,"work_id":"e7f775b3-85e6-48c1-aa61-f281032ca04a","year":2019},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:11.632293Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:47b167df58317206ba55d5b190b31c23abd74515637cec55cd2458f6642f8c74","observation_id":"0dfa3fda-c130-4582-84f9-7c986948ccb2","resolution":{"observed_at":"2026-08-06T18:59:37.546829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:37.386366Z","title":null,"venue":null,"work_id":"1c7d1244-d136-4ad8-98ee-b9fee23c38b2","year":2000},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:11.771746Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:f2b437928bc8da9ad3981815de0b6bef5288597d64af868464d80e93201ab459","observation_id":"2b967821-6a09-40a5-861b-732326bc15c6","resolution":{"observed_at":"2026-08-06T18:59:37.433031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:37.288926Z","title":"S3gc: scalable self-supervised graph clustering","venue":null,"work_id":"d3799265-e58b-44ad-bcc6-83ee1681b7d6","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:11.981826Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:46ae27933d6cade9a0352608699dffc29025a511de7b25d314caed3b6b8d5e50","observation_id":"1deb0885-c824-46e4-b319-53a27030642a","resolution":{"observed_at":"2026-08-06T18:59:37.323929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:37.168871Z","title":"R., and Jin, H","venue":null,"work_id":"cc98da31-e05c-413c-9739-7a8b35b171e1","year":2019},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:12.226450Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:e1175826d43210b0ad29b1342875dd5fa3c79943e6c6b060afa4662cc820f9ac","observation_id":"9480b6e0-7d14-414c-b84b-e0586a96c751","resolution":{"observed_at":"2026-08-06T18:59:37.226901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:37.093036Z","title":"Explicit view-labels matter: A multifacet complementarity study of multi-view clustering","venue":null,"work_id":"2b6521d4-1533-4aa4-acf9-058395bfa028","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:12.385602Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:2094937fd0feac09cf09872a50d6923bbf692b20a8c88f0cb12ae2b104890619","observation_id":"1ae47a87-0995-4e4b-bc8a-1322240ecc9e","resolution":{"observed_at":"2026-08-06T18:59:37.123256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:36.963483Z","title":"Attributed graph clustering with dual redundancy reduction","venue":null,"work_id":"928de071-c09c-4178-bec7-91cdbfd6f056","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:12.568016Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:94aa3efe75ab7b93c93997260f70895854a072961fa6b12273b55101d58bcd40","observation_id":"fe2c3757-390d-4b6e-832e-22db03fccfed","resolution":{"observed_at":"2026-08-06T18:59:37.064419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:36.795879Z","title":"Deep fusion clustering network with reliable structure preservation","venue":null,"work_id":"7541ae2c-93a9-4171-a262-8c52da333d45","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:12.709708Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:f0ac556e4c777079b137bd02075471acbf770615c088a4744cb66529cc9949c5","observation_id":"6e3a2f1f-c2b7-42aa-a1c0-a0fa9f5ab739","resolution":{"observed_at":"2026-08-06T18:59:36.896088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:12.978667Z","title":"Bootstrap your own latent-a new approach to self-supervised learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:12.978667Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:8731e62fe349a21e2916aa80f7238b9da247fd64199aafebe67a014ab008cbc9","observation_id":"960c8be7-0e2f-4f2e-973c-caeadb2269ac","resolution":{"observed_at":"2026-08-06T18:59:12.978667Z","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-06T18:59:36.476540Z","title":"Structure-adaptive multi-view graph clustering for remote sensing data","venue":null,"work_id":"2c35d599-da72-4985-a0c6-e671bdda2ef5","year":2025},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:13.196548Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:1fef195d336daec77175253e26f6ed62a4483610b421428e7d024ee7f8ea4e39","observation_id":"dc84b63d-3f10-4292-a815-50970f29ddb0","resolution":{"observed_at":"2026-08-06T18:59:36.621800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:36.256415Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"9ddad254-af6a-4ad0-aa93-f5eb6963e5a0","year":2017},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:13.390487Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:7274c8660916ef7dd9de5339f40583073b42a4aa7ff44429baa8e28add6d22e9","observation_id":"d8ea1e82-cc72-4c65-9506-300a82589f3f","resolution":{"observed_at":"2026-08-06T18:59:36.360320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:35.971734Z","title":"and Khasahmadi, A","venue":null,"work_id":"d34e95d1-9702-4b62-b278-cfb2181ffd8b","year":2020},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:13.581201Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:707c53548d196716d6a79df0d2950a2d739361a3f4d38152b95d0fbb8b29efcb","observation_id":"08da955a-a181-4301-8d33-37ef54f1aebc","resolution":{"observed_at":"2026-08-06T18:59:36.124879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:35.693905Z","title":"T2-gnn: Graph neural networks for graphs with incomplete features and structure via teacher-student distillation","venue":null,"work_id":"558cc8a5-8408-4354-9eef-77a768a0e73e","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:13.854800Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:a44a29d68d6503bc7c904da785d154bc2f9fd409e9903b6ed505bd764a1218f4","observation_id":"aff28b7f-0385-40cd-af9b-4eb13449c9aa","resolution":{"observed_at":"2026-08-06T18:59:35.804788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.10130","last_updated":"2021-06-04T09:23:46Z","snapshot_observed_at":"2026-07-06T09:06:37.028617Z","submitted_at":"2020-03-23T08:29:59Z","title":"Incomplete Graph Representation and Learning via Partial Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.10130","snapshot_observed_at":"2026-08-06T18:59:14.042299Z","title":"and Zhang, Z","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:14.042299Z"},"links":{"cited_paper":"/paper/2003.10130","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:aa570b658cf3c887b097e4a26308c11efcb7166441c3390d219f6e6f669bc1ef","observation_id":"fa599941-0f0a-49a3-acf1-b6ff90d65c47","resolution":{"observed_at":"2026-08-06T18:59:14.042299Z","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-06T18:59:14.253363Z","title":"A survey of graph neural networks in real world: Imbalance, noise, privacy and ood challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:14.253363Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:1bc587cecc493f73db4c337d6a8b2d1403e8c7c2380599da36600d5ae9c375ed","observation_id":"39f5ca9a-104e-4651-ab80-f89b9fcabf4b","resolution":{"observed_at":"2026-08-06T18:59:14.253363Z","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-06T18:59:35.446569Z","title":"Csat: Contrastive sampling-aggregating transformer for community detection in attribute-missing networks","venue":null,"work_id":"a3bbb048-bcf2-4596-81a9-91cb3cc3378e","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:14.368667Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:021df919ce511c38ee2484f53c64ad54496eb972fa8db57faa5f14d37863c9e7","observation_id":"5a5b9a82-190c-47d8-ab0e-61c1be1c6326","resolution":{"observed_at":"2026-08-06T18:59:35.579268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:35.159487Z","title":"L., Gupta, V., Bhalerao, O., and Lim, S","venue":null,"work_id":"a14442b5-d87e-40b2-ab38-4426d2cddac7","year":2021},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:14.478801Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:b7510540e6233f69610e509bfa134bbb97c3e77b8e9f2fc4ce0a8029936e0ee7","observation_id":"37a9c301-febc-4c00-8489-239a68a23a2f","resolution":{"observed_at":"2026-08-06T18:59:35.334526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:34.902402Z","title":"Federated graph-level clustering network","venue":null,"work_id":"56b97155-e23d-4530-b2df-f03d1e256033","year":2025},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:14.628966Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:ea7233c5ca892bed01f8327f08722e7b7696ff535ab160f92ea68065c8ab0504","observation_id":"35e77cea-c437-45e7-8df2-1c02d22cfe6d","resolution":{"observed_at":"2026-08-06T18:59:35.026625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:34.592776Z","title":"Deep graph clustering via dual correlation reduction","venue":null,"work_id":"e8180edf-dfce-40a7-a191-bba53d0add9d","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:14.851681Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:8cccc2871abcabc294df4fa67dc6111646ed28b0505d7fa9e40839d4e423ae13","observation_id":"d7d4b883-82c2-43b4-b811-830444a0f233","resolution":{"observed_at":"2026-08-06T18:59:34.756396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-07-06T14:22:08.657203Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-06T18:59:15.078824Z","title":"Z., Liu, X., and He, K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:15.078824Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:852ae045ad7d684c3579c77179cac0ebb6a58cbcbe206b9c06078cbd3f57d42c","observation_id":"c508602a-69a5-442a-a7b2-c760fd3616f4","resolution":{"observed_at":"2026-08-06T18:59:15.078824Z","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-06T18:59:34.307544Z","title":"Towards unsupervised deep graph structure learning","venue":null,"work_id":"fced95fb-ea9f-48b0-9de4-2f1dedf9fce6","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:15.280664Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:c352ea6ee657dd3e0eda94e2c919220adc922ac30e1be4c3e2f74821c46f7652","observation_id":"c7bb5236-2e57-4b5a-b651-66799b7a1fc8","resolution":{"observed_at":"2026-08-06T18:59:34.431620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:34.023761Z","title":null,"venue":null,"work_id":"aebf8ae4-e048-4095-99c4-76120661c0a6","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:15.446352Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:d19619e35e991a33686685e5e7d7ab48c75bdf6bfe6e0bf094c18722185f9571","observation_id":"781ac55c-ec84-4bb6-8e0b-5ad124c41bf3","resolution":{"observed_at":"2026-08-06T18:59:34.147450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:33.803357Z","title":null,"venue":null,"work_id":"d749d981-5797-4adf-8a7f-265292b124f4","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:15.689786Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:b544a4f093cea1e3105ad0338d746f22266f6d70196832973ebaa3d279941054","observation_id":"22054e77-0608-45fc-b3a8-9e034e2e2ef1","resolution":{"observed_at":"2026-08-06T18:59:33.877089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:33.585665Z","title":"Simple contrastive graph clustering","venue":null,"work_id":"07e41c72-14cb-4185-8914-bdc9d10e925f","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:15.838870Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:386e454ea71a2a2d8cdfc772619a90c0e18f899111ad618a9989b838177e4817","observation_id":"7c83d02c-3608-4b41-b176-2bc774edc71b","resolution":{"observed_at":"2026-08-06T18:59:33.677673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:33.336968Z","title":"Hard sample aware network for contrastive deep graph clustering","venue":null,"work_id":"6c351125-84eb-4966-9d34-c27bd9e52fd7","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:16.047607Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:1ef9e36e5bfb550e9f6b27c38d727d90be2f1c6074a24e1ba83fe0c19cc13f43","observation_id":"6dd0edcc-0f17-45b3-b820-9bee8c81a8ea","resolution":{"observed_at":"2026-08-06T18:59:33.474175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:33.100464Z","title":"Improved dual correlation reduction network","venue":null,"work_id":"74c33b99-37d7-4ab9-bfa8-4c1f2ebb8929","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:16.184541Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:853b9ce0889ab88663d0b9b6e414d362be1af24d3ebf296e9252e86bcced550f","observation_id":"92a12056-7211-4bf1-bfc5-4d6fda8892f6","resolution":{"observed_at":"2026-08-06T18:59:33.210734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:32.856823Z","title":"End-to-end learnable clustering for intent learning in recommendation","venue":null,"work_id":"e21b0495-379f-4173-906e-9a850443586b","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:16.329694Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:4901a253d1675846dff957178d67e0ded3c79cf333d055ddcd152beec1205637","observation_id":"322285b3-65ce-4632-bd8c-4994e755e380","resolution":{"observed_at":"2026-08-06T18:59:32.996277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:32.565226Z","title":"Identify then recommend: Towards unsupervised group recommendation","venue":null,"work_id":"ffd99869-8c2c-4c5f-8d8b-a3618a270fc5","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:16.476959Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:8c63e2d7d33f52bd1484a69f86e03e268c36371468084607ffb51d8c5ff52e81","observation_id":"1a7856db-bf57-4bd8-9b75-92aa2363ae45","resolution":{"observed_at":"2026-08-06T18:59:32.732839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:32.325482Z","title":"Learning graph embedding with adversarial training methods","venue":null,"work_id":"1518123c-1abc-4182-970d-b545c9a28f39","year":2019},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:16.660396Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:cd23320eafd082e47d4d8ab0026835a9c53cd89bcdef6534ae477cdd8519a97f","observation_id":"2e41eb31-52f7-4088-bfde-f3e5c705a96a","resolution":{"observed_at":"2026-08-06T18:59:32.441873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:32.043202Z","title":"J., Lee, K., and Choi, J","venue":null,"work_id":"3eee3fdd-1396-4623-bf8f-3bea366c23aa","year":2019},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:16.817104Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:9599a4adcbc95333f8d50052ad8dd1411c95f2def2b1854cdcf0c19548a7e867","observation_id":"5e9b4ea2-7a80-44be-b4d6-8e244b00a23e","resolution":{"observed_at":"2026-08-06T18:59:32.165509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:31.810106Z","title":"A., Kim, S., Du, F., Ahmed, N., and Faloutsos, C","venue":null,"work_id":"832d917f-bab2-4bc5-84c0-1321b1855b3e","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:17.039745Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:992ca4c1536ce0988860ad5511372abe35c0dfb69e259f87d9351f90abe2672d","observation_id":"8a581dc4-dd59-441a-93e4-7b81f09b8418","resolution":{"observed_at":"2026-08-06T18:59:31.929783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-07-06T08:12:05.229336Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-06T18:59:17.203104Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:17.203104Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:ae8e32865d36b5f06209fbf95461fcaae4c03f1374bab34ce59d3f3e849e0859","observation_id":"3b37185d-ae5b-48dc-a2e7-f2776583cdae","resolution":{"observed_at":"2026-08-06T18:59:17.203104Z","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-06T18:59:31.575893Z","title":null,"venue":null,"work_id":"7ce77e70-cb80-4d6f-a18c-3b57b6bfbd7a","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:17.410495Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:aff0448911d309aca0497bf419553af956cfbbe9e04f934caef8209e28f81f8d","observation_id":"d9db8099-55b3-4b14-b29e-d27eb1cc94c7","resolution":{"observed_at":"2026-08-06T18:59:31.691600Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:31.368196Z","title":"Graph convolutional networks for graphs containing missing features","venue":null,"work_id":"130f7abd-56ef-44b4-95f2-f07d444ca77b","year":2021},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:17.568417Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:d3b7d5a42549ed5e4329ebaa672760c45997eb7f957b9dc4328ff3d989ea5643","observation_id":"31405748-90fe-4c7e-9d9f-27b1c4df088c","resolution":{"observed_at":"2026-08-06T18:59:31.494082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:31.125103Z","title":"G., Azabou, M., Dyer, E","venue":null,"work_id":"c0d7c063-8a1a-4ef3-b169-7535b69be6e3","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:17.799263Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:c509a25a75abc62963639fd37ce4f0f0654d3178dcd47cc6511b6fae287f936a","observation_id":"b90623ab-8c32-4591-bd33-e93bf59a1a41","resolution":{"observed_at":"2026-08-06T18:59:31.234520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:30.869192Z","title":"Deep fusion clustering network","venue":null,"work_id":"1197c7a5-4ea9-47d5-bd0b-462c03e3437d","year":2021},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:18.013100Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:3c58b9c591581b40447828eaae52dfa77b5f56e812cc932e1ea15a9358a91015","observation_id":"25dc427a-48e0-4a25-9862-d8e8027d0d9d","resolution":{"observed_at":"2026-08-06T18:59:31.006167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:30.620829Z","title":"Initializing then refining: A simple graph attribute imputation network","venue":null,"work_id":"fdd302cc-4020-41e2-94ac-3db6d08ef0d9","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:18.169181Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:0f52486ad57b9da8452371ea7c9ebbc05e648fc3a68ab3b1cab16a0fd967fc85","observation_id":"76baa7be-ead0-4c91-a08c-fe63dbb26339","resolution":{"observed_at":"2026-08-06T18:59:30.727640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:30.370308Z","title":"Attribute-missing graph clustering network","venue":null,"work_id":"bba708ce-2a91-4976-a12c-de477f6ed463","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:18.349093Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:837effeaa213e05c301c421f4871a40611e4bb607ef5a0441ae14377c0293f11","observation_id":"318f5110-0b9e-4119-8790-4f017442863a","resolution":{"observed_at":"2026-08-06T18:59:30.513104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:30.086743Z","title":"Rare: Robust masked graph autoencoder","venue":null,"work_id":"7c9d513c-43dc-4374-a62f-8994f8494d8e","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:18.494496Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:55822668007f5f2a59e71aff3bda6ee54c1ca8752cbd1e96248455e89daeb86d","observation_id":"93b08083-3ce2-4967-acd5-ef316e2e5050","resolution":{"observed_at":"2026-08-06T18:59:30.206844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:29.841875Z","title":"Hierarchically contrastive hard sample mining for graph self-supervised pre-training","venue":null,"work_id":"58ddadf0-1ccf-4b10-9ff0-613be1a8e4d2","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:18.638824Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:989bde014138f43549196cd2302840660c98a427be64b59a12d34346079a436d","observation_id":"6cf9fec7-d491-431a-9b48-0e6f05167e42","resolution":{"observed_at":"2026-08-06T18:59:29.928316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:29.583135Z","title":"Revisiting initializing then refining: An incomplete and missing graph imputation network","venue":null,"work_id":"8f4641b9-d806-4a8f-ba8f-0249928fbcd7","year":2025},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:18.884227Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:c34307cc7c277df92ca50ace91d93be57963ea9bc965cb27bb27f3618187c1ae","observation_id":"da2d2175-1dd4-47a3-9dde-739854069892","resolution":{"observed_at":"2026-08-06T18:59:29.675628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:29.433904Z","title":"Wage: Weight-sharing attribute-missing graph autoencoder","venue":null,"work_id":"3ef5d0ec-e237-4988-a372-ad23061dddbf","year":2025},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:19.106788Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:996a760daedf61533702b215067f03bcf92d0b78627e54256e6e855a9319fd64","observation_id":"2bf30c4e-3ef5-4375-823f-787532eb382f","resolution":{"observed_at":"2026-08-06T18:59:29.499578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:29.309649Z","title":"Confidence-based feature imputation for graphs with partially known features","venue":null,"work_id":"b9d69a77-3a4c-4318-868c-41ef0b1e103e","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:19.324427Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:d10e9e8c7b0636a7b601edc2964b26152e5d65a3a4a2806f54bdf54892025303","observation_id":"87c5c475-b398-400d-839c-97d46491474c","resolution":{"observed_at":"2026-08-06T18:59:29.369386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:19.541287Z","title":"and Hinton, G","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:19.541287Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:0e21f61e5eb2c6dbc036fea44ed2be0df698b5e7cb1158c7225203b58de19fe8","observation_id":"cc47b4dc-18f9-4186-b6fe-4a914efc060f","resolution":{"observed_at":"2026-08-06T18:59:19.541287Z","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-06T18:59:29.126379Z","title":"L., Li \\`o , P., Bengio, Y., and Hjelm, R","venue":null,"work_id":"4a7b68a4-4ea0-40f1-bfab-c6233b50247a","year":2019},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:19.710860Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:c2cb08b49e5f3975addfc42df06a96f2867c3680912181cc51ca8c4a0ff573d8","observation_id":"161d1ca1-dfbe-43ff-a7a5-80302a1f45f8","resolution":{"observed_at":"2026-08-06T18:59:29.224394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.945486Z","title":"Continual multi-view clustering","venue":null,"work_id":"4fe6bafd-fcbe-4599-b345-8f049e8860e5","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:19.880568Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:59a3d60486f912500e5829b12c5b27986f8caac71b07f80f4184bd21268ba9d3","observation_id":"3a33ae68-55a7-46e0-9787-49ba3fa7fd48","resolution":{"observed_at":"2026-08-06T18:59:29.027496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.802621Z","title":"One-step multi-view clustering with diverse representation","venue":null,"work_id":"b95ea5f3-4d08-4410-a00c-743c0ae23422","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:20.079796Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:48c21dc284396110fec5e17089f6b978e8f0d18e4e8b9872106dd9568eabe1fe","observation_id":"c9d18067-f1df-4028-8172-0571d270e6fd","resolution":{"observed_at":"2026-08-06T18:59:28.859674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.655039Z","title":"Contrastive continual multiview clustering with filtered structural fusion","venue":null,"work_id":"c3c2d4be-0978-4a53-b9a8-7321865fa464","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:20.237925Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:241163c1199773f4f7564fd26f05f684b09151e17a15e4226d4bafe8f9bf42e1","observation_id":"f0f26776-f1c8-4a50-84b3-c60c2a46885b","resolution":{"observed_at":"2026-08-06T18:59:28.721714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.516330Z","title":"Fast continual multi-view clustering with incomplete views","venue":null,"work_id":"385239b8-1834-40b7-9c81-419492586b29","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:20.530192Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:b520b3298fe56568da971d217c4a9324d977fe44d200c6703a09f0fecdd324d5","observation_id":"127cfff5-6e0b-44ef-9a03-c061f41ac260","resolution":{"observed_at":"2026-08-06T18:59:28.586442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.388879Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"4714cabf-68bc-4557-afaf-4826c19d706f","year":2019},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:20.800139Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:607da26d9289bfb6d72f5f666e7155c12f857893777d5cb619f91417d8f43381","observation_id":"a627d462-a014-450d-b561-91fdd4444969","resolution":{"observed_at":"2026-08-06T18:59:28.442976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.228563Z","title":"Nodeformer: A scalable graph structure learning transformer for node classification","venue":null,"work_id":"ba6373a9-cb5d-4a93-a1ca-df3506e849d8","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:21.014482Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:3ed06f568fec1c44dcca00b9872cf2d7f21c5a293e2c92693d33dd8860b15102","observation_id":"a1596770-9302-496b-bc99-c03e615f4fe5","resolution":{"observed_at":"2026-08-06T18:59:28.322701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:28.079449Z","title":null,"venue":null,"work_id":"9f978f2a-8b31-4744-8cd2-a179d2964d45","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:21.220232Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:e22869b9cb6185ba6622a4b2f951920b37298b51d656dac79503ad2268317630","observation_id":"ac53cea1-6c58-4077-aa51-27a42ae18098","resolution":{"observed_at":"2026-08-06T18:59:28.139401Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:27.932832Z","title":"Deep incomplete multi-view clustering via mining cluster complementarity","venue":null,"work_id":"000bf54a-0077-4ba9-b41f-461ee32b3dad","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:21.421317Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:57d441d157db18146c66729b186123e84f3eaa6877b5b1d86221acce00fe19bb","observation_id":"e6223035-d2f5-4849-ae72-48c4ce41510f","resolution":{"observed_at":"2026-08-06T18:59:28.008797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:27.755073Z","title":"Y., and He, L","venue":null,"work_id":"f87659f4-13ac-49a1-9fb1-86b307f5f415","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:21.584596Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:f7901e234720cae5f8b6942d8fc9ed43c5f2fee60b913bc86a02d175598d5330","observation_id":"cd19ff76-3308-4520-a6aa-3e3f2fd878a0","resolution":{"observed_at":"2026-08-06T18:59:27.850858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:27.619395Z","title":"Multi-level feature learning for contrastive multi-view clustering","venue":null,"work_id":"6ccf1f68-e610-46ca-97d9-698ccdcf84ad","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:21.730560Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:1f6c420593aefe343130ecabdf6ad2e2c6e9e6b014988754c228f06951b9d8d0","observation_id":"c0293935-4983-42ee-b7c6-f82fdda19fd5","resolution":{"observed_at":"2026-08-06T18:59:27.672675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:27.422549Z","title":"Repbin: constraint-based graph representation learning for metagenomic binning","venue":null,"work_id":"d04cf22d-4763-4e0b-b0e2-b690c76b97f9","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:21.885712Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:6501ae97ae38ca1e67a52f5a2c2e416e32d2a9cd6a8cbb2d93188cc510cae23f","observation_id":"709052a0-9df0-46d4-8cb8-83a2cc29e613","resolution":{"observed_at":"2026-08-06T18:59:27.535124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:27.011699Z","title":"Cluster-guided contrastive graph clustering network","venue":null,"work_id":"21506456-5200-4ec5-b4c3-da7dbe0e2272","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:22.004606Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:24ef752cec8ce8b75cead3d7cbc0ea35eed7a7d89c40a7655bb743caec135a31","observation_id":"01bb6a36-cfc6-48af-9dc5-4e2bf0398f74","resolution":{"observed_at":"2026-08-06T18:59:27.283053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:26.692704Z","title":"Z., Liu, X., and Zhu, E","venue":null,"work_id":"9ea3c98c-f1f4-4e2f-b38e-2d2b0b18b4ee","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:22.161075Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:3b9feaeb7aad37a61bf935f1c4b4a681ed7380519d3eb931405b6c618abe1cd5","observation_id":"2437a9dc-2acb-43a3-92d4-2ca574852f8c","resolution":{"observed_at":"2026-08-06T18:59:26.850117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:26.330378Z","title":"Mixed graph contrastive network for semi-supervised node classification","venue":null,"work_id":"971fc1bd-43f5-4216-aa72-8cc4e6a7eee8","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:22.366167Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:56fd864f1cfa2c0fb2b63ef4ad8479cdce1bca45e833b950ea582d5b98fe1edb","observation_id":"b07531ce-ddcf-490d-aac5-5d0b78be71b6","resolution":{"observed_at":"2026-08-06T18:59:26.497789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:25.918347Z","title":"Dynamic spiking graph neural networks","venue":null,"work_id":"8e343658-5dcf-4dbf-b9df-a390dcbe442b","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:22.538488Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:1a0a87156001cdebc9f1f66f743226ea4ee920ea25e6155449500181f59f866d","observation_id":"c7d06746-5dab-4d11-8e14-d765f34d4c57","resolution":{"observed_at":"2026-08-06T18:59:26.119689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:25.460217Z","title":"Accurate node feature estimation with structured variational graph autoencoder","venue":null,"work_id":"6f3f5ca1-809f-4cbd-b63f-4c6a1c19d625","year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:22.804577Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:f0809fecb72e07aa22fb38a408eb81f989bc8bb15d909bc7e23a6a9feca075cd","observation_id":"d2f3ad5d-09f0-44d6-a1a7-ecb48d8ef2a0","resolution":{"observed_at":"2026-08-06T18:59:25.678842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:25.044519Z","title":"Sparse low-rank multi-view subspace clustering with consensus anchors and unified bipartite graph","venue":null,"work_id":"e1019a6e-fd5b-412b-887f-757b56b2321e","year":2023},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:23.050560Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:8f42dd07275de1d33db10003be95420ecc397ea49657c78419b8a846c9e216a7","observation_id":"e9bb0587-caea-4776-8538-4a0819f183bd","resolution":{"observed_at":"2026-08-06T18:59:25.235039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:24.583631Z","title":"Towards resource-friendly, extensible and stable incomplete multi-view clustering","venue":null,"work_id":"060eb53e-997d-48f5-b9cc-20eb5e726027","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:23.204883Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:efdf1ac83107bbf113717687da79b5065d4e885f5e21f20e90b73e85bda13e2b","observation_id":"1d125b78-a248-4f0a-91c6-fcf45be43723","resolution":{"observed_at":"2026-08-06T18:59:24.800744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:59:24.227690Z","title":"A non-parametric graph clustering framework for multi-view data","venue":null,"work_id":"5c588347-12a1-4014-aad5-2fa604ba3be6","year":2024},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:23.456665Z"},"links":{"citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:6e5e2dce813165e466ce782bbf179dc685253c5e1ef40d85432309b1e227f5bd","observation_id":"baf69ecb-a160-4e1b-9cc5-2f345dcd6dea","resolution":{"observed_at":"2026-08-06T18:59:24.406989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-05T00:16:40.110456Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-06T18:59:23.667922Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:23.667922Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:e115002ee09f75c6f892e5189bc5dfc617ced9ce7631b8ad6a30c004c555bd63","observation_id":"bc23273a-296e-496f-9c60-4ae78a3547cb","resolution":{"observed_at":"2026-08-06T18:59:23.667922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-05T13:22:44.473317Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-06T18:59:23.894061Z","title":"Deep graph contrastive representation learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:23.894061Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:b12c6fb849af88533f879704fd04a21c2d911f331277eb0b0fa46db5379a4296","observation_id":"6ca626d8-8d4a-46d8-9cff-222dc2674d60","resolution":{"observed_at":"2026-08-06T18:59:23.894061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-06T18:50:33.528644Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":53},"total_outbound_references":68},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 0 inbound Pith citation observations for arXiv:2507.13368."}