{"as_of":"2026-08-07T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48315163b3d036756a183963556775ca2118f34c65970fa0323b900341da6bbc","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-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/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-07-31T23:45:34.721071Z","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:1ac55891ac9a42e73c125a8803899a3d74061478a08b45e5960b34db37c2efdd","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-07-31T23:45:34.721071Z","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:813cad68c38e933545a0bc14fe80c6f52fec07739e7200e2cb6180c17a2b833f","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-07-31T23:45:34.721071Z","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:17ac43f1d543542663eca66c9788fb9890cdf442d90365e710350da79fa9803e","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-07-31T23:45:34.721071Z","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:fcdbc4ead214f0d19d79d39fa6d59372465643c6027c70fc91c263530c6730b4","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-07-31T23:45:34.721071Z","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:57ee79025505f502ee0f3fc55ed6819da1734ee3e675bc3339243333ff62d5f3","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-07-31T23:45:34.721071Z","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:2ce0c7f75a6a304b4b5d9390843c7a337e4cc22404ef6ce3da79c11cd6b7ef1c","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-07-31T23:45:34.721071Z","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:dd458e138f7529cddc9ed6e5bf5cae2f38ee02d98bed26da269cb3d2f8f676b0","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-07-31T23:45:34.721071Z","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:0877d8a1252015b4c5eac646cefd2e70351e480cf446f1e3d16ac925d7fe6953","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-07-31T23:45:34.721071Z","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:d878a53769258523ffe1fd7e8943b1eccd660c4be7cdbdf1c97d8470fdbc7c06","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-07-31T23:45:34.721071Z","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:ec0bbd3ff9a52a5e4c85f7602c289bfc876b934eb9afce5b6c8c07fb2e83a7fa","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-07-31T23:45:34.721071Z","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:c8342be817b34d3ebb528e85f8e437f1d6b34e986f7e897e3c9badd6acf40659","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-07-31T23:45:34.721071Z","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:4c6f9631b903590cab5f5e3ea6a8156f189fd626a1b838fe2bf19b04e3da410a","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-07-31T23:45:34.721071Z","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:103abe6afbfca9c64179226fcee3422169a2443303168c011741b10d0eb2b2f7","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-07-31T23:45:34.721071Z","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:7432b31492d6afe4b10b1fcd6051f7770a51ab0a125d048ee4b0c97665eaad24","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-07-31T23:45:34.721071Z","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:47761910c0d0bda56354f014ff92d025be42d5b6c461657f589b64ec1c419648","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-07-06T15:05:38.707313Z","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-07-31T23:45:34.721071Z","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:3eff6cd6030c2d2d319fc6cafbb51d87072b5de80cdbb5ff265c070dfaf3d029","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-07-31T23:45:34.721071Z","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:188d8d779118a4350a0685709a3189f5afb73bdc1de25bb496476038d8accf33","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-07-31T23:45:34.721071Z","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:6464bf6b8b26c7b970b74861cac9edba53c7170c27ed1a2e99a59a6019af1d80","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-07-31T23:45:34.721071Z","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:91068c3f959f6e8e263912f341f2ff4ca7458682e00f822d2f587bdf92362ef6","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-07-31T23:45:34.721071Z","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:712cc1300364a0086aabe97ca515810f0b1598026afd017d9ba5383c8a912834","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-07-31T23:45:34.721071Z","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:473d106d6b9eca9d82a588cee31a8299acd2daf2b213b937c18f854869dcdf5c","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-07-31T23:45:34.721071Z","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:b537dca07702b698f33afe2a7c56b71c6ad6e33832c319c7d64edc2883732b65","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-07-31T23:45:34.721071Z","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:1e88a120e554ad961281f588172f776a9f3fc252648ad5e4bbc21ac8885734db","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-07-31T23:45:34.721071Z","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:5b2ea580dcf5e903c559cdcbb141d4728dc301b42f83cd7cb5421988ce775f66","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-07-31T23:45:34.721071Z","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:c6d4a8f01bcf71a6c9faa7469988b8a47ecb678f7da6defc87dedca744d4c747","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-07-31T23:45:34.721071Z","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:649f73a0d28bbabc1d0b3ae46dd85385657f31acdf64abc31ff3f0959d802cc9","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-07-31T23:45:34.721071Z","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:f47d65e660537a4f6d2bb624e359197b4b2b9cd2765d801c39467c70b38375fb","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-07-31T23:45:34.721071Z","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:c6b6ebe7eacf52c31d2f052d5261c3bd900a66498b9890eb2c56ee084db220d8","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-07-31T23:45:34.721071Z","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:3fe34861ef4137031a7e2a09eee76c9c8016e5925aa5c78525a8c6a385a1bb2d","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-07-31T23:45:34.721071Z","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:35d79684969f1cf22b757f6aacd8eafb828de734eb9db6704e9381a8ca444b6d","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-07-31T23:45:34.721071Z","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:34e88b2bd13842886c7cb86305f1b8a2fc7e8c45f870a7f11abc040ffb7f74d1","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-07-31T23:45:34.721071Z","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:5070cc07e9c5c5fea3035ac20115706d9b49ba9f60e15ba5a16ee49b2f584b4a","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-07-31T23:45:34.721071Z","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-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 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2607.23338."}