{"as_of":"2026-08-10T01:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:582144916b705f2f2f9fff7641d1d4be529e86f159b915673c7a2ffe910e440c","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T03:55:26.803066Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"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.23098/citation-record","integrity":"/paper/2607.23098/integrity","json":"/paper/2607.23098/citation-record.json","paper":"/paper/2607.23098"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.705994Z","title":"and Musco, Cameron and Pachocki, Jakub , title =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.705994Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:0b42faa0158e618ccdb5165a6631432a3989318ed8bce4f82ce2b6e5995c23f4","observation_id":"10f23175-1f96-46d0-a11a-c74822adcc40","resolution":{"observed_at":"2026-08-01T03:55:26.705994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.709537Z","title":"and Yasuda, Taisuke , booktitle=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.709537Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:2eb49d9412cb2cd4cf5af9d60c566a2022102926d65655658089d77a479b524d","observation_id":"ad6192a3-6bb9-44f3-a490-8d2428eba44f","resolution":{"observed_at":"2026-08-01T03:55:26.709537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.713375Z","title":"All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.713375Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:4473a683d1e3dc16fe771b9c9d7378d85e48bc45fee298bb39fd8ab0e1db133a","observation_id":"9d558ec7-cb68-412f-bef4-78a02a587b2a","resolution":{"observed_at":"2026-08-01T03:55:26.713375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20354","last_updated":"2025-07-27T16:59:40Z","snapshot_observed_at":"2026-08-07T19:08:33.357146Z","submitted_at":"2025-07-27T16:59:40Z","title":"Deterministic Almost-Linear-Time Gomory-Hu Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20354","snapshot_observed_at":"2026-08-01T03:55:26.716428Z","title":"arXiv preprint arXiv:2507.20354 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.716428Z"},"links":{"cited_paper":"/paper/2507.20354","citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:49ae0fa04e08666c46232ed2076e9b8335a52341a2aed55c317818e5beca21f5","observation_id":"ce05ca54-afaa-43f7-848b-397b69187d5c","resolution":{"observed_at":"2026-08-01T03:55:26.716428Z","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":"10.1137/1.9781611975994.4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"7cef7315-b4f3-4977-a17a-f6bbd4626ed0","year":2020},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.719595Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:7c6ddfc2fda1567a424ed60431dc2aa8fc4ce7ac58454542ffe4c920509d3a0f","observation_id":"a05dc035-c1d8-4dd8-8e29-546c1b5a751b","resolution":{"observed_at":"2026-08-01T03:58:33.268588Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.722573Z","title":"Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.722573Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:2ca7fda84072423b6ed7e0a131b4a548afeee0f3bd6b2435335afd64c60a0b27","observation_id":"4b4fd7b6-684b-4fde-a111-a8c9289996a0","resolution":{"observed_at":"2026-08-01T03:55:26.722573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.725389Z","title":"Journal of the Society for Industrial and Applied Mathematics , volume=","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.725389Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:3dd625208a4ee6424cfddcb3807db440f447dae904d72137e19e5ad161b27f76","observation_id":"38837580-5287-4e9c-b306-bb24eccc8a4b","resolution":{"observed_at":"2026-08-01T03:55:26.725389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.728395Z","title":"On Fully Dynamic Graph Sparsifiers , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.728395Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:b2bd7c37902392756af88e177bb1e556b5cea24bdbc60d21e22dd6862fb57f2b","observation_id":"48eff9b0-effb-4546-b754-448f76b6b28b","resolution":{"observed_at":"2026-08-01T03:55:26.728395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.731499Z","title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , pages =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.731499Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:f1bd34a508e1e6c22415e835c5440989e1694af3541c6a258af2e2263ab35baa","observation_id":"debe94af-bec5-4162-9e3a-c4bf8ca993c3","resolution":{"observed_at":"2026-08-01T03:55:26.731499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.734286Z","title":"2019 , isbn =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.734286Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:6871700ad3a09703ae375f0ebbd13890bb97518d1914233610a4ca24ec7c682d","observation_id":"14ab5b73-dcb3-4f99-93cb-8aeb67c8b285","resolution":{"observed_at":"2026-08-01T03:55:26.734286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.737235Z","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.737235Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:c5d2ea91356855505299b3410bdd5b109bdb3cae8741f2e354dbea35425cddb6","observation_id":"b6ee0f5e-dbff-41e1-b9b9-fad025a57085","resolution":{"observed_at":"2026-08-01T03:55:26.737235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.740134Z","title":"and Peng, Richard and Sidford, Aaron , title =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.740134Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:3ed0e2df3c367c0f3f0e5b404ff561758c058e403a00471eb24ee34c424cf15b","observation_id":"865f8379-3c83-4630-b1c6-d03545d7b543","resolution":{"observed_at":"2026-08-01T03:55:26.740134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.743074Z","title":"SIAM Journal on Computing , pages =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.743074Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:f172c7c782da38c246e7bcf8d58e7078e22deada27f6282c80656824d2ae0654","observation_id":"89025d9b-72e7-40ca-ba41-24eff04577be","resolution":{"observed_at":"2026-08-01T03:55:26.743074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19632","last_updated":"2025-07-25T18:59:47Z","snapshot_observed_at":"2026-08-07T20:08:13.739556Z","submitted_at":"2025-07-25T18:59:47Z","title":"Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19632","snapshot_observed_at":"2026-08-01T03:55:26.745762Z","title":"arXiv preprint arXiv:2507.19632 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.745762Z"},"links":{"cited_paper":"/paper/2507.19632","citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:a3e15756696683296ec6ca44d5f894d044ed459ac50ff9feed5297ac3dc206e5","observation_id":"af936e73-4e1f-4c18-b383-4e2642c1783b","resolution":{"observed_at":"2026-08-01T03:55:26.745762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.748534Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.748534Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:22ff9d12df94c11ce7f8c813931d4e13c3869ab7c57c1334bc5daf3c713f4a62","observation_id":"0d5c8f35-d87b-4d50-913f-8811590ea6b9","resolution":{"observed_at":"2026-08-01T03:55:26.748534Z","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":"10.1145/2743021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2015 , issue_date =","venue":"ACM Transactions on Algorithms","work_id":"6bd19c52-74b9-44a0-807a-6d53967145e6","year":2015},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.751084Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:cb75fb9fe8624e7e0561f24dee707c51d43ae2c5c7f4cb5cd3992d469fed51f3","observation_id":"f0ec4d6a-3eaa-47a5-a5ad-1c6b81f11efd","resolution":{"observed_at":"2026-08-01T03:58:33.081788Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.753573Z","title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.753573Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:7530a15964a7e2348f6ebe8b7ebfb3d08ea6907459600dcd07cb7597b82c106a","observation_id":"0b3563fd-b9e4-42dc-be8c-804f465f4814","resolution":{"observed_at":"2026-08-01T03:55:26.753573Z","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":"10.1137/1.9781611977554.ch102","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"6b666b00-c1bf-44d5-a56f-8da6c533bac6","year":2023},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.756057Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:92f4f885999fcdf2bf07c9fca7480dc7bdc0a5fc229c84e92fd67ff1e7336271","observation_id":"22844842-ca4b-496d-9de9-bdf6d52081f1","resolution":{"observed_at":"2026-08-01T03:58:32.953697Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.759149Z","title":"Towards Optimal Effective Resistance Estimation , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.759149Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:70f1b9950bff695c94db4a1d8fef6f9690711a7f734ce1c4cb8655a5059c4642","observation_id":"c4aeaba0-5344-4287-86d2-37ad5adc19a8","resolution":{"observed_at":"2026-08-01T03:55:26.759149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.761931Z","title":"Proceedings of the 35th International Conference on Neural Information Processing Systems , articleno =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.761931Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:706dc489007cde75b91ae01ee7aa21dad15473520bf3f35a7168ab33e5341ef7","observation_id":"166071ec-cde1-44ae-957c-236decfab423","resolution":{"observed_at":"2026-08-01T03:55:26.761931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.764592Z","title":"The Complexity of Dynamic Least-Squares Regression , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.764592Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:f821173d1827b7bc996cc6ee2fa12e9f320ae5ee4035da2e2aa4fb85500a92b7","observation_id":"1a315953-c960-4057-aa16-bfeb65bba41c","resolution":{"observed_at":"2026-08-01T03:55:26.764592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.767035Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.767035Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:c514498e7da6f79f863a7c0d03c432e285db488985fec746d3d7474f3df76b4f","observation_id":"5189c1e5-2ded-4db0-b0b4-6216b3b5cefd","resolution":{"observed_at":"2026-08-01T03:55:26.767035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.769413Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.769413Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:f3769b70b50bf72d6fe8aae40d9a13522079148d8a41fdc417b8f6a887ea899a","observation_id":"859adbf9-1da5-4b8d-a89a-4fa7fc43f5ce","resolution":{"observed_at":"2026-08-01T03:55:26.769413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.772073Z","title":"Foundations and trends","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.772073Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:d94a0d1ce4b0d226d7cdd44b5dcb01873e96135f2416e8abe9e313e2189243b8","observation_id":"ef188fa3-170f-49bc-b95b-a5f5e501d818","resolution":{"observed_at":"2026-08-01T03:55:26.772073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.774830Z","title":"Freedman , title =","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.774830Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:823d61fec0a2c0c1a343fc39155a9994b7227d0b6a0a33ce1c0f1874e37a870e","observation_id":"5885da8d-a579-474a-9291-b5c9365c989d","resolution":{"observed_at":"2026-08-01T03:55:26.774830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.777388Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.777388Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:4f050eee9868d7ba3d30e9a8cb51df86bce956a7629fa7cf74ef6778700d92ab","observation_id":"2b361542-8925-44aa-88fd-00de7a0ef3fc","resolution":{"observed_at":"2026-08-01T03:55:26.777388Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2948062","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2016 , issue_date =","venue":"ACM Transactions on Parallel Computing","work_id":"df78089e-a473-477e-98cf-d6c8ef2984e9","year":2016},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.780331Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:6f6f0b70db03bd4132ab9aaebd5abf76dc66cd761826906265d4662c9adc0f5c","observation_id":"d4fb80df-d5d6-4717-b317-8080577f73f8","resolution":{"observed_at":"2026-08-01T03:58:32.866563Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.783559Z","title":"Discrete & Computational Geometry , volume=","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.783559Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:f7371fb05a8d60134b15fd76179f14100e2d77a16a9cc285942c55541ee1ecfb","observation_id":"db75dbfa-b16b-4b6c-84b8-dbf31ddb3d8f","resolution":{"observed_at":"2026-08-01T03:55:26.783559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.786411Z","title":"30th Annual European Symposium on Algorithms (ESA 2022) , pages =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.786411Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:9f189087b2c35a01d2b5cedd63cd78ce0606d03771fc7af2f5100ca921862f94","observation_id":"27fe2b13-f476-42ed-a967-2368bab7ebf1","resolution":{"observed_at":"2026-08-01T03:55:26.786411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.789153Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.789153Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:b56140bbf6aa417bc1de91ec781fceba16e5277a0798d1bbd506e5224a4374a0","observation_id":"a3eacaa1-776a-4035-a1f7-f2827f7c6a56","resolution":{"observed_at":"2026-08-01T03:55:26.789153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.791829Z","title":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.791829Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:5668c2008fd533b20fec7160ca16b0b31c8d7c6cc991ad4ba135666aee49eb04","observation_id":"c6c0cc9c-6b05-43f5-b2da-21e748e1e912","resolution":{"observed_at":"2026-08-01T03:55:26.791829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-08-01T03:55:26.794812Z","title":"arXiv preprint arXiv:2004.08432 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.794812Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:6992f35466ab4d4398824299986e2c6cc504e048d347a649ccc00d0802f26263","observation_id":"32c2700b-eaaf-4afc-8285-5c39dd9d2cb2","resolution":{"observed_at":"2026-08-01T03:55:26.794812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.797708Z","title":"Howard and Aaditya Ramdas and Jon McAuliffe and Jasjeet Sekhon , title =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.797708Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:e589f8bde4239c7d1ac9db11df1802ec040aa4af92e0b988f835751871e6f124","observation_id":"280876d2-945c-41f5-81c4-ff25989fa24b","resolution":{"observed_at":"2026-08-01T03:55:26.797708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.800282Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.800282Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:280397ab1a6df304d93e2ac24db682f8ff8ca9d4de8848493721dc3fba148969","observation_id":"172c9642-a9b0-4ee3-b01a-a23e60d1b565","resolution":{"observed_at":"2026-08-01T03:55:26.800282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:55:26.803066Z","title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.803066Z"},"links":{"citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:97fc545e68b6e6525534140e148d681d30e065b73e04e23dd17ef614e16fc817","observation_id":"20a0552d-61dc-4bd1-a6c8-4df5569d6b19","resolution":{"observed_at":"2026-08-01T03:55:26.803066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":30,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":35},"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 10 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.23098."}