{"as_of":"2026-08-15T19:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbc6e9696fe54c8a400b61b9696b1a6d6442d4f5ec79c760ff4dcda6bbd0fbbc","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:40:40.730035Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:04:32.539100Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.19224","snapshot_observed_at":"2026-08-01T13:04:32.539100Z","title":"Gbgc: Efficient and adaptive graph coarsening via granular-ball computing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26578","last_updated":"2026-07-29T07:57:17Z","snapshot_observed_at":"2026-08-14T14:15:52.852796Z","submitted_at":"2026-07-29T07:57:17Z","title":"3DGBGS: 3D Granular Ball Gaussian Splatting for Compact Novel View Synthesis","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T13:04:32.539100Z"},"links":{"cited_paper":"/paper/2506.19224","citing_paper":"/paper/2607.26578"},"observation_digest":"sha256:3579a92bf8ea61898273d390244bc0aca00bd7ee662acbdd550ba760f789fcfb","observation_id":"14936ecb-e1cb-4810-bf8d-56529d91efd1","resolution":{"observed_at":"2026-08-01T13:04:32.539100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.19224/citation-record","integrity":"/paper/2506.19224/integrity","json":"/paper/2506.19224/citation-record.json","paper":"/paper/2506.19224"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.316510Z","title":"Fast unfolding of communities in large networks","venue":null,"work_id":"cdfd9120-c15a-4e9f-8b24-ce12aa1d1860","year":2008},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.445931Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:1abc4759b15c9474de332e342531816b3a6d013d41024262dca005cca25e548b","observation_id":"fe03be35-9f5b-481c-86ef-c92dcc791879","resolution":{"observed_at":"2026-08-15T18:40:41.321051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.202307Z","title":"Faster graph embeddings via coarsening","venue":null,"work_id":"dbb6d2f6-0c35-4c65-ba69-e193ff8725ec","year":2020},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.487009Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:150ade9d2c3b5d43a8ffe2309e7cbf2d6d60d6e348ff1ca18659336f59c247f9","observation_id":"ca4b6e2f-d49b-46b2-9279-c3de99df458a","resolution":{"observed_at":"2026-08-15T18:40:41.206733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.05584","last_updated":"2018-04-10T15:26:32Z","snapshot_observed_at":"2026-08-14T20:32:30.604942Z","submitted_at":"2017-09-17T00:19:33Z","title":"Representation Learning on Graphs: Methods and Applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.05584","snapshot_observed_at":"2026-08-15T18:40:40.501549Z","title":"Representation learning on graphs: Meth- ods and applications","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.501549Z"},"links":{"cited_paper":"/paper/1709.05584","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:a6468c7603c310662fc26f221a759ff697429a6ba532fb41935ffcbbe772bc7b","observation_id":"b7b7e73c-2c0c-4163-9217-69216b6e00bd","resolution":{"observed_at":"2026-08-15T18:40:40.501549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-14T10:07:31.700526Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-15T18:40:40.505302Z","title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.505302Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:238be3de33ffe66772308d204c85e3d763cdd9e30c158a77ae7746209b35247c","observation_id":"03cf1d30-d7ea-4e79-9d75-8d2b67754c27","resolution":{"observed_at":"2026-08-15T18:40:40.505302Z","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-15T18:40:40.508899Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.508899Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:36c00e3164fbda8f3556e10b2625cb139c7206cf968fe01de17f11d6a3bd9275","observation_id":"822e99bf-c077-4b50-a7b6-93a44edeef98","resolution":{"observed_at":"2026-08-15T18:40:40.508899Z","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-15T18:40:41.159112Z","title":"Scaling up graph neu- ral networks via graph coarsening","venue":null,"work_id":"2201671e-99bf-4660-8363-2f60609fbb25","year":2021},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.512148Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:d70f6909b44c440cfdd33978c08a63e6a014c7320850cdb97bebb3faa7d2dc47","observation_id":"7f7984ed-6936-42ca-93fb-c20ffe4e3499","resolution":{"observed_at":"2026-08-15T18:40:41.163250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.147208Z","title":"Spectrum- preserving sparsification for visualization of big graphs","venue":null,"work_id":"da42ad94-587f-40be-bdd2-bff112f2e3a3","year":2020},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.515263Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:301d2da9b021c5eb732410daacf6b2690ca086bfb3bf12148c9124a5e6880411","observation_id":"485d8803-3ada-43f6-b695-8e0a73562fc4","resolution":{"observed_at":"2026-08-15T18:40:41.151508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.135151Z","title":"Graph coarsening with preserved spectral properties","venue":null,"work_id":"a2d093a5-f2a3-4d98-881e-1d4f3161e149","year":2020},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.518478Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:cc20f1c9a325d7b0f1c6362bb09ca1c7c2e294742a241275961c2050ba9ce68f","observation_id":"c78a3844-79b9-4c55-b41a-8b4af67e3724","resolution":{"observed_at":"2026-08-15T18:40:41.139173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07580","last_updated":"2022-09-27T20:48:28Z","snapshot_observed_at":"2026-08-10T16:57:58.335004Z","submitted_at":"2021-10-14T17:42:14Z","title":"Graph Condensation for Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07580","snapshot_observed_at":"2026-08-15T18:40:40.522185Z","title":"Graph con- densation for graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.522185Z"},"links":{"cited_paper":"/paper/2110.07580","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:505397d616c0ca90fabbde7f65cb7ff234678bc63479b420076e2c306008d97a","observation_id":"3fda94a3-2dc0-4a90-ba01-3c4177e54839","resolution":{"observed_at":"2026-08-15T18:40:40.522185Z","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-15T18:40:41.124017Z","title":"Condensing graphs via one-step gradient matching","venue":null,"work_id":"62101b35-b8e2-4ebc-8e75-815dae186ef2","year":2022},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.526014Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:aede5f43a1b3fc904464157a6d559f121b8d11e9de611e54284420cafcf6f40e","observation_id":"5b336a7d-1d60-4f68-806c-9e75a1e72c00","resolution":{"observed_at":"2026-08-15T18:40:41.127971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.113422Z","title":"Analysis of multilevel graph partitioning","venue":null,"work_id":"b327a20e-9572-4ff2-a57c-4068649a0c8f","year":1995},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.529684Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:dfbc5b9253116bd5c62f924f4ed2975c37a611ed75c1c7c6c9dfcd880a78e176","observation_id":"c392ae46-aa34-4816-b554-533d9007977d","resolution":{"observed_at":"2026-08-15T18:40:41.117241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.078066Z","title":"The link prediction problem for social networks","venue":null,"work_id":"e5a69b3f-7c44-4792-93f8-7b4e7f28f52a","year":2003},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.540040Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:a96d3292457d01c7c23160e21fde445a063aab34270afa170a4c9db5880e6434","observation_id":"636043ee-c468-4b93-8fa9-3956e7f54539","resolution":{"observed_at":"2026-08-15T18:40:41.082133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.053363Z","title":"Graph reduction with spec- tral and cut guarantees","venue":null,"work_id":"5d60a76a-861d-4008-8a14-ea0e1ecf9db3","year":2019},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.546787Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:dcd665aa94e55e3ff0b5451100d453cc09312cab4be3b77ef11fc5e9de995431","observation_id":"b38bfcd6-7db5-4c75-85db-15597d86766b","resolution":{"observed_at":"2026-08-15T18:40:41.057762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.040851Z","title":"Solu- tion of large-scale supply chain models using graph sam- pling & coarsening","venue":null,"work_id":"7a9f0f29-96fc-467e-adeb-b9088d35aed2","year":2022},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.661225Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:5e7e2e693855daaf0e102052fea5f84e9ddea5b55a0de51d47071f972cbb841d","observation_id":"89d5d490-2626-4c8b-9c90-470bd88a4e10","resolution":{"observed_at":"2026-08-15T18:40:41.045417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.028653Z","title":"Parallel graph partitioning for complex networks","venue":null,"work_id":"2580fece-d130-49fe-9996-672499ec1d92","year":2017},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.665120Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:33203c4237bd70d13604c3882d79fca1c79240d6f4c6888a7be9780ba8167d21","observation_id":"39f976c4-f213-4fbd-8b24-bfad5af87dd1","resolution":{"observed_at":"2026-08-15T18:40:41.032910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08663","last_updated":"2020-07-16T21:46:33Z","snapshot_observed_at":"2026-08-13T19:42:12.787378Z","submitted_at":"2020-07-16T21:46:33Z","title":"TUDataset: A collection of benchmark datasets for learning with graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08663","snapshot_observed_at":"2026-08-15T18:40:40.668521Z","title":"Tudataset: A collection of bench- mark datasets for learning with graphs","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.668521Z"},"links":{"cited_paper":"/paper/2007.08663","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:d4d71ee864d4dee41bfb70a27d6c7dec48d529efe85cab234ec236e00475596e","observation_id":"7490aa8b-93fd-4e00-8170-44e3e64e5f42","resolution":{"observed_at":"2026-08-15T18:40:40.668521Z","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-15T18:40:41.015311Z","title":"Graph pooling via coarsened graph info- max","venue":null,"work_id":"4881a00a-d809-4502-9869-735634a9818d","year":2021},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.672109Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:58b419800ec5457ad7d28f4dc595450e4e6bb4ffd101c5870749574e203c290f","observation_id":"8d7559cc-d720-4d63-a98b-08f6301d1329","resolution":{"observed_at":"2026-08-15T18:40:41.019561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.003111Z","title":"An efficient multilevel scheme for coarsening large scale social networks","venue":null,"work_id":"3a326829-86dc-4372-9a49-6ff200827517","year":2018},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.675620Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:50ff88e925320b0cee2522a6d07628a8bb92e10c960887c6fcee7768e8e4c4bf","observation_id":"feb0e498-ba5d-4021-9024-446a2911f754","resolution":{"observed_at":"2026-08-15T18:40:41.007822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.991127Z","title":"Maps of random walks on complex networks reveal community structure","venue":null,"work_id":"f8a4d6ea-3e94-4c2c-af48-5cfd2fd7cdf7","year":2008},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.679288Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:4419c7eafcc38dcf1dca723cbc7344e2ac42bf0d8a674c0dde3dbb94d419cd59","observation_id":"152dc4c0-c0e3-4d5d-96a4-b09d56b65e71","resolution":{"observed_at":"2026-08-15T18:40:40.995514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.979004Z","title":"Advanced coarsening schemes for graph partition- ing","venue":null,"work_id":"1129073f-0344-47e4-9c0a-bb683397385a","year":2015},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.682816Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:63551f4477b01d08852b19660d2b7936f9d1a3f828e5155afc3183192be7a4c0","observation_id":"66d36649-0b03-44a3-9347-1a273b77bd54","resolution":{"observed_at":"2026-08-15T18:40:40.983326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.954182Z","title":"Spline-fitting with a genetic algorithm: A method for developing classification structure- activity relationships","venue":null,"work_id":"c57e2df4-fc31-4591-951e-57fc13754e85","year":2003},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.690246Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:94088eb8eff5ba1bb185a77a6077a021e3e4e74042ffcc0c473821ef51f3e4ea","observation_id":"07723e5b-7f01-4084-8872-d1227aaa4c31","resolution":{"observed_at":"2026-08-15T18:40:40.958551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.943191Z","title":"Online graph dictionary learning","venue":null,"work_id":"28dd287d-53e0-4fe4-b554-c71fa27ea658","year":2021},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.694000Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:113b8f962b6917fc1515627093f896e2d78b504afce1978cb67eec61a338e5bc","observation_id":"7415031c-201b-48d4-8a12-d835ccdb474b","resolution":{"observed_at":"2026-08-15T18:40:40.946779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.931701Z","title":"Graph-based recommendation on social networks","venue":null,"work_id":"5fd7dc5e-39f0-4e69-98e3-385f0e1b39af","year":2010},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.697823Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:c017afb40e340808cdb10cdcb600aea573e2340ce058a520ae5a2e6dd4c7c943","observation_id":"9aff490d-81b5-4bc2-b8d3-682302244c66","resolution":{"observed_at":"2026-08-15T18:40:40.935665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.920182Z","title":"A study of graph spectra for comparing graphs and trees.Pat- tern Recognition, 41(9):2833–2841,","venue":null,"work_id":"18500704-73cc-46ee-b8b8-66bf80196b38","year":2008},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.705240Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:e93c430574807945f155ab21043e74e4d6a71b756511e788acb878114b4d50f5","observation_id":"b867f848-f9cb-491a-b308-255b6493ce04","resolution":{"observed_at":"2026-08-15T18:40:40.923963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.909561Z","title":"Granular ball sam- pling for noisy label classification or imbalanced classifi- cation","venue":null,"work_id":"3b073615-2f31-4a15-8562-27c1a921a9aa","year":2021},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.708822Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:c3bc0b2a4307a6a50b2812fb2152b9aa18eddd0cefb8f026eb921012e5e08261","observation_id":"2d08197e-4200-4cc6-8622-fd28d56e936d","resolution":{"observed_at":"2026-08-15T18:40:40.913355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11171","last_updated":"2026-06-29T14:16:40Z","snapshot_observed_at":"2026-08-13T11:58:21.044856Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11171","snapshot_observed_at":"2026-08-15T18:40:40.712291Z","title":"Granular ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.712291Z"},"links":{"cited_paper":"/paper/2304.11171","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:2d39ed5f37345acc13ac046749f7af967bfcb57cd83c68c7d8d2fd1ef0aef83c","observation_id":"1cd145c8-0900-4492-b4c4-ef0b6d82c1f5","resolution":{"observed_at":"2026-08-15T18:40:40.712291Z","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-15T18:40:40.898337Z","title":"An efficient spectral clus- tering algorithm based on granular-ball","venue":null,"work_id":"e118367d-7db3-49d0-8c5a-fcbb8d9ff94c","year":2023},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.715910Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:c346e02c543a9ba14e16d54ba1ce1ba4b44a0dbc99dd01a1964daafe4ad906cf","observation_id":"b8a026e1-8275-4568-ad69-b4468d65cdbc","resolution":{"observed_at":"2026-08-15T18:40:40.902096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-15T18:40:40.719546Z","title":"How powerful are graph neural net- works? arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.719546Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:018df551ca128cb47880719197e94665477581bca3489d9487a6960756a81c62","observation_id":"39a15043-7038-4b76-8476-f3fa055363d7","resolution":{"observed_at":"2026-08-15T18:40:40.719546Z","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-15T18:40:40.887010Z","title":"E-commerce search via content collaborative graph neural network","venue":null,"work_id":"c7d6b789-1c41-43df-81cd-9067bc8318a7","year":2023},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.723349Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:a28e91a487edcca91bf8048b08323e2712341eea979d1afd3abf1f890d3a7721","observation_id":"5adee6c1-afad-4dff-8a8d-2af8ca41158d","resolution":{"observed_at":"2026-08-15T18:40:40.890872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.872874Z","title":"The upper bound of the optimal number of clusters in fuzzy clustering","venue":null,"work_id":"a8cd5b71-83d6-4b75-b109-d373cabbb7a4","year":2001},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.726591Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:217807fd95e11e1a4d4be6adcacb2bbfd98657ae8324a647dd72bfaf8ea26e75","observation_id":"6ebee2b5-56c5-4ccb-a7e0-1e2120e6ce0f","resolution":{"observed_at":"2026-08-15T18:40:40.878690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.250399Z","title":"Improving the utility of the tox21 dataset by deep metadata annotations and constructing reusable benchmarked chemical reference signatures","venue":null,"work_id":"2c5b6c47-63e0-4ba5-8c94-3dda0b7cc57b","year":2019},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.473379Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:c67330ea640245d679f545deb24e48ec9af0914467ad6cdfa033245df8d76e2a","observation_id":"2f44992a-7295-4bf8-8122-39b1e064dc41","resolution":{"observed_at":"2026-08-15T18:40:41.254662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.226017Z","title":"Weighted graph cuts without eigenvectors a multilevel approach","venue":null,"work_id":"8714527b-1ba6-4352-b11a-77f2ef5481d0","year":2007},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.480003Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:17a40941522c45a4c2a8a55fe56bbd9689bf295578d39733974de18e479b8ff4","observation_id":"1875213a-3e81-4dbf-b89f-81c858285f81","resolution":{"observed_at":"2026-08-15T18:40:41.230185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.101175Z","title":"Image segmenta- tion using multilevel graph cuts and graph development using fuzzy rule-based system","venue":null,"work_id":"29a515b5-3520-4adc-995e-d88882ec4e47","year":2013},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.533352Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:fe8ef41fa77c9dfc6f7a1a01d7433446d5580ec1e4b1e13e4b76642767e811d5","observation_id":"a9da950c-c501-49ec-8c97-75e221ccf256","resolution":{"observed_at":"2026-08-15T18:40:41.106210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05929","last_updated":"2021-03-08T13:31:22Z","snapshot_observed_at":"2026-08-09T10:26:02.821053Z","submitted_at":"2020-06-10T16:30:52Z","title":"Dataset Condensation with Gradient Matching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05929","snapshot_observed_at":"2026-08-15T18:40:40.730035Z","title":"Dataset condensation with gradient match- ing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.730035Z"},"links":{"cited_paper":"/paper/2006.05929","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:1e44a2d72f8b02d134c1b3113bdf6bab90e16ac4d61411470ca2510644795342","observation_id":"ae0eb631-50bf-4862-8c93-51ecab261af6","resolution":{"observed_at":"2026-08-15T18:40:40.730035Z","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-15T18:40:41.065570Z","title":"Unlock the cognitive generalization of deep rein- forcement learning via granular ball representation","venue":null,"work_id":"bfe8289f-5b86-42a7-b27e-f13692611e16","year":2018},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.543460Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:a1ca7779378a44fc0c5c5c2253ad7c1bb05e4467a3eb81da8e1e8ca200c52ca9","observation_id":"1cabf165-8af3-41d7-9cf9-4d9f640b5999","resolution":{"observed_at":"2026-08-15T18:40:41.070042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-14T19:56:51.934037Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-08-15T18:40:40.454148Z","title":"A simple yet effective baseline for non-attributed graph classifica- tion","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.454148Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:45272021b827f41deeaba11e24eafea8b19990ef60c60f1f7c61c2580dee8c50","observation_id":"003001ad-08d4-4b6d-a443-a99cb64daeb2","resolution":{"observed_at":"2026-08-15T18:40:40.454148Z","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-15T18:40:41.214194Z","title":"A comprehensive study on large-scale graph training: Benchmarking and rethink- ing","venue":null,"work_id":"6c5d6d64-0897-4a73-8dc7-51a5319aad24","year":2022},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.483536Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:e4362b238aae3346284eac48932ccc3260f600138b592049ea18613cf1374ee7","observation_id":"7b51a391-006b-4e3b-b4cf-d5dbdabcc8e5","resolution":{"observed_at":"2026-08-15T18:40:41.218189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.304566Z","title":"Protein function predic- tion via graph kernels","venue":null,"work_id":"3ec4e6ca-d4d5-48be-a6f1-fc5d213320a9","year":2005},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.450341Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:49f059f02504f6dad5f549bb6f12ecc8fff6b126855fb905e10d918e3f19d75a","observation_id":"9314a32b-5059-4a6e-a032-435b60030582","resolution":{"observed_at":"2026-08-15T18:40:41.308780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10959","last_updated":"2020-02-24T23:25:50Z","snapshot_observed_at":"2026-08-15T02:56:10.149790Z","submitted_at":"2018-11-27T13:17:45Z","title":"Dataset Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10959","snapshot_observed_at":"2026-08-15T18:40:40.701376Z","title":"Dataset distillation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.701376Z"},"links":{"cited_paper":"/paper/1811.10959","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:b2161b36a42c9e75e504aea1e60815488cbe1d8727cf2eb1badb2632c6db2a59","observation_id":"187797f9-ef41-4ea4-8418-11eac7fbb8cc","resolution":{"observed_at":"2026-08-15T18:40:40.701376Z","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-15T18:40:41.089676Z","title":"Featured graph coarsen- ing with similarity guarantees","venue":null,"work_id":"4c2e190b-2c56-4a85-8f40-e283e3d89f54","year":2023},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.536856Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:008dbd6fb2bb288edd8af6b81875751a9bbc41d55a729a7d7d3d33e7895b45be","observation_id":"fcfe1851-1c96-4ccf-b975-1f37be3d592a","resolution":{"observed_at":"2026-08-15T18:40:41.093761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:40.966421Z","title":"xgcn: An extreme graph con- volutional network for large-scale social link prediction","venue":null,"work_id":"f8c6b386-c403-4f0c-9740-bd864449f86e","year":2023},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.686493Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:27fa6879b9eb728c9204f19e7db0e647450d1d560ad5c85455eb7722f2fe2e17","observation_id":"950e04e1-4a2d-448f-a280-6593e2d7ec9f","resolution":{"observed_at":"2026-08-15T18:40:40.970675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05674","last_updated":"2017-06-20T01:33:33Z","snapshot_observed_at":"2026-08-14T20:53:20.910341Z","submitted_at":"2017-06-18T15:53:59Z","title":"Knowledge Transfer for Out-of-Knowledge-Base Entities: A Graph Neural Network Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05674","snapshot_observed_at":"2026-08-15T18:40:40.497747Z","title":"Knowledge transfer for out-of-knowledge-base entities: A graph neu- ral network approach","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.497747Z"},"links":{"cited_paper":"/paper/1706.05674","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:db763408f9f0b1ab960cb7802fb666ae57e2b8f66569535cc55165c1210f8f05","observation_id":"6b3187b3-2e64-4639-81ab-48dba1c962e0","resolution":{"observed_at":"2026-08-15T18:40:40.497747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01350","last_updated":"2021-02-02T06:50:07Z","snapshot_observed_at":"2026-08-13T22:59:57.387089Z","submitted_at":"2021-02-02T06:50:07Z","title":"Graph Coarsening with Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.01350","snapshot_observed_at":"2026-08-15T18:40:40.458325Z","title":"Graph coarsening with neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.458325Z"},"links":{"cited_paper":"/paper/2102.01350","citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:1e835d0d3eda164ad1b81ecbe3ec5fc40120e96ad65bae717eb025b277559044","observation_id":"02c728ca-9404-4976-81c6-15d52aee2255","resolution":{"observed_at":"2026-08-15T18:40:40.458325Z","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-15T18:40:41.238458Z","title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds","venue":null,"work_id":"8c67e1da-b17c-4f4c-ad4d-fa6790611f1f","year":1991},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.476548Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:6f83d7b9d42b7fa7549ce72ebc69173a604ed74d48ea4873048c0301afaa4d55","observation_id":"80c9f4f3-1246-4549-aaba-cc3a6b96314c","resolution":{"observed_at":"2026-08-15T18:40:41.242549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.189940Z","title":"Exgc: Bridging efficiency and explainabil- ity in graph condensation","venue":null,"work_id":"73a5835f-d5ce-410f-962f-5e08812b73fe","year":2024},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.490466Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:558df98ec246d9d2d7d33eb07859953daa23d23790711ade9b46df33417055d7","observation_id":"d0ba3813-b171-4209-b4d3-8c18cd12964c","resolution":{"observed_at":"2026-08-15T18:40:41.194358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.288897Z","title":"Graph coarsening: from scientific computing to machine learning","venue":null,"work_id":"7048c19a-c18c-4c43-b2b2-c69cb967ac0f","year":2022},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.462286Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:8479868a94098508c7b31227c80ce7a05733bc55e33b0ee449cc942fbfde3aad","observation_id":"cf618c69-662f-4061-8f19-fc2c6567d0e8","resolution":{"observed_at":"2026-08-15T18:40:41.294372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.274802Z","title":"A gromov–wasserstein geometric view of spectrum-preserving graph coarsening","venue":null,"work_id":"4221fbbe-ff29-4f3e-8655-bc4a6185285b","year":2023},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.466233Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:f0ce26645cf3f7fdb61dbdf8abe982ecd42533e0abe1baba35652575d4a68ebb","observation_id":"1cf3f869-9aa8-4324-9243-2a769652db1a","resolution":{"observed_at":"2026-08-15T18:40:41.280074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.262549Z","title":null,"venue":null,"work_id":"18d2e90b-3ccb-4d93-b3d7-43df329ac922","year":1982},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.470023Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:a630d02bcbb6bb7b8674a420af628e2b958acf3517a89fffcd6c731d5054713c","observation_id":"3fbd460f-f534-453d-bf66-837679023f49","resolution":{"observed_at":"2026-08-15T18:40:41.266512Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:40:41.178032Z","title":"Protein interface prediction using graph convolutional networks","venue":null,"work_id":"57e26bdd-69c9-4e8d-ade7-3d9fb15e65ad","year":2017},"citing_paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:40.494266Z"},"links":{"citing_paper":"/paper/2506.19224"},"observation_digest":"sha256:3569a1b2c74b636527e131452064947777cb0fcfbd1cfa3118176e39429c2c90","observation_id":"95adb64d-6a44-4d73-aa23-86edc1b47f1c","resolution":{"observed_at":"2026-08-15T18:40:41.182184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19224","last_updated":"2025-06-24T01:18:06Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T18:32:17.844971Z","submitted_at":"2025-06-24T01:18:06Z","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2506.19224."}