{"as_of":"2026-08-15T07:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99d32824562a1a529e547167388b2370c848329a357a163ac385e3f83b35a46c","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T02:32:38.540435Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.25059/citation-record","integrity":"/paper/2607.25059/integrity","json":"/paper/2607.25059/citation-record.json","paper":"/paper/2607.25059"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:32:37.383148Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.383148Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:cdbfd08efe790a85597947e6e0bb7e59a21b55c7398ed26a753ad19003e3787c","observation_id":"a7040d27-e05d-41ee-aeca-500e67f1c32b","resolution":{"observed_at":"2026-07-31T02:32:37.383148Z","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-31T02:32:37.446078Z","title":"Spielman, and Nikhil Srivastava","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.446078Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:25bff16636a125c66f9c6d6b55b512c0da2972ce9c699bab132ea53c8f2d0003","observation_id":"dad2b911-d739-4c1a-8a54-85bdf12ec2be","resolution":{"observed_at":"2026-07-31T02:32:37.446078Z","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-31T02:32:37.507193Z","title":"A framework for parallelizing approximate gaussian elim- ination","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.507193Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:c0aeaa7213d17e09b31197d27bf88002df44875bc36de807aed392cb1973c802","observation_id":"0e71a0f2-8d41-4204-99ee-d410ecc2017c","resolution":{"observed_at":"2026-07-31T02:32:37.507193Z","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-31T02:32:37.545908Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.545908Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:96ad0b2e765818263784a1b36c756824350110c41d6d025eccf0c3650432c6f8","observation_id":"b0d86c75-9462-4c19-a3ea-e748097af092","resolution":{"observed_at":"2026-07-31T02:32:37.545908Z","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-31T02:32:37.580232Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.580232Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:1f460d52aec8a9cbbbcdf6537cd1225e8a0cfda49f46f88896b4225686e0bc24","observation_id":"8d25c284-8ed9-43af-9cf5-c92a11c7a6df","resolution":{"observed_at":"2026-07-31T02:32:37.580232Z","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-31T02:32:37.620509Z","title":"Dynamic low-stretch trees via dynamic low-diameter decompositions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.620509Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:2793438177a9fef95a718f57c462559ca55804e29080be459321ee9f9445994b","observation_id":"c8ef6e12-21e7-4f94-b87d-3bbafcd57a8b","resolution":{"observed_at":"2026-07-31T02:32:37.620509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00709","last_updated":"2023-06-14T08:26:46Z","snapshot_observed_at":"2026-08-13T12:34:08.050361Z","submitted_at":"2023-03-01T18:07:51Z","title":"Robust and Practical Solution of Laplacian Equations by Approximate Elimination","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00709","snapshot_observed_at":"2026-07-31T02:32:37.671030Z","title":"Spielman","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.671030Z"},"links":{"cited_paper":"/paper/2303.00709","citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:4d9a771b2356a588b553226bd3feff10875528aff069966daee8ef9a99149e6c","observation_id":"9c5b4629-6e2b-473c-b17b-63d96dacbc64","resolution":{"observed_at":"2026-07-31T02:32:37.671030Z","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-31T02:32:37.724255Z","title":"Spectral sparsification via random spanners","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.724255Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:033614f440bf964f38b281ae0eb4cbdeab97affd1fba88273648de37197cded4","observation_id":"99dee200-2a64-45fc-a143-cbccd43e712b","resolution":{"observed_at":"2026-07-31T02:32:37.724255Z","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-31T02:32:37.787352Z","title":"Simple parallel and distributed algorithms for spectral graph sparsification,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.787352Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:dee8927d1754bcf556e6a4b1da04cc4f769596ae34515259405d6652d31d8355","observation_id":"d7868b67-a873-4fb6-9c08-43a63f6d41b4","resolution":{"observed_at":"2026-07-31T02:32:37.787352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1209.5821","last_updated":"2013-11-16T15:08:23Z","snapshot_observed_at":"2026-08-15T00:45:20.180285Z","submitted_at":"2012-09-26T03:15:16Z","title":"Faster spectral sparsification and numerical algorithms for SDD matrices","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.5821","snapshot_observed_at":"2026-07-31T02:32:37.899730Z","title":"Faster spectral sparsification and numerical algorithms for sdd matrices, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.899730Z"},"links":{"cited_paper":"/paper/1209.5821","citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:a63d2eaf46052afdb0547365da9575a634aed1a53393b2abae3cba834a389b29","observation_id":"e4156b5b-6532-4aaf-bcc6-91b795dce5ce","resolution":{"observed_at":"2026-07-31T02:32:37.899730Z","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-31T02:32:37.960759Z","title":"Faster spectral sparsification and numerical algorithms for sdd matrices.ACM Trans","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.960759Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:ac6e64f5072148c11b6b5e636a257a69c87bd5c602f45975698690958b6f2a3f","observation_id":"f28d21d6-4a03-4f67-91cd-cf8dff716036","resolution":{"observed_at":"2026-07-31T02:32:37.960759Z","resolver_source":null,"status":"malformed_identifier"},"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-31T02:32:38.012214Z","title":"Random-shift revisited: Tight approximations for tree embeddings andℓ 1-oblivious routings","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.012214Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:c5ade75ce35cb00f534c1a4b1e325754c0f059e8ed2c6ecdaa1b9623e8610620","observation_id":"5e521e73-2476-44b3-8ea2-88ce931967e7","resolution":{"observed_at":"2026-07-31T02:32:38.012214Z","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-31T02:32:38.061127Z","title":"A framework for an- alyzing resparsification algorithms","venue":null,"work_id":null,"year":2032},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.061127Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:cf66ee86b412366227f941a49bc4a67eb6d239e2d8b913e18e5e87577089cf01","observation_id":"269e1c70-e4b9-4caf-a13e-d98a018cb7fd","resolution":{"observed_at":"2026-07-31T02:32:38.061127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.02353","last_updated":"2016-05-08T19:34:05Z","snapshot_observed_at":"2026-08-14T21:58:21.623994Z","submitted_at":"2016-05-08T19:34:05Z","title":"Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.02353","snapshot_observed_at":"2026-07-31T02:32:38.118245Z","title":"Approximate gaussian elimination for laplacians: Fast, sparse, and simple, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.118245Z"},"links":{"cited_paper":"/paper/1605.02353","citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:eeca85cc5c5fd8a5fa38d3ce254edaed6217f85c4c9ea29a08e10a2e939734ae","observation_id":"9318c43c-dd0f-43dc-9702-8e9fba20c2b4","resolution":{"observed_at":"2026-07-31T02:32:38.118245Z","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-31T02:32:38.178209Z","title":"Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.178209Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:5a1f134a1f7955927f77f91b51058d75875bb717547346e1f954f3636760930b","observation_id":"8fcb41f4-181e-483f-af64-6964dd2b7f2e","resolution":{"observed_at":"2026-07-31T02:32:38.178209Z","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-31T02:32:38.209258Z","title":"Miller, Richard Peng, and Shen Chen Xu","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.209258Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:458d6ae4834888ed2b81ec4df8f42c4f0fe2bc1cdfda46b992dcc82d2b63eb3c","observation_id":"989fa28a-2f56-48be-8cc1-b057ffaec2da","resolution":{"observed_at":"2026-07-31T02:32:38.209258Z","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-31T02:32:38.268266Z","title":"Probability and computing: Randomized algorithms and probabilistic analysis, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.268266Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:08e68200e3a03a85978f2e12c1c4a5a201cee401de08596360059436c26493b0","observation_id":"4d321dd8-b9f7-44cd-941d-814aae469029","resolution":{"observed_at":"2026-07-31T02:32:38.268266Z","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-31T02:32:38.342373Z","title":"Society for Industrial and Ap- plied Mathematics, second edition, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.342373Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:fcf5abce217d1ac56a4cc65dea5d4b4520134c7983310d26fdbf66e51a71f522","observation_id":"b6a17da6-db4d-41ef-807c-9f93eabc6946","resolution":{"observed_at":"2026-07-31T02:32:38.342373Z","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-31T02:32:38.398194Z","title":"A simple and efficient parallel laplacian solver","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.398194Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:d5e94278187fad9b9fd30ba72ee613bdcb87edb73bb2b3fb46df1c20073ecd51","observation_id":"c9cde2a8-00a7-48f9-97fd-42e792931ee1","resolution":{"observed_at":"2026-07-31T02:32:38.398194Z","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-31T02:32:38.428788Z","title":"Spielman and Nikhil Srivastava","venue":null,"work_id":null,"year":1913},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.428788Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:08910ea3cce85961b7f9aa25afe4ea854d366758a3999dfb8b402a49bcb948a3","observation_id":"9aec081f-ca27-45f2-8655-b38f9f6732c3","resolution":{"observed_at":"2026-07-31T02:32:38.428788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0310051","last_updated":"2008-09-19T14:33:26Z","snapshot_observed_at":"2026-07-07T03:05:26.032821Z","submitted_at":"2003-10-28T09:23:25Z","title":"Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0310051","snapshot_observed_at":"2026-07-31T02:32:38.485275Z","title":"Spielman and Shang-Hua Teng","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.485275Z"},"links":{"cited_paper":"/paper/cs/0310051","citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:6f6d8c73bebf59e8ab6a17f6d7be2686c9c4120baed93ea558c01c25223ad398","observation_id":"10ce4e3d-d957-455c-a58f-56b99f7a70df","resolution":{"observed_at":"2026-07-31T02:32:38.485275Z","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-31T02:32:38.540435Z","title":"Approximate distance oracles.J","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:38.540435Z"},"links":{"citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:bcfb06c618cafda9f9abc5677771eec0c0bf566baac6fdb4e6d84f45baac9886","observation_id":"890456eb-6075-4296-8e15-bcc4eadc5dec","resolution":{"observed_at":"2026-07-31T02:32:38.540435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1402.3851","last_updated":"2014-04-17T20:45:01Z","snapshot_observed_at":"2026-08-14T23:44:29.033558Z","submitted_at":"2014-02-16T22:28:54Z","title":"Simple parallel and distributed algorithms for spectral graph sparsification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.3851","snapshot_observed_at":"2026-07-31T02:32:37.844470Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.844470Z"},"links":{"cited_paper":"/paper/1402.3851","citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:ff6f63caf062c246ebe559cfb63af133a3ab4c3f0797fdb951175362de0c51d3","observation_id":"af23b93c-2a49-4663-841c-c570b34254d5","resolution":{"observed_at":"2026-07-31T02:32:37.844470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.25059."}