{"as_of":"2026-08-10T16:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:63f3745048b06208555708412c5f74f36fe5b0d5f6d6a7aac3e332e5018a7636","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:35:50.617733Z","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-10T06:31:04.303077+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/2601.22943/citation-record","integrity":"/paper/2601.22943/integrity","json":"/paper/2601.22943/citation-record.json","paper":"/paper/2601.22943"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:35:47.385778Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.385778Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:dcdadfaeefc35294e65f245761b43d2a61f6e8ef4546118690bbf7ba0d743161","observation_id":"964cbf87-fc0e-4d72-a7fc-1acc93f2bea0","resolution":{"observed_at":"2026-08-03T06:35:47.385778Z","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-03T06:35:47.429211Z","title":"and Periwal, V","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.429211Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:416c91c28a943da38905635d0a42fd64780dc79a11d04df18401e9e65b0f6eac","observation_id":"fed51704-fe75-4d34-bda6-50f38d24a554","resolution":{"observed_at":"2026-08-03T06:35:47.429211Z","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-03T06:35:47.523373Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.523373Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:4789fcd6c0439f93e5f6e7c95d748d528a37e9e1abbd2fc647763cf728fffb9a","observation_id":"24d4bef2-8f4e-4133-85da-cc74ba07f137","resolution":{"observed_at":"2026-08-03T06:35:47.523373Z","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-03T06:35:47.590934Z","title":"and Pritam, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.590934Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:9f8b11f9643e3bc633b2d91d7e5f493a7dd3282495f6316639dbca40e3d5c5f3","observation_id":"60c86eb1-01f3-47e8-9c51-8d17eaa9efeb","resolution":{"observed_at":"2026-08-03T06:35:47.590934Z","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-03T06:35:47.643516Z","title":"and Pritam, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.643516Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:3721754ba9b9cef02203509f59dcff0de5742702075236a8148f2f9a988efe78","observation_id":"53861f43-89eb-4fca-9d74-66c1a072916a","resolution":{"observed_at":"2026-08-03T06:35:47.643516Z","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-03T06:35:47.710355Z","title":"Positional dominance: Concepts and algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.710355Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:61dc12368caffcca0823b36f14a57b4de9bffd31c5d05d1b5f0575e144aa3a0c","observation_id":"e294732a-0497-4d00-98a4-0f90d11b3594","resolution":{"observed_at":"2026-08-03T06:35:47.710355Z","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-03T06:35:47.765475Z","title":"and Gunderson, L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.765475Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:aba3edf200bbfa762a08948055d50d5d8792649cd5d8b6838b70d269436f6261","observation_id":"793159d9-087a-47ab-88b6-6b8228b05760","resolution":{"observed_at":"2026-08-03T06:35:47.765475Z","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-10T12:44:48.688349Z","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-03T06:35:47.786968Z","title":"Graph coarsening with neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.786968Z"},"links":{"cited_paper":"/paper/2102.01350","citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:7a2cb752f3b269a6ebb4727d7fa421eeaa43e83a1cd99444e687912df3f9c36d","observation_id":"35ff1bb8-3e0a-4117-9471-cbb7592b53e2","resolution":{"observed_at":"2026-08-03T06:35:47.786968Z","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-03T06:35:47.852212Z","title":"Computing a near-maximum independent set in linear time by reducing-peeling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.852212Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:bfbd7a4c6a5e7df33b760003214322e5531f004530f4361183311ef8b784bd68","observation_id":"afaf1317-8947-40e4-b9ef-0850f9abdfa5","resolution":{"observed_at":"2026-08-03T06:35:47.852212Z","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-03T06:35:47.905480Z","title":"and Safro, I","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:47.905480Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d4e168b88d64a71402e60ee23765854c6989c018c14eafa5a91269e224963ba1","observation_id":"3d949c40-af7b-4ffe-8c90-fa29286da45d","resolution":{"observed_at":"2026-08-03T06:35:47.905480Z","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-03T06:35:48.005011Z","title":"A unified lottery ticket hypothesis for graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.005011Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:98ae653e2a94d7ff891064f88376e82cf785881c64eeedb9c53c5f2ce3e4ea52","observation_id":"5bd20fee-eab6-4716-8bdf-c18a73485790","resolution":{"observed_at":"2026-08-03T06:35:48.005011Z","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-03T06:35:48.102344Z","title":"Topological relational learning on graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.102344Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:615ed6688c65e7287594e97660d511b47b87ed65f5f10d0029e520e203f3701f","observation_id":"076c63d3-73ab-4282-a643-655852f0ed13","resolution":{"observed_at":"2026-08-03T06:35:48.102344Z","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-03T06:35:48.173244Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.173244Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:31843d759596b8d0200e4ea2f063432f15c31c7fa922117da567d76bab697fe7","observation_id":"1a2d1b77-a6a0-4234-a7f5-a90f8449472a","resolution":{"observed_at":"2026-08-03T06:35:48.173244Z","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-03T06:35:48.219941Z","title":"Graph coarsening via convolution matching for scalable graph neural network training","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.219941Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:f909955be35be677f564a7798e7511f8bf46b019e27cba8f602791df4517027f","observation_id":"d20b9d9b-9d7a-4d1e-8321-52c928b676d4","resolution":{"observed_at":"2026-08-03T06:35:48.219941Z","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-03T06:35:48.267356Z","title":"and Gonzalez, T","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.267356Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:b7ae65b67a49e9e96546ef5635d65966a223001a8f1d4d3244a9e4f1811798ba","observation_id":"85a4f94d-95a9-4108-843a-c0adc75c35a2","resolution":{"observed_at":"2026-08-03T06:35:48.267356Z","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-03T06:35:48.331068Z","title":"and Steenrod, N","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.331068Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:915801f23591d0297b98f3d2292060d82106de5984d7de24d9f57d6231f3197d","observation_id":"ec8b8f79-453d-4d4f-9340-f9f6f017c795","resolution":{"observed_at":"2026-08-03T06:35:48.331068Z","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-03T06:35:48.378275Z","title":"Exgc: Bridging efficiency and explainability in graph condensation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.378275Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:9e7dbc083e3500693902a3b0138d0625e3cd1a73eb4ce151f72c5997ccae587e","observation_id":"cfb839b2-5717-4fd9-96cb-0d1c31b8ebda","resolution":{"observed_at":"2026-08-03T06:35:48.378275Z","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-03T06:35:48.491493Z","title":"Efficient computation of the characteristic polynomial of a threshold graph","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.491493Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:013fcf61b56205d86e113e748ed3d5864eda47e5bdc58d0a54e7bc8bbd08fa3f","observation_id":"22dad4fc-b8f3-49c6-9055-3260b885d8fb","resolution":{"observed_at":"2026-08-03T06:35:48.491493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-07-06T07:07:56.005107Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-03T06:35:48.545179Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.545179Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:902f5066d61b75e3a166886ef6ef731b445704e741e91ea1157627187edcb0ab","observation_id":"ed2ee696-4dcd-4ae4-9793-8cafd680d19a","resolution":{"observed_at":"2026-08-03T06:35:48.545179Z","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-03T06:35:48.611389Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.611389Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:2d7be774066ae53c2241410838a9feeb4646ceb6d61fb774e47ed9d4d65ef74c","observation_id":"da2ae94c-6f9f-441e-b9ed-bb22dfad7487","resolution":{"observed_at":"2026-08-03T06:35:48.611389Z","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-03T06:35:48.706993Z","title":"A topology-aware graph coarsening framework for continual graph learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.706993Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:6f13e776b352bb1e7d80759746006b80a7d33dd8f816305e6f8f6ede7024f278","observation_id":"0f8ae941-d899-49ae-b0cb-a9b17ce4b225","resolution":{"observed_at":"2026-08-03T06:35:48.706993Z","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-03T06:35:48.774496Z","title":"Topological node2vec: Enhanced graph embedding via persistent homology","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.774496Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:7bd83a09769d862303cfa704a7ecfab1e74dc92c2e88a9cd2540c0283fc93920","observation_id":"583839fb-da29-4135-b3bb-68865bbe6280","resolution":{"observed_at":"2026-08-03T06:35:48.774496Z","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-03T06:35:48.817965Z","title":"Topological graph neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.817965Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:157d6928ea3dd4b3b26018f5257199bdca907c6ff17d5bdeb1168957ecd3cf94","observation_id":"95359c16-1920-420c-bc14-b7c5d5dbeebf","resolution":{"observed_at":"2026-08-03T06:35:48.817965Z","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-03T06:35:48.890314Z","title":"Scaling up graph neural networks via graph coarsening","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.890314Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:3927e0cc03a882ba2302809c3804bc35b6ab474655da427dda6bd61031100ce4","observation_id":"3ac0b2b9-83c1-4f76-afe6-2260bbc1b0b4","resolution":{"observed_at":"2026-08-03T06:35:48.890314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02190","last_updated":"2023-05-03T15:35:15Z","snapshot_observed_at":"2026-07-06T15:22:51.488613Z","submitted_at":"2023-05-03T15:35:15Z","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02190","snapshot_observed_at":"2026-08-03T06:35:48.942355Z","title":"Rethinking graph lottery tickets: Graph sparsity matters","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.942355Z"},"links":{"cited_paper":"/paper/2305.02190","citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:7a5ea519f32572cf25955452ba8b6d4d80ccd01d0ed399ad90d406110eb6a01b","observation_id":"b7f90929-e9e4-4ce6-ae41-37f9089d0712","resolution":{"observed_at":"2026-08-03T06:35:48.942355Z","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-03T06:35:49.041272Z","title":"Going beyond persistent homology using persistent homology","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.041272Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:726ccdfea887afd8f332108f209bd49dbcc4dbdcc2e93969fdbfc46990bcaa3c","observation_id":"8dda3b3c-fcdd-4ea8-b3bc-ae16561b543f","resolution":{"observed_at":"2026-08-03T06:35:49.041272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07580","last_updated":"2022-09-27T20:48:28Z","snapshot_observed_at":"2026-08-10T12:43:22.092618Z","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-03T06:35:49.109883Z","title":"Graph condensation for graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.109883Z"},"links":{"cited_paper":"/paper/2110.07580","citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d94a4702eb7b61ef2dc0c6d5d1504b5c11385d1b9b6e7282ed3530f0071c027f","observation_id":"f1df1273-4d6d-4a92-b607-3b309e350f38","resolution":{"observed_at":"2026-08-03T06:35:49.109883Z","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-03T06:35:49.192256Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.192256Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:230575f25bbe4e5364f6c56ef21954e155b4592c2ced216a381894ec6fcc5b61","observation_id":"37e051c9-1f03-4557-8985-3bc703d73ed5","resolution":{"observed_at":"2026-08-03T06:35:49.192256Z","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-03T06:35:49.235823Z","title":"Featured graph coarsening with similarity guarantees","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.235823Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d9621fe56480c677b9f9266894aa7b2f5e586fcfff348f2230e2e2093738b240","observation_id":"42f057be-5a18-4e17-9e39-6ab5650d618f","resolution":{"observed_at":"2026-08-03T06:35:49.235823Z","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-03T06:35:49.312493Z","title":"and Terzi, E","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.312493Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:6369ea612cdbebff3a77da4eb947b4ee0db5417c89586190f6ea9e1a24f6761c","observation_id":"efc24aa5-a8dc-4dfe-85b7-c6c07a31c7e6","resolution":{"observed_at":"2026-08-03T06:35:49.312493Z","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-03T06:35:49.385080Z","title":"Scaling distance labeling on small-world networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.385080Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:614fc1556bd639bfbb455f15796e5ffd8be13a1176db804d5a0c28b3cae91273","observation_id":"fda0b27d-fc8b-46cf-baa4-a5cdd36743ad","resolution":{"observed_at":"2026-08-03T06:35:49.385080Z","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-03T06:35:49.452256Z","title":"Graph reduction with spectral and cut guarantees","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.452256Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:9ee9288c35654db887511ec56ec5def218e0720486e357afd68642f41851ded4","observation_id":"e9335e0b-8baf-436d-b04d-385a4ff7d082","resolution":{"observed_at":"2026-08-03T06:35:49.452256Z","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-03T06:35:49.521596Z","title":"and Vandergheynst, P","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.521596Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:0bb5ecdb706a4f46c27b4b290ac5a9ebf42c6fa3caf2d23ac9f1bc52871100d9","observation_id":"c02a7e29-ce53-47bc-87a6-0eee04dacae7","resolution":{"observed_at":"2026-08-03T06:35:49.521596Z","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-03T06:35:49.562755Z","title":"Improving graph neural networks with structural adaptive receptive fields","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.562755Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:f0b575d47a6cca793abb29dac939ffecd6ad4afe32b73e1fce1efaf99d0f1684","observation_id":"26dc19b5-ee9a-4250-9290-161ae7859daf","resolution":{"observed_at":"2026-08-03T06:35:49.562755Z","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-03T06:35:49.633330Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.633330Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d84c4e5739262331d5d25df98ce0bd311188f2b2d385ad3b01ab585a08b624ee","observation_id":"af70be7c-ab08-42a9-ba4d-c7a3e8aabead","resolution":{"observed_at":"2026-08-03T06:35:49.633330Z","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-03T06:35:49.690331Z","title":"Topology-preserving graph coarsening: An elementary collapse-based approach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.690331Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d77bdf129d24aa5851762e01f1f9b8eba8867ee3d289bbd930ec28e187a53e2f","observation_id":"3c43c8b3-87cd-4372-95c0-aac5f926f235","resolution":{"observed_at":"2026-08-03T06:35:49.690331Z","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-03T06:35:49.732150Z","title":"Encoding group interests with persistent homology for personalized search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.732150Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:253f5e49c8bcb72ae2448761a411de526cd9e4c870e3bc94cf8805d231a171dc","observation_id":"6867fff3-bd58-4c3e-8ab9-c4b95e2df110","resolution":{"observed_at":"2026-08-03T06:35:49.732150Z","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-03T06:35:49.800562Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.800562Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:9e1cd6fc7179a697028b3fe2adc72bd43018717bd0efd444bc5901686c070dc7","observation_id":"63a58303-2e71-4118-8eb9-ed8f3893e695","resolution":{"observed_at":"2026-08-03T06:35:49.800562Z","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-03T06:35:49.846102Z","title":"Topological machine learning for low data medical imaging","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.846102Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:f1bbd59ea8ff76f09ac609f847be9cc4b514f8091e75c68270cb6fa8d5a9b6a7","observation_id":"e88d0983-92f5-4035-a36c-25ee71d13e0b","resolution":{"observed_at":"2026-08-03T06:35:49.846102Z","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-03T06:35:49.919540Z","title":"Maximizing the reduction ability for near-maximum independent set computation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:49.919540Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:86980969ee71cc06082eff7c24e3c8c33d16d0241cf1ecc7b5232a2fedb780ed","observation_id":"50c7cdca-05d1-4e0c-b477-6b02a3b1770c","resolution":{"observed_at":"2026-08-03T06:35:49.919540Z","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-03T06:35:50.003894Z","title":"A., Kang, C., Zhang, Y., and Subrahmanian, V","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.003894Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:9cb5889527f6e53933245574b4ce1c4483425506224de1d2ceedf80c6158b8f7","observation_id":"d116f516-13c0-4d57-821e-5443b33c095a","resolution":{"observed_at":"2026-08-03T06:35:50.003894Z","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-03T06:35:50.069902Z","title":"P., Hymel, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.069902Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:f44fd7bfd546e760bd99d30b420056e4a2d79864a628f68fba4ac8cd24ed9f6d","observation_id":"cbc9d8c3-b04e-421c-a842-3117a043c5e8","resolution":{"observed_at":"2026-08-03T06:35:50.069902Z","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-03T06:35:50.137800Z","title":null,"venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.137800Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d4daa1b5b1c6cd8c03236065b4bc6c5b5573e9f3ca7cecf16e3369735b291ab2","observation_id":"f5747aa4-8e5a-4b05-ac69-313477d3a897","resolution":{"observed_at":"2026-08-03T06:35:50.137800Z","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-03T06:35:50.193519Z","title":"Link prediction with persistent homology: An interactive view","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.193519Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:cd46ed98ff4281aa640a32f0a95b863de0c26785cf7faac6668d14f9f3a58344","observation_id":"00063216-d326-44da-af82-b6374761c6e7","resolution":{"observed_at":"2026-08-03T06:35:50.193519Z","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-03T06:35:50.243832Z","title":"Cycle representation learning for inductive relation prediction","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.243832Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:6b66b1697adfef0d5073062132679f5716e4fa4d6cce594caea2f34d8c533ae1","observation_id":"777b02fb-198c-4415-a50e-5578c367416c","resolution":{"observed_at":"2026-08-03T06:35:50.243832Z","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-03T06:35:50.299123Z","title":"Neural approximation of graph topological features","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.299123Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:9592e7824d904679170f149b242db74d040e51f74c58a752213b321991c9f414","observation_id":"fbeb0782-2e8b-42d6-898d-c18599387145","resolution":{"observed_at":"2026-08-03T06:35:50.299123Z","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-03T06:35:50.337163Z","title":"Cycle invariant positional encoding for graph representation learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.337163Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:aacd2245dd214f5445716070ca360cecd9fbb715f25af8d51c6c11f92299e272","observation_id":"ba41e4ed-ebe6-47bb-9e2e-fc58b8bd6f39","resolution":{"observed_at":"2026-08-03T06:35:50.337163Z","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-03T06:35:50.434773Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.434773Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:d18ff3b7d3dc6f855cd1f30a5c4884cdf94f9fadab533a0be7b3951540695f5b","observation_id":"8f8923ba-ac78-405f-98c8-d42fe56e1101","resolution":{"observed_at":"2026-08-03T06:35:50.434773Z","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-03T06:35:50.504911Z","title":"Neighborhood skyline on graphs: Concepts, algorithms and applications","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.504911Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:b98264f48f4789fcc92584dabac6e0cd0be9f17330621e2a012c97ddc1b22773","observation_id":"2b628907-18f4-47e1-97a1-b176016d8cdf","resolution":{"observed_at":"2026-08-03T06:35:50.504911Z","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-03T06:35:50.617733Z","title":"Gnn: incorporating ring priors into molecular modeling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:50.617733Z"},"links":{"citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:220fed28bf127cc7f0c1089fa6f090c6e1c6aa46f7efb018bfa6b66f1f5ff7c8","observation_id":"441795e6-617d-47d8-a85d-020696198f3c","resolution":{"observed_at":"2026-08-03T06:35:50.617733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T06:35:31.315299Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":50},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2601.22943."}