{"as_of":"2026-08-07T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16c577f2772c8b1e53c377656e59fe0667e3aa90735affdb42dd03ea4ce79446","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:42:49.589630Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.02128/citation-record","integrity":"/paper/2608.02128/integrity","json":"/paper/2608.02128/citation-record.json","paper":"/paper/2608.02128"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:42:45.313165Z","title":"Spectral clustering with graph neural networks for graph pooling","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.313165Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:868a123e87ec91894c445a7aa58156cf0c5fee44246dcbe58afed66bf8f972f8","observation_id":"27f6314e-99e6-430b-a792-d2eb3098cf70","resolution":{"observed_at":"2026-08-04T14:42:45.313165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-04T14:42:45.377357Z","title":"Bronstein, Joan Bruna, Taco Cohen, and Petar Veličković","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.377357Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:afaf03fb28a5c35657f500882c66aaa0ef98e9f2b48eed4a2f947d884c2ac5b9","observation_id":"e02b65e9-f064-4908-bcb4-9fd6466b5ce2","resolution":{"observed_at":"2026-08-04T14:42:45.377357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.10247","last_updated":"2018-01-30T22:36:16Z","snapshot_observed_at":"2026-07-06T06:21:01.297755Z","submitted_at":"2018-01-30T22:36:16Z","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.10247","snapshot_observed_at":"2026-08-04T14:42:45.472269Z","title":"Fastgcn: fast learning with graph convolutional networks via importance sampling","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.472269Z"},"links":{"cited_paper":"/paper/1801.10247","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:47347704858b2b9de970a7e6b4eb6d31fee8f697cd4104e7cdf0b583b6e8612f","observation_id":"bf93c4a4-b620-4435-8ea1-8ce5d4d56d89","resolution":{"observed_at":"2026-08-04T14:42:45.472269Z","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-04T14:42:45.558906Z","title":"Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.558906Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:ad68f131a5eee9729c5cc107aa6aa13f182362bdb6c1f30c3e445fdd368ab292","observation_id":"1d0370ed-e74a-4fba-a9a2-d33c1a61b0a7","resolution":{"observed_at":"2026-08-04T14:42:45.558906Z","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-04T14:42:45.666071Z","title":"Spectral graph coarsening using inner product preservation and the grassmann manifold","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.666071Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:0614bf0f1ba156db08c552e30775b9287cfbdb6f8aa6bac4036b16873f09b25a","observation_id":"4290b8e5-3a5b-4138-a141-3ba52c3f79f8","resolution":{"observed_at":"2026-08-04T14:42:45.666071Z","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-04T14:42:45.748306Z","title":"Weighted graph cuts without eigenvectors a multilevel approach.IEEE transactions on pattern analysis and machine intelligence, 29(11):1944–1957, 2007","venue":null,"work_id":null,"year":1944},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.748306Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:359d43278bf14a890c4cc53ce7d7a525982d09070fd98f13f3c2ce011590f98d","observation_id":"e1fb026f-72e3-4f52-b27f-3980254176a1","resolution":{"observed_at":"2026-08-04T14:42:45.748306Z","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-04T14:42:45.809625Z","title":"Graph coarsening via convolution matching for scalable graph neural network training","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.809625Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:119256e20ee269bf30b3f7347c4f562e2e1bb2f6f7e184c2f46800b0b2099992","observation_id":"a72fac24-b66c-40ab-8999-4e1a649ca2dd","resolution":{"observed_at":"2026-08-04T14:42:45.809625Z","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-04T14:42:45.883869Z","title":"Vq-gnn: A universal framework to scale up graph neural networks using vector quantization.Advances in Neural Information Processing Systems, 34:6733–6746, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.883869Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:c938e18830fe6002856f596834c7e2ac55b0333c44f22d6597ef9da3c43549f2","observation_id":"5f96d411-724c-4495-a6a0-5e39915124ca","resolution":{"observed_at":"2026-08-04T14:42:45.883869Z","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-04T14:42:45.947872Z","title":"Learning on large graphs using intersecting communities.Advances in Neural Information Processing Systems, 37:57349–57388, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:45.947872Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:a1d906b516fa20d78622fc137251aae9397e5dfaa290fa145558c99f115d7360","observation_id":"def06234-5f9f-46da-a604-9ec4fb2ec4d1","resolution":{"observed_at":"2026-08-04T14:42:45.947872Z","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-04T14:42:46.009919Z","title":"Graph u-nets","venue":null,"work_id":null,"year":2083},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.009919Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:7f593c217a4dcd62dc31f1d5f35fb0b01329fbc41da9d452850859d7792157c9","observation_id":"91f2b638-1014-40f0-961e-a3ed90664a2f","resolution":{"observed_at":"2026-08-04T14:42:46.009919Z","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-04T14:42:46.126062Z","title":"Influence-based mini-batching for graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.126062Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:0999ab366803e21abd1d306f944b37c637898bcde02f8b06445af193c58dce56","observation_id":"37fcb282-e570-4ae2-b60b-345e7c5fe4b6","resolution":{"observed_at":"2026-08-04T14:42:46.126062Z","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-04T14:42:46.248029Z","title":"Neural Message Passing for Quantum Chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.248029Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:a0f1ea24e6f36ca622baeeb8cd913299b5eff021d3aef1668a6b4ab26af1e620","observation_id":"2600d8ca-f106-4eee-9224-3c011d7412a7","resolution":{"observed_at":"2026-08-04T14:42:46.248029Z","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-04T14:42:46.356629Z","title":"Inductive representation learning on large graphs.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.356629Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:f272519cc3e6b04a2c3298df5688c3365753ff6c6a7e027713aa486f5bb5b4c2","observation_id":"926e7392-dc73-4b14-83ca-99a7316a7b2c","resolution":{"observed_at":"2026-08-04T14:42:46.356629Z","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-04T14:42:46.436861Z","title":"Open graph benchmark: Datasets for machine learning on graphs.Advances in neural information processing systems, 33: 22118–22133, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.436861Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:c3a5d855598ec3e1284e58268585bd5516c3e8af0a5e3d1c28be728aa3076bdd","observation_id":"156aeeef-7232-4414-bdb5-11796a14ebf0","resolution":{"observed_at":"2026-08-04T14:42:46.436861Z","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-04T14:42:46.514140Z","title":"Condensing graphs via one-step gradient matching","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.514140Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:7e9d60a898a459968ee12953e03d7331b072ded79e804cf0e66512d0a2810aed","observation_id":"b8c9aa2a-7c56-456a-89aa-6104dd95722f","resolution":{"observed_at":"2026-08-04T14:42:46.514140Z","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-04T14:42:46.557103Z","title":"Graph Coarsening with Message-Passing Guarantees.Advances in Neural Information Processing Systems, 37:114902–114927, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.557103Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:a861375ed6ed3a16de59882d05be2b2203fce693d6668dab1d145c7b41e8756e","observation_id":"d3fedeb7-e092-45bb-afdc-abd60fff8340","resolution":{"observed_at":"2026-08-04T14:42:46.557103Z","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-04T14:42:46.620554Z","title":"Taxonomy of reduction matrices for graph coarsening.Advances in Neural Information Processing Systems, 38:96058–96083, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.620554Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:f083e0225fdf59865609ce53fa44d2175307139dfd36ffe357c30f0958e35de5","observation_id":"ad7c9793-9364-416f-a899-3f92476e0dfe","resolution":{"observed_at":"2026-08-04T14:42:46.620554Z","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-04T14:42:46.647734Z","title":"Metis: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.647734Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:946b34a2a8b579bdbbee2fcd4bc56bde05d2f475417e1e4326c587eb876ab733","observation_id":"bbe82ac5-a30f-4ec4-b754-6335fb3893d0","resolution":{"observed_at":"2026-08-04T14:42:46.647734Z","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-04T14:42:46.734614Z","title":"Ugc: Universal graph coarsening.Advances in Neural Information Processing Systems, 37:63057–63081, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.734614Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:887bcef3e1fed2abc7e9f0523a818e1680b24ecac7a6f971cac3014451ad1c82","observation_id":"0fe69eb9-3a30-4ccd-bc18-78ee96c0f3f4","resolution":{"observed_at":"2026-08-04T14:42:46.734614Z","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-04T14:42:46.894279Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.894279Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:e39e66b2d51d61fc23b56ddfe91150e70f2c8445fb8e2a83cb1d19cf04ab8999","observation_id":"5a6fc6c2-4ec9-46f6-b67d-ad126442042d","resolution":{"observed_at":"2026-08-04T14:42:46.894279Z","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-04T14:42:46.997053Z","title":"Efficient learning on large graphs using a densifying regularity lemma","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:46.997053Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:a6fd5087cc7e0bfff22402a697506d30525f176fbed6b69f0be25ec859799710","observation_id":"02e14812-a6e9-489f-840a-03f26b3638c6","resolution":{"observed_at":"2026-08-04T14:42:46.997053Z","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-04T14:42:47.119011Z","title":"Featured graph coarsening with similarity guarantees","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.119011Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:4bde2cf534db7e0781b098fe519bd7659cfc41498d0d1d53d517345eeba3f6e4","observation_id":"af9db956-e1cd-4408-b520-88a212445871","resolution":{"observed_at":"2026-08-04T14:42:47.119011Z","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-04T14:42:47.250817Z","title":"Partition-wise graph filtering: A unified perspective through the lens of graph coarsening","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.250817Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:df129e6d0068119ab3bbcb670a74a42d8eadad73f0be43991ef64a6e41a7b404","observation_id":"8d6f6aff-3d3a-4994-a8b6-1658e8e95f25","resolution":{"observed_at":"2026-08-04T14:42:47.250817Z","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-04T14:42:47.414221Z","title":"Towards quantifying long-range interactions in graph machine learning: a large graph dataset and a measurement","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.414221Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:ba8e75096cff8276f8447f24b1390ecdfa9825ba796090caf44238d18f582dc5","observation_id":"6ff322ce-1ad1-4ade-a483-0e9c9d1eefd2","resolution":{"observed_at":"2026-08-04T14:42:47.414221Z","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-04T14:42:47.583799Z","title":"Graph reduction with spectral and cut guarantees.Journal of Machine Learning Research, 20(116):1–42, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.583799Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:1b178af9a7cbf80e8954eaf976af9b5aacdaecd71dabc3af9af44b1f80c71ed4","observation_id":"da337f8f-19b3-4a06-b1d9-d800c971cf25","resolution":{"observed_at":"2026-08-04T14:42:47.583799Z","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-04T14:42:47.689078Z","title":"Classic gnns are strong baselines: Reassessing gnns for node classification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.689078Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:fb2cab3b8843a56435c8c418524cd33bd46250919c85b6c16e3bde2027de9b92","observation_id":"f72ef6a6-4064-4dba-99d9-91f4bf346493","resolution":{"observed_at":"2026-08-04T14:42:47.689078Z","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-04T14:42:47.811177Z","title":"A critical look at the evaluation of gnns under heterophily: Are we really making progress? InThe Eleventh International Conference on Learning Representations, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.811177Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:d6edb6e689c2609fdd06cfef60d6f5da2b5cd490468dbcce349bedafd703cbf8","observation_id":"bf41b716-2fb9-4ffb-89b8-2fa9eacf6b24","resolution":{"observed_at":"2026-08-04T14:42:47.811177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.15001","last_updated":"2026-04-10T10:07:06Z","snapshot_observed_at":"2026-07-06T19:36:23.905725Z","submitted_at":"2024-10-19T06:27:24Z","title":"FIT-GNN: Faster Inference Time for GNNs that 'FIT' in Memory Using Coarsening","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.15001","snapshot_observed_at":"2026-08-04T14:42:47.924257Z","title":"Fit-gnn: Faster inference time for gnns that’fit’in memory using coarsening.arXiv preprint arXiv:2410.15001, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:47.924257Z"},"links":{"cited_paper":"/paper/2410.15001","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:db2855f501518aa75cdf98f23402d815a577f18813f4f39203f2e84bb36d8eb2","observation_id":"b9239952-36c7-436a-82dc-9b5b613bd7ca","resolution":{"observed_at":"2026-08-04T14:42:47.924257Z","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-04T14:42:48.064556Z","title":"Multi-scale attributed node embedding.Journal of Complex Networks, 9(2), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:48.064556Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:b6390f67b89aa91fc642be05f0a48cf97bc59b1746a95a5807e496d33f822dae","observation_id":"ef9f7f9e-a935-4933-ae56-03fb470ddaf8","resolution":{"observed_at":"2026-08-04T14:42:48.064556Z","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-04T14:42:48.202799Z","title":"The graph neural network model.IEEE transactions on neural networks, 20(1):61–80, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:48.202799Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:792a8d1c5f23d69b743661d71f8e56516c849b2f9dbb3dbcf6ab0b823a3bae66","observation_id":"a294722a-d24a-4f65-b352-230ff07bfbbf","resolution":{"observed_at":"2026-08-04T14:42:48.202799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-04T14:42:48.403409Z","title":"Graph attention networks.arXiv preprint arXiv:1710.10903, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:48.403409Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:6499350fad2c385d08d3f5e2b5923c59f9832e5156cb087a13229a6b9302d1ec","observation_id":"e88e5c48-1ff3-4ef8-9fe5-29c7d96f0a3c","resolution":{"observed_at":"2026-08-04T14:42:48.403409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15852","last_updated":"2024-08-29T10:28:42Z","snapshot_observed_at":"2026-07-06T18:35:26.627414Z","submitted_at":"2024-06-22T13:57:09Z","title":"Next Level Message-Passing with Hierarchical Support Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15852","snapshot_observed_at":"2026-08-04T14:42:48.570023Z","title":"Next level message-passing with hierarchical support graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:48.570023Z"},"links":{"cited_paper":"/paper/2406.15852","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:718b63721fb6457298f8c9633204af9bbcbb7aa164c90f781711a6f1e155a1a3","observation_id":"4985db1a-2756-48ac-b9dd-d544fc3c7a9d","resolution":{"observed_at":"2026-08-04T14:42:48.570023Z","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-04T14:42:48.766952Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:48.766952Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:7bac1740724280d70e968cc8ad2eb1c135ef2fc2b2b930f957bab17e4f881f66","observation_id":"70af163a-9f2d-48f5-b0c4-6cf6ef8dde16","resolution":{"observed_at":"2026-08-04T14:42:48.766952Z","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-04T14:42:48.939112Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:48.939112Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:8beb9db7a1fc59db0c39787290860c58b71d85b1595f2b1a00fc977672ca1adf","observation_id":"acd8fe58-8324-4736-8279-930dec46d034","resolution":{"observed_at":"2026-08-04T14:42:48.939112Z","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-04T14:42:49.120606Z","title":"Hierarchical graph representation learning with differentiable pooling.Advances in neural information processing systems, 31, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:49.120606Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:9397ec6ea437b8a3b696506691d6676d5e047a0c3bc2db7ecc0db7d52f5dae79","observation_id":"9b5d3f68-2e47-4302-8d16-502af8340d7d","resolution":{"observed_at":"2026-08-04T14:42:49.120606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-05T00:16:40.110456Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-04T14:42:49.212802Z","title":"Graphsaint: Graph sampling based inductive learning method.arXiv preprint arXiv:1907.04931, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:49.212802Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:053d16a197f42ac2e801ae996ec2eaf1c06e3c999de1136a12a389149c09cf50","observation_id":"86407185-c58a-433d-a023-7516b0ac4bb5","resolution":{"observed_at":"2026-08-04T14:42:49.212802Z","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-04T14:42:49.330526Z","title":"Decoupling the depth and scope of graph neural networks.Advances in neural information processing systems, 34:19665–19679, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:49.330526Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:f564d9ef1a543c93782b8a04b7b829df9c41dfc873914007d552bcb95a3580bb","observation_id":"45676200-3f63-4378-87dd-aa5a69c80792","resolution":{"observed_at":"2026-08-04T14:42:49.330526Z","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-04T14:42:49.446236Z","title":"Hierarchical message-passing graph neural networks: Z","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:49.446236Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:272c3d3f145274ee1064c68f3c73874f97f8e874c197cd954379b63c5a2e6987","observation_id":"569752ca-1109-4a00-938f-18b73b4afa62","resolution":{"observed_at":"2026-08-04T14:42:49.446236Z","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-04T14:42:49.589630Z","title":"Layer-dependent importance sampling for training deep and large graph convolutional networks.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:49.589630Z"},"links":{"citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:6b448d942282e379c2cbbc4cb330008199bb188743c5d264459c803dffe1b6e6","observation_id":"8aef6835-e1a9-4a69-9acb-630b6c48ea63","resolution":{"observed_at":"2026-08-04T14:42:49.589630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T23:36:55.839939Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2608.02128."}