{"as_of":"2026-08-07T03:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a43517258d9069f0f17505eab45eee6deb33172f718e339651a5f337f47c7085","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-14T00:42:06.161506Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2603.29148/citation-record","integrity":"/paper/2603.29148/integrity","json":"/paper/2603.29148/citation-record.json","paper":"/paper/2603.29148"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalizing graph neural networks on out-of-distribution graphs","venue":null,"work_id":"ca926712-3ace-4eed-8e50-c015c8311549","year":2023},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ec31347ad97c7e60bcd3643084437648b57f708c4dd0e6b0f9a813dffc1df8d4","observation_id":"12484c0e-7caf-4808-b916-a1c80a72ae87","resolution":{"observed_at":"2026-05-14T00:43:32.509462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Arbitrary- order proximity preserved network embedding","venue":null,"work_id":"e375b2fa-2530-4ea5-914c-4de7d6571aab","year":2018},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:3349c7baba53c7085da337dd226ffafbbd994e2cfa40ebc59b8aa9d02962cb6f","observation_id":"f0718b34-5848-4ebb-977b-6065e794fc8a","resolution":{"observed_at":"2026-05-14T00:43:32.325837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Parallel and distributed graph neural networks: An in-depth concurrency analysis","venue":null,"work_id":"b72e3bf8-357e-4dd5-9200-de4ab12d6d7d","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:f98884897e941d357a3fde57628398e0fcca3d75eba4952e3dd6422dbe8dddbf","observation_id":"985715da-ab9d-4fef-82e3-51cd8ac43f70","resolution":{"observed_at":"2026-05-14T00:43:32.321338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Es-gnn: Generalizing graph neural networks beyond homophily with edge splitting","venue":null,"work_id":"61b49693-7286-401b-8701-36f4f2c416ef","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:7b6ec333ff69371481a32af3d396e39830cac474b051ac00667b9ae15c497280","observation_id":"b640f2a3-2c8e-41ad-980c-3f263fc4e9e5","resolution":{"observed_at":"2026-05-14T00:43:32.471688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A survey of graph neural networks in real world: Imbalance, noise, privacy and ood challenges","venue":null,"work_id":"b75bf785-c727-42d9-80e1-f7956ab915a9","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ae862d042738058d60317055a03ab2b244450022d5df24e3b6b9689ba6016e46","observation_id":"c2e4c59f-c8b5-481b-8e95-0280b987ff0a","resolution":{"observed_at":"2026-05-14T00:43:32.458170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Improving social network embedding via new second-order continuous graph neural networks","venue":null,"work_id":"85fc46cc-efa2-4c61-a95c-c908041ad767","year":2022},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:d378ca0810bfb97f4475f705229e346fb7806b4159c6a69e5f250b2e2ba3a4a9","observation_id":"e725677f-f079-4660-adcd-dd25c4f9ee45","resolution":{"observed_at":"2026-05-14T00:43:32.183349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Non-euclidean mixture model for social network embedding","venue":null,"work_id":"44ede0e1-e829-4611-8575-261f28df4577","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:c1066db0edfa354413e286c01822c01e5e9eb79e74b41a3ab2f9723fd0c76c07","observation_id":"91d23623-e0af-4f8f-8d7f-6bbb5671bea0","resolution":{"observed_at":"2026-05-14T00:43:32.297894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Lgb: Language model and graph neural network-driven social bot detection","venue":null,"work_id":"491f4a25-3705-47d4-9b19-db80ecf809d6","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ab68f9be226bce657d937854b667173b6d354e7173a24de77d01fb6f1ec64b13","observation_id":"4d2cff29-8eba-461e-a852-09bd9b7e4a86","resolution":{"observed_at":"2026-05-14T00:43:32.224638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Efficient correlated subgraph searches for ai-powered drug discovery","venue":null,"work_id":"f926421e-6bf4-41dc-a0fa-16178ad68b75","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:3d3e04e61262687208db30948a6391a78a96a45f6fbd6962ab489531ded58d9f","observation_id":"bd3f08c0-23e3-4047-878b-7d6faff53ef8","resolution":{"observed_at":"2026-05-14T00:43:32.361631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph neural networks for recommender system","venue":null,"work_id":"235e9090-ecb7-4306-a4ee-4030743c9101","year":2022},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:c8ce52eaa0888d3858abccbf3f6bc6dbe3b72112ce73df02e6fc9dba09e2243d","observation_id":"8e54a57b-1f99-476c-8dd1-2d59f8e8b122","resolution":{"observed_at":"2026-05-14T00:43:32.356855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Noise- enhanced graph contrastive learning for multimodal recommendation systems","venue":null,"work_id":"aee2a506-6869-4852-b229-483b34eb5acc","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:52a89a8feaddb72b88c0803115d268f12e42482a08e8f5317a9a95237bc24f28","observation_id":"a1dd8126-0ea5-4819-bcc0-9e3414b96294","resolution":{"observed_at":"2026-05-14T00:43:32.334259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Improved diversity-promoting collaborative metric learning for recommendation","venue":null,"work_id":"51684bc2-40fc-498b-9ee8-bd4a84ab9696","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:577fe9a25f424c2d96d1ede0048810436aa063730c474e6e5f17cf56b398d4c3","observation_id":"1db72c87-311d-44a7-8996-1c3771102a73","resolution":{"observed_at":"2026-05-14T00:43:32.488403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A survey of knowledge graph reasoning on graph types: Static, dynamic, and multi-modal","venue":null,"work_id":"96027d00-e960-4bab-a9f9-6e20a8c60693","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:819bb7ee016bf5215ad1d102eb0aa59247a9443e9ebb2982b8e625c6017fd90a","observation_id":"5e300746-f2e2-47d2-b86e-b66e2de779c8","resolution":{"observed_at":"2026-05-14T00:43:32.343958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Improved deep embedded clustering with local structure preservation","venue":null,"work_id":"6b587b2d-b729-4f78-905f-d781038dc121","year":2017},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:e854b2bd759d8b82a603af8abf42954986c40c9c0cbfee02790cfd21c55aaf89","observation_id":"591c0535-89e0-4b84-a675-53c5e08dfc87","resolution":{"observed_at":"2026-05-14T00:43:32.478516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-11T02:57:58.697242Z","title":"A comprehensive survey on graph neural networks","venue":null,"work_id":"d6e48d96-8e44-4df5-bf45-c5c2b3f8a059","year":2020},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:b5b7f685b9f7166e2086e737e71b7f83075efe1687858ff0b1d91047fc65747b","observation_id":"7a96ac12-be20-4a20-be41-5a90224faf8c","resolution":{"observed_at":"2026-05-14T00:43:32.384336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6203","last_updated":"2014-05-21T16:27:09Z","snapshot_observed_at":"2026-07-06T03:31:33.797310Z","submitted_at":"2013-12-21T04:25:53Z","title":"Spectral Networks and Locally Connected Networks on Graphs","version":3},"cited_work":{"arxiv_id":"1312.6203","doi":"10.48550/arxiv.1312.6203","metadata_source":"pith","pith_arxiv_id":"1312.6203","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Spectral Networks and Locally Connected Networks on Graphs","venue":"cs.LG","work_id":"ee51617a-8088-4c37-9862-f5b69065b817","year":2013},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"cited_paper":"/paper/1312.6203","citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:bd95779b0cd1933edf29498a8e8f5496896e1fb05623aec0999d4636561e4560","observation_id":"9e331957-e5bb-42f9-8429-8dc90febcfc3","resolution":{"observed_at":"2026-05-14T00:43:31.980679Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":"1609.02907","doi":"10.1039/d0cp00305k","metadata_source":"pith","pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","venue":"cs.LG","work_id":"21fff118-807d-49cd-8229-f7087ba57b5d","year":2016},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ef0b8e158b89115e94be882ba853c7a5b47dda5141a3d74275746d45ec6d90b7","observation_id":"455388a8-19f7-464e-92a6-4deb82d4eff1","resolution":{"observed_at":"2026-05-14T00:43:32.008833Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T12:52:29.974672Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"067740db-7fd5-4272-b7ea-6435c8172ebd","year":2019},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ce732410fb92f94b0ae33eb5dd8bee798989825eb0a209b548c108a8e3804726","observation_id":"f73c3801-e2eb-4415-962f-bbf9c5379e5e","resolution":{"observed_at":"2026-05-14T00:43:32.310009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Structural deep clustering network","venue":null,"work_id":"06169cdd-5713-4c42-9cbd-f71b67ad7753","year":2020},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ab24398a9f9601960ec543458d2d00e86e75e58c6a5323e74e733407105a852a","observation_id":"f6ecf189-b478-4c11-a09a-c9c704979db6","resolution":{"observed_at":"2026-05-14T00:43:32.348102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Cohesion: Composite graph convolutional network with dual-stage fusion for multimodal recommendation","venue":null,"work_id":"9c47a225-002e-4333-8657-14d421379530","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:9ebb22902f70a132ea17dbac8b13324c1eacaff87ad886aadd2adb93fcc9c5a4","observation_id":"421cae3b-3f83-48c5-9ac3-6474884d1c58","resolution":{"observed_at":"2026-05-14T00:43:32.305979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Irregular traffic time series forecasting based on asyn- chronous spatio-temporal graph convolutional networks","venue":null,"work_id":"7b0e8edf-a4f3-4abf-80eb-298bfa7eca77","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:c79d81ec7050056eaf453b3f0c4714038c1d3f25ff91cd7475ab0f863903b086","observation_id":"f9e5f81c-4aad-470d-8d1f-b1fd59228ef4","resolution":{"observed_at":"2026-05-14T00:43:32.500755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T19:35:33.168715Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"c1f7205b-cb20-42f8-a052-fdfc16e87f07","year":2017},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:e260a376b205b201bce7b1f5c07b9ee00ee2c95f482ed1a89bbfbfee0adac542","observation_id":"269be200-7a42-4c24-9a29-0beed88390f9","resolution":{"observed_at":"2026-05-14T00:43:32.405222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Stochastic training of graph convolutional networks with variance reduction","venue":null,"work_id":"e04dc167-f6fb-420f-87c9-3c4833d68bf7","year":2018},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:fcc346d19efe1d403e3f8d29407355fa1b483c6ed72792ef7edde8db8311a524","observation_id":"e9b66389-9d83-4dac-9085-c602255f441c","resolution":{"observed_at":"2026-05-14T00:43:32.248495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fastgcn: Fast learning with graph convo- lutional networks via importance sampling","venue":null,"work_id":"505852d3-6b80-41d9-b0d9-a422102246e9","year":2018},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:b51d96ec35dbfb0bcb7a0617bf9be8dac755d8c10673aebaf643c8795d9132db","observation_id":"3c2a0261-91f1-4a9f-8df4-0de11ff6e270","resolution":{"observed_at":"2026-05-14T00:43:32.142489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Adaptive sampling towards fast graph representation learning","venue":null,"work_id":"3d3c67f6-e0ae-4c5c-b514-4366ed05a4c7","year":2018},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:47cc8e894ccd4f58a1cd529593ca93c34a6aef9db3a710910060ff0a69571977","observation_id":"36561b65-ec90-4bcf-9ffc-c3dc1af4f16c","resolution":{"observed_at":"2026-05-14T00:43:32.330211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks","venue":null,"work_id":"69f38696-3db1-4dc1-a18d-dc2e542d4065","year":2019},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:cf56ab6e29b19a272663c26ad76039df3d0df461bdbffee02ed56b23d2360b72","observation_id":"33cd537e-df63-48c0-b1cc-a7b706c16423","resolution":{"observed_at":"2026-05-14T00:43:32.277097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph- saint: Graph sampling based inductive learning method","venue":null,"work_id":"6154a45c-24c9-4c42-8e84-b8ee05f5375c","year":2020},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:9dd56b56cf7287bb96dc2b0d38ea70f9b5ccb0764732ba4a048cf19b82f9abb9","observation_id":"ea1288c9-6373-4aa3-8df3-363e756033f7","resolution":{"observed_at":"2026-05-14T00:43:32.242295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07580","last_updated":"2022-09-27T20:48:28Z","snapshot_observed_at":"2026-08-06T13:30:56.299615Z","submitted_at":"2021-10-14T17:42:14Z","title":"Graph Condensation for Graph Neural Networks","version":4},"cited_work":{"arxiv_id":"2110.07580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.07580","snapshot_observed_at":"2026-07-02T12:26:56.812714Z","title":"Graph condensation for graph neural networks","venue":null,"work_id":"dd2205d9-9f8d-483d-b7d1-fff344c96ebb","year":2021},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"cited_paper":"/paper/2110.07580","citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:eb89104f9991571b8093119ef53e8239fb634db201ae8544454c024b604becd4","observation_id":"6470d34f-f05b-4f23-9008-074e25c8ce81","resolution":{"observed_at":"2026-05-14T00:43:31.962748Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Scaling up graph neural networks via graph coarsening","venue":null,"work_id":"d8d2952c-bf39-4410-825d-1be9aa380c14","year":2021},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:80fc54147fbc162184fdc94f46d18bdd117f509066de26ea80df642475f5f48f","observation_id":"d7dd3db8-334a-411f-b80b-8214b10fea9f","resolution":{"observed_at":"2026-05-14T00:43:32.288340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph pooling via coarsened graph info- max","venue":null,"work_id":"ca5b50d2-19a5-4f7c-8570-34aa7d9b65b0","year":2021},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:150990f4a8287a94500bb41e39913f35997e8c63d24b20c254af538ce45c2e8a","observation_id":"87cfa4eb-9f87-456f-b4e3-1c2a499e0f4f","resolution":{"observed_at":"2026-05-14T00:43:32.395815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph coarsening via supervised granular-ball for scalable graph neural network training","venue":null,"work_id":"cbc8a10a-8673-456f-ae22-0ee00df06fa5","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:74437fb2b8369fec1c5d03dd92aea063647cd970cbde25e81d529de18ccdb055","observation_id":"89109c69-e457-4ae7-ba5d-a62ab87d67e2","resolution":{"observed_at":"2026-05-14T00:43:32.466445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Gbgc: Efficient and adaptive graph coarsening via granular-ball computing","venue":null,"work_id":"9874399e-e7e0-4547-958b-d4fa2c8bbd6d","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:4a850518709ebe454f9e4171929c469839238eb51791d6c633b8a4d6efc23a07","observation_id":"3bde91c7-8fca-447d-8442-791d9737ba4c","resolution":{"observed_at":"2026-05-14T00:43:32.206238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A fast and high quality multilevel scheme for partitioning irregular graphs","venue":null,"work_id":"5a565888-8cdb-4fc4-b397-c7ad93b1b995","year":1998},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:6f66c179b54b1c511ed49a77c5b26cdfb46d68e95211320863efaed04f72ddcf","observation_id":"00f267b4-294f-45cb-a5ed-76c92f14b422","resolution":{"observed_at":"2026-05-14T00:43:32.301897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph convolutional neural networks for web-scale rec- ommender systems","venue":null,"work_id":"a6ed8e63-90f3-447f-a596-b0518914081f","year":2018},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:22093fbc6584c5811c8c0658c58b8f955262bf1cb44e9fb4172ef73358bb82e6","observation_id":"796b2417-8077-463c-8ad0-3af37d3600f7","resolution":{"observed_at":"2026-05-14T00:43:32.229249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Featured graph coarsening with similarity guarantees","venue":null,"work_id":"7e6573b1-688b-4d7f-80da-5754dbd69bbc","year":2023},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:cbb6c0fab83c95f617df96e613a333ee4e4d858fb3ff3aa9c0a3982cb045ab95","observation_id":"69a9a795-bdfd-45a4-b894-109f8c086884","resolution":{"observed_at":"2026-05-14T00:43:32.195417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Condensing graphs via one-step gradient matching","venue":null,"work_id":"14cb43ff-94af-4814-a473-739e0d8d9a2b","year":2021},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:4a9e0406967b15483d3e812599325a271ca45739a5dc62fa9eaef5d0b96b3ff8","observation_id":"aa7b9ede-fbee-4869-b272-0e4482c6a5e8","resolution":{"observed_at":"2026-05-14T00:43:32.147013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph coarsening via convolution matching for scalable graph neural network training","venue":null,"work_id":"fe1ca6b9-4e2e-44fd-81b6-7cee38fa936f","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:e906c83852a24e7c786a1ef1fb34ae8f7a7aff2cb9df8f3c71f4a364007732ea","observation_id":"36801ebf-c60a-4225-ab19-c144c4e251b6","resolution":{"observed_at":"2026-05-14T00:43:32.380083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Topological structure in visual perception","venue":null,"work_id":"7b2908d6-2ccf-4dc6-b7b3-155913ea0313","year":1982},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:99b87285419d0333d20d315919ba2060a14ed16f4db48d0863c6299d99f62591","observation_id":"d866e1aa-6449-4728-89ef-fcf681764d72","resolution":{"observed_at":"2026-05-14T00:43:32.272994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11171","last_updated":"2026-06-29T14:16:40Z","snapshot_observed_at":"2026-07-06T15:18:30.127408Z","submitted_at":"2023-04-21T03:26:29Z","title":"Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method","version":5},"cited_work":{"arxiv_id":"2304.11171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.11171","snapshot_observed_at":"2026-06-30T17:24:57.237229Z","title":"Granular-ball computing: an ef- ficient, robust, and interpretable adaptive multi-granularity representation and computation method","venue":"cs.LG","work_id":"40042406-6786-4315-b5e9-e5d7dcd36a0f","year":2023},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"cited_paper":"/paper/2304.11171","citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:d080a18ee74dd4a9eda9e7c084e9223c483ab3ae0f41f23daf32ee2b40dc6c4c","observation_id":"86173a06-9f2c-4260-b62c-87612a92d09f","resolution":{"observed_at":"2026-06-30T03:18:04.069821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Ballkk-means: Fast adaptive clustering with no bounds","venue":null,"work_id":"8e116b1b-f6c2-4da0-a60d-5ef594e4f8bf","year":2020},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:e30fa67339f671caf665df8a6d82ca84a84283ff237e634a070138a22cbaa66b","observation_id":"09967b5b-ed70-4b86-991b-658802c3159f","resolution":{"observed_at":"2026-05-14T00:43:32.260342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Gbrs: A unified granular-ball learning model of pawlak rough set and neighborhood rough set","venue":null,"work_id":"d00476f6-c5ab-453c-ad51-be9f8936e3e3","year":2023},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:445b8bc1114aae04af766c9fb51fd1737777ba598eec413ced24ca31abea8b1a","observation_id":"2e53386c-ffef-442d-8355-db9e21e2299f","resolution":{"observed_at":"2026-05-14T00:43:32.388159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Gbsvm: an efficient and robust support vector machine framework via granular- ball computing","venue":null,"work_id":"708182ce-584b-455a-b349-0f7a904a8773","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:7c7af6092d9bbbd52533f4355c250ea429cf114faf92c0c3dacc8c301a959115","observation_id":"3e5a7a5b-5e06-4612-887f-e4ebdecea7f3","resolution":{"observed_at":"2026-05-14T00:43:32.352945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Unlock the cognitive generalization of deep reinforcement learning via granular ball representation","venue":null,"work_id":"01259ba7-2c45-4edf-b042-513a201140d1","year":2024},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:fe088c4f3518e5032a4d6dcc5bca8e3f38ba56593e8bcc7c890f3dd91d8a05a9","observation_id":"607b2a3a-4947-4303-bc67-3253594fbfa5","resolution":{"observed_at":"2026-05-14T00:43:32.497114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Aw-gbgae: an adaptive weighted graph autoencoder based on granular-balls for general data clustering","venue":null,"work_id":"846a3337-b8ca-447d-9944-24d20cc10f33","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:0038a15fb79360df018dcb5c310c90621d50f0e60061fa197a2fbbe62944e90a","observation_id":"4443d659-2428-48e3-a09c-e457085240b9","resolution":{"observed_at":"2026-05-14T00:43:32.161914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Efficient quantum approxi- mate knn algorithm via granular-ball computing","venue":null,"work_id":"efb810f4-1822-4704-b0c7-d793837cc258","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:6bb528d74afb2e0cda1035273c9c58845370a6ecf78d4fece02287841ad2d3b1","observation_id":"2b731562-7a76-45b8-a56c-fd1b51fd1e80","resolution":{"observed_at":"2026-05-14T00:43:32.293879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Granular-ball-induced mul- tiple kernel k-means","venue":null,"work_id":"50eb1347-1231-4c85-bb34-97fe74a823a7","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:6f1dd0ca80af32330220c26360b12805f6d29a218bd0a25edd404ae4d57995ee","observation_id":"926e5128-99f1-4e45-9bf0-1803455829a6","resolution":{"observed_at":"2026-05-14T00:43:32.450423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"An adaptive multi-granularity graph representation of image via granular- ball computing","venue":null,"work_id":"05283572-8e4f-4c84-a1f3-d0e2afcc37a1","year":2025},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:d0f90f9bbe9f406e078be340606e62453c72565abd68333e1d182dd2a42b81e7","observation_id":"c8274c9f-ab7e-43e3-9be4-3613061c28b7","resolution":{"observed_at":"2026-05-14T00:43:32.313670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Rectified linear units improve restricted boltz- mann machines","venue":null,"work_id":"d627939c-db60-4636-a229-4b5c7cf1de3a","year":2010},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:9ae8d93d52610bc417a46bdb08ee2fb86eea7cf9d20561dad58db361979e9e82","observation_id":"757f5cee-d930-4443-baab-5b2177e3dc2b","resolution":{"observed_at":"2026-05-14T00:43:32.392559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A new internal index based on density core for clustering validation","venue":null,"work_id":"f1da1ba0-2a43-40b5-87ce-bf165cc4579b","year":2020},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:0e745d029a1e32657312f41cf5b6514ff442fd805e95f9d72053687170047b8b","observation_id":"a25ce333-cbb1-4cf6-8198-def5eecac493","resolution":{"observed_at":"2026-05-14T00:43:32.337884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The upper bound of the optimal number of clusters in fuzzy clustering","venue":null,"work_id":"a1575b66-4bad-4dbe-9f2e-5d74e3e02990","year":2001},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:bf407849ec8ce42aa2dab60bd16035df50d9bdec900713f95f1f39693e4a4736","observation_id":"9055375d-0886-473b-9b23-ef5fd8503fa3","resolution":{"observed_at":"2026-05-14T00:43:32.151110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01350","last_updated":"2021-02-02T06:50:07Z","snapshot_observed_at":"2026-07-06T10:37:43.118444Z","submitted_at":"2021-02-02T06:50:07Z","title":"Graph Coarsening with Neural Networks","version":1},"cited_work":{"arxiv_id":"2102.01350","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.01350","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph coarsening with neural net- works","venue":null,"work_id":"446624e0-8641-4487-9f72-66f0b4deac8f","year":2021},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"cited_paper":"/paper/2102.01350","citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:c30a73bd5626f162301593952ff41904fc720be612012fe7823ede30f9b4158e","observation_id":"c186d4ff-9e65-4c2f-b9e4-b57b88a75612","resolution":{"observed_at":"2026-05-14T00:43:31.971769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Relaxation-based coarsening and multiscale graph organization","venue":null,"work_id":"867717f1-d219-4c0f-9777-a630ca832c27","year":2011},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:e9a0392649b9b7e90d6e910947970eb25c03fbbc5e8652bdfc31af89a023e0ed","observation_id":"73a44de9-8b65-4fd5-b07d-ebbca7319b34","resolution":{"observed_at":"2026-05-14T00:43:32.400401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph reduction with spectral and cut guarantees","venue":null,"work_id":"9aadd16c-0b51-40ed-81a9-c0778574dc9c","year":2019},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:ce58ecade381ea91b528b3ce33c392f2453ebad9741842ed8dde8b6248003fa2","observation_id":"6e6c426b-f4a5-4265-a1a8-614b59e0e2a6","resolution":{"observed_at":"2026-05-14T00:43:32.170006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":"1710.10903","doi":"10.48550/arxiv.1710.10903","metadata_source":"pith","pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-07-11T01:47:47.523783Z","title":"Graph Attention Networks","venue":"stat.ML","work_id":"7dd5bb04-b448-4f32-9719-5fc799641fd9","year":2017},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:cfb2feb67a400cbd0c55ce2db14b0b33b75bf697387fe2a66fd39856cb2bf5ed","observation_id":"06eb987e-5e9d-4038-b726-4cad5eff31a2","resolution":{"observed_at":"2026-05-14T00:43:31.998370Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Graph coarsening with preserved spectral properties","venue":null,"work_id":"5c2ea189-3d62-49d6-92d8-64ab9c0968ad","year":2020},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:224e59401eb8c32369ae41528d35d6b55d0112fb1ac1a6839f0631b842c4a814","observation_id":"f8731478-2b6a-4e1d-b66d-d2c2f5eb3d9d","resolution":{"observed_at":"2026-05-14T00:43:32.446393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A gromov-wasserstein geo- metric view of spectrum-preserving graph coarsening","venue":null,"work_id":"ab6b86f2-365d-4825-85dd-28e1a609ad74","year":2023},"citing_paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-14T00:42:06.161506Z"},"links":{"citing_paper":"/paper/2603.29148"},"observation_digest":"sha256:f22f23566666c7c1a9f590de2b989ebecb3c004f69f405beee8fc195e3be4243","observation_id":"764bb277-b1b1-45cd-96a1-cdec2a267564","resolution":{"observed_at":"2026-05-14T00:43:32.217326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2603.29148","last_updated":"2026-04-14T02:14:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T07:06:41.405626Z","submitted_at":"2026-03-31T01:53:56Z","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":6,"verified_fuzzy":50},"total_outbound_references":56},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2603.29148."}