{"as_of":"2026-08-09T20:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b4cd6fa50b977c7c83f97ff7a4f943663457a8c895449f2f99c660b8a24c39c","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:45:39.143482Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.23338/citation-record","integrity":"/paper/2607.23338/integrity","json":"/paper/2607.23338/citation-record.json","paper":"/paper/2607.23338"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:45:35.118120Z","title":"A unifying framework for spectrum-preserving graph sparsification and coarsening,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.118120Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:013004f28fed5283ca7cb8a45a862a41da72a441f97eba411fa51c90017b9c82","observation_id":"07353d45-a6b5-45a8-a1f2-75c8533c3c18","resolution":{"observed_at":"2026-07-31T23:45:35.118120Z","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-07-31T23:45:35.236039Z","title":"A comprehensive study on large-scale graph training: Bench- marking and rethinking,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.236039Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:8e3d39d6f5050415c2edfd85f3f6df551c69675b10d00cd76581dc576cfa88cb","observation_id":"492b7f3b-ebd4-454e-8e18-f1a3d5330230","resolution":{"observed_at":"2026-07-31T23:45:35.236039Z","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-07-31T23:45:35.375638Z","title":"DSpar: An embarrassingly simple strategy for efficient GNN training and inference via degree-based sparsification,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.375638Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:6528ecb20e1e273a045dd8de1fcd21ec579c4b6882323b9fd27b8ea0a996e5f3","observation_id":"aeb9cf28-1593-48eb-9c20-4d935084a13f","resolution":{"observed_at":"2026-07-31T23:45:35.375638Z","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-07-31T23:45:35.530377Z","title":"Learning to reduce the scale of large graphs: A comprehensive survey,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.530377Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:ac8d5c4f2319991fec368be11b71f7bf2f09a54a0676bd15672d2425ccd08a2e","observation_id":"e304ff3c-514d-4063-97df-4bd2c8ce6c52","resolution":{"observed_at":"2026-07-31T23:45:35.530377Z","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-07-31T23:45:35.674052Z","title":"Graph reduction with spectral and cut guarantees,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.674052Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:e48c5c7c6e610005644eabf571caa91362f87331467abd52dd7cea85c5938885","observation_id":"51d0ae7d-6526-4dbf-b95b-2a86c44b7971","resolution":{"observed_at":"2026-07-31T23:45:35.674052Z","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-07-31T23:45:35.816510Z","title":"Spectrally approximating large graphs with smaller graphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.816510Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:61e7107a84b2f9b471a37d5441fcc6ecc922ec35a02a71d801b257baa8ea74d4","observation_id":"0e30a793-7f85-4656-8dda-8d828b5057f2","resolution":{"observed_at":"2026-07-31T23:45:35.816510Z","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-07-31T23:45:35.946794Z","title":"Graph sparsification via mixture of graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:35.946794Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:825cf7f3aa5671bc9ad09a46702fdf0c1e43c183c3270545990f4832234051f2","observation_id":"d1d6cdf2-ee38-4b5f-ae13-2d8ebf36c742","resolution":{"observed_at":"2026-07-31T23:45:35.946794Z","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-07-31T23:45:36.056000Z","title":"Structure-preserving sparsification of social networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.056000Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:cee86e43b65ad732c3e89b62531e03b6c69c5d01986818f833b4f7c098d96e4f","observation_id":"e812e37d-f976-4ccc-a1ad-e2c60a197543","resolution":{"observed_at":"2026-07-31T23:45:36.056000Z","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-07-31T23:45:36.185451Z","title":"Does graph distillation see like vision dataset counterpart?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.185451Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:782815bf4c61e5f86197de3d00a49d9ada859c7260fac32cb2a19d890cae98e6","observation_id":"8d74a1e7-4be4-46aa-b6b3-70ee86dd8010","resolution":{"observed_at":"2026-07-31T23:45:36.185451Z","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-07-31T23:45:36.287972Z","title":"GC4NC: A benchmark framework for graph condensation on node classification with new insights,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.287972Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:dc541a78d0fbf7cba1bde1d49d873d0ac6a254654d1f4d676154a1cff9c19f15","observation_id":"d1779031-90d5-494d-9dec-7802c41a31c8","resolution":{"observed_at":"2026-07-31T23:45:36.287972Z","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-07-31T23:45:36.396459Z","title":"UGC: Universal graph coarsening,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.396459Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:a7dcb7dc79c21c4287ed89adf986f2fa965ca6b1c8263641196331f168dc021d","observation_id":"8183dc1e-c937-4692-80a6-54826043aa48","resolution":{"observed_at":"2026-07-31T23:45:36.396459Z","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-07-31T23:45:36.515608Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.515608Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:f0cfe9ddf09cb611a35bf56f051661a938265554152b06b6cb68d27df2e505b1","observation_id":"6f49cceb-280d-4d9e-8ada-e9c6dd631898","resolution":{"observed_at":"2026-07-31T23:45:36.515608Z","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-07-31T23:45:36.621985Z","title":"Graph coarsening with message-passing guar- antees,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.621985Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:ee48bf6d5e1f4b42744d900c852e19f96265584a250631dfe2af7b4e29e2df06","observation_id":"8e7c53f7-dc95-4e79-a247-dc6d81d62721","resolution":{"observed_at":"2026-07-31T23:45:36.621985Z","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-07-31T23:45:36.770939Z","title":"A note on over-smoothing for graph neural networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.770939Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:aff712270fd8ee164740b6ca50a9ecb0b7f6945315dca0437a324a049c2d38ed","observation_id":"399fe2cd-87f9-485f-80a0-201f1fbecdd5","resolution":{"observed_at":"2026-07-31T23:45:36.770939Z","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-07-31T23:45:36.923282Z","title":"Graph neural networks exponentially lose expressive power for node classification,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:36.923282Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:7fb667dd2fabc5d661ed74982fdf868fad47575b9832d04199317f148d458c84","observation_id":"245ac25e-91c6-450b-842a-b2069fd67eec","resolution":{"observed_at":"2026-07-31T23:45:36.923282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10993","last_updated":"2023-03-20T10:21:29Z","snapshot_observed_at":"2026-08-09T18:28:10.398670Z","submitted_at":"2023-03-20T10:21:29Z","title":"A Survey on Oversmoothing in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10993","snapshot_observed_at":"2026-07-31T23:45:37.035978Z","title":"A survey on oversmooth- ing in graph neural networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.035978Z"},"links":{"cited_paper":"/paper/2303.10993","citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:2d91ded05c9b08b0e1d93bae5ac50f28380f573ced8d5caf88a1646731b70d3b","observation_id":"9c09d25a-00e2-4260-b414-a9f716bf9824","resolution":{"observed_at":"2026-07-31T23:45:37.035978Z","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-07-31T23:45:37.138983Z","title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.138983Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:21efd4e8a0dab0962c12d371bff6c8c74e59449f38bd3ba603cea24ecd14c1bd","observation_id":"3c4e6594-4041-4523-9c52-947e197de923","resolution":{"observed_at":"2026-07-31T23:45:37.138983Z","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-07-31T23:45:37.257180Z","title":"A fast and high quality multilevel scheme for partitioning irregular graphs,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.257180Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:7750b47e1c998cd8563cecfc3b3479cfce35495a85be7284840ba934a4af1353","observation_id":"21075a74-e61e-4bc8-acee-b39d12b12eda","resolution":{"observed_at":"2026-07-31T23:45:37.257180Z","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-07-31T23:45:37.419024Z","title":"Rethinking efficient graph coarsening via a non-selfishness principle,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.419024Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:638d99f824520cbc01917770f7f1721474d38bb6a44be9bb4f37d2008b118ffa","observation_id":"ddde6b82-67c3-4822-8aa4-5aeccc3c3a9a","resolution":{"observed_at":"2026-07-31T23:45:37.419024Z","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-07-31T23:45:37.555601Z","title":"A general framework for graph sparsification,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.555601Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:ac695f5d608e80508ad791b154b47311cbd80ab6693a7f3c1b8d9738e7b6d926","observation_id":"dcda76df-8708-4cd6-9827-233af17a0d01","resolution":{"observed_at":"2026-07-31T23:45:37.555601Z","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-07-31T23:45:37.693331Z","title":"Spectral sparsification of graphs,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.693331Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:d58690ef0f44571029db8c0ae52ca19943b69140f5ccae49ddf99032910d8f5f","observation_id":"841d7bd3-4c0e-4ea7-8221-478f4f1318c2","resolution":{"observed_at":"2026-07-31T23:45:37.693331Z","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-07-31T23:45:37.829823Z","title":"Local graph sparsification for scalable clustering,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.829823Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:92337c973c296536dd28e9bff9ec5f86caaddb6390040b8bd546340028172f8b","observation_id":"a5c3798a-86ee-425e-90db-2ebf3871ef0e","resolution":{"observed_at":"2026-07-31T23:45:37.829823Z","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-07-31T23:45:37.970042Z","title":"TEDDY: Trimming edges with degree- based discrimination strategy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:37.970042Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:f4345d8a2467627130b58685e587f02b538ab934cf04d23928526b322cb954cf","observation_id":"8a19044a-1baf-4364-a6ab-aa672d613d1d","resolution":{"observed_at":"2026-07-31T23:45:37.970042Z","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-07-31T23:45:38.074515Z","title":"Deeper insights into graph convolutional networks for semi-supervised learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.074515Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:e0d980b6375ed31429e650217448bc3002aeec188a6fe956e9b07be4bf2d910e","observation_id":"d4a41ff5-f92e-4fd5-af1d-19e639ae1630","resolution":{"observed_at":"2026-07-31T23:45:38.074515Z","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-07-31T23:45:38.249768Z","title":"Demystifying over- smoothing in attention-based graph neural networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.249768Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:3ed41a135eb10d88c4683bd20106361519796232ea11d1c7f5abaf4f20e06426","observation_id":"58ed7936-d3fe-43e9-82ba-d021c1b13c64","resolution":{"observed_at":"2026-07-31T23:45:38.249768Z","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-07-31T23:45:38.363617Z","title":"Are we measuring oversmoothing in graph neural networks correctly?","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.363617Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:3145546870c70ef9f51b45717b5385a9bd14e4e5fccc8552a530eb96b8d416c9","observation_id":"b949ec15-75e0-43e7-bbd3-35593322a698","resolution":{"observed_at":"2026-07-31T23:45:38.363617Z","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-07-31T23:45:38.496992Z","title":"Dirichlet energy constrained learning for deep graph neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.496992Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:d57f8f32a5d4ff1e96598fa2f3538418bf98cc551bb77777d27ace21097215bb","observation_id":"7bbb7bf2-c07f-4295-9ad2-adfa6db4a767","resolution":{"observed_at":"2026-07-31T23:45:38.496992Z","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-07-31T23:45:38.609281Z","title":"TINED: GNNs-to-MLPs by teacher injection and dirichlet energy distillation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.609281Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:f5547fe037f89ac05d50e7181dd4191a150c0c52b3116d76b99e9cbc8d95ce5d","observation_id":"ab8f1764-4cb8-4efb-bfae-4cda09a3988d","resolution":{"observed_at":"2026-07-31T23:45:38.609281Z","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-07-31T23:45:38.724760Z","title":"Sampling from large matrices: An approach through geometric functional analysis,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.724760Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:9a33e1e9bebe1928e1b03796ad2df5faf77d470cc9b98a65c778bac7e27f26f6","observation_id":"eb8467d1-5c53-4c6d-8097-7a9e4ae06263","resolution":{"observed_at":"2026-07-31T23:45:38.724760Z","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-07-31T23:45:38.826906Z","title":"Revisiting semi-supervised learning with graph embeddings,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.826906Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:73fb71dd489567928fe407fca3db3fe8e1cfafda7c312450a595dec9c9ce61c9","observation_id":"bad56473-d802-4ae8-a1da-e9756e699d47","resolution":{"observed_at":"2026-07-31T23:45:38.826906Z","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-07-31T23:45:38.979242Z","title":"Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:38.979242Z"},"links":{"citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:1fa8541a6787fa57fa7bffbe75045c01feac03acc61b5ba668b7c6ba0d3d8cbb","observation_id":"8531a9ab-e5c8-463c-90ce-3d72e21d8c87","resolution":{"observed_at":"2026-07-31T23:45:38.979242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-07-06T07:14:41.761512Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-07-31T23:45:39.143482Z","title":"Pitfalls of graph neural network evaluation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T23:45:39.143482Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2607.23338"},"observation_digest":"sha256:b623c6267e579dbe511f11a86b802a127f037ea4d1ed00d21f66106d0973f098","observation_id":"a23e7841-7125-45ac-a937-20eaeff49dd9","resolution":{"observed_at":"2026-07-31T23:45:39.143482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23338","last_updated":"2026-07-25T19:24:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T12:52:00.641375Z","submitted_at":"2026-07-25T19:24:50Z","title":"Does Graph Compression Preserve Signal Propagation?"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":32},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2607.23338."}