{"as_of":"2026-07-24T22:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c835a6d411b5682abbcd962e36e4b84dc475b795f4c76fb10532742ea218341f","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T16:38:49.689477Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-24T06:31:00.690269+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/1906.10340/citation-record","integrity":"/paper/1906.10340/integrity","json":"/paper/1906.10340/citation-record.json","paper":"/paper/1906.10340"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Iterative refinement for _p -norm regression","venue":null,"work_id":"c8829520-0a47-46af-ac8c-37b62f77ed5f","year":2019},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:5d8ffc873edea03f2331eb505cbda9db3584737965a1ab4ca18970e717ddefcc","observation_id":"8fdb7049-d0c4-4f25-8b9d-089b02cf7e77","resolution":{"observed_at":"2026-05-25T16:41:03.825404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Phase transition in the family of p-resistances","venue":null,"work_id":"025066f6-a268-42ff-9712-a5fb21f378c1","year":2011},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:f197bc441520ef731722f33c26b905f76d603253f786af70b8eccf35bab842cc","observation_id":"f575ec75-b2ca-455a-9d42-11b969d9a5b6","resolution":{"observed_at":"2026-05-25T16:41:03.810078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.02315","last_updated":"2017-04-07T17:57:19Z","snapshot_observed_at":"2026-07-06T05:37:01.371758Z","submitted_at":"2017-04-07T17:57:19Z","title":"Much Faster Algorithms for Matrix Scaling","version":1},"cited_work":{"arxiv_id":"1704.02315","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.02315","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Much Faster Algorithms for Matrix Scaling","venue":"cs.DS","work_id":"197b3b0c-2ca0-4d2a-b594-a3b88d7a13d1","year":2017},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1704.02315","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d12911e7e436213d6f2c2d4884d8078ce55d48d6db826900db35bb8fdf09632d","observation_id":"5c927e47-2cc8-4866-8261-194d48dc415a","resolution":{"observed_at":"2026-05-25T16:41:02.565429Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Using petal-decompositions to build a low stretch spanning tree","venue":null,"work_id":"6cb55a6f-225e-4c8c-bada-9f9bf75ff61e","year":2012},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:25dc8e97777f49be97e03b53b16b75bf5e1ec2ee7c96bc9b23f01248b17bf5f7","observation_id":"b87703be-9cf2-426f-b8c0-4a18fb2ff75f","resolution":{"observed_at":"2026-05-25T16:41:03.813405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cohen, Yin Tat Lee, and Yuanzhi Li","venue":null,"work_id":"982520df-0b3a-4d82-8fe2-70911562c460","year":2018},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:06c7f2145056d147d63123eb9fdd033aa6632719724fcb3c7ae47be58e89b5d2","observation_id":"d0f901ff-4f0c-4ba7-a315-8048ddf37311","resolution":{"observed_at":"2026-05-25T16:41:03.821393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bencz\\' u r and David R","venue":null,"work_id":"7cc7465c-1ae3-4300-bced-73396a35c431","year":1996},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:ca8c72c8982ed78721d430b6a39e735bddbb42bafde386b33afed4f0f42e68a0","observation_id":"5a5dafd4-f9c9-472d-aeca-8203835256aa","resolution":{"observed_at":"2026-05-25T16:41:03.816567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.05127","last_updated":"2021-02-02T22:21:41Z","snapshot_observed_at":"2026-07-06T05:03:58.960419Z","submitted_at":"2016-07-18T15:27:01Z","title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","version":4},"cited_work":{"arxiv_id":"1607.05127","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1607.05127","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-optimal approximate shortest paths and transshipment in distributed and streaming models","venue":null,"work_id":"ed6b32c0-d95b-4fea-ac64-b462d58c69b1","year":2017},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1607.05127","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:031eab5d03fb45b4e92c396d685dca92465ef686b65d6f6774ecc233ae71e864","observation_id":"abc8440a-e657-4ea8-8f6e-5626703518c3","resolution":{"observed_at":"2026-05-25T16:41:02.585684Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1010.2921","last_updated":"2010-10-19T19:27:21Z","snapshot_observed_at":"2026-07-06T02:17:39.121616Z","submitted_at":"2010-10-14T13:54:38Z","title":"Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs","version":2},"cited_work":{"arxiv_id":"1010.2921","doi":null,"metadata_source":"pith","pith_arxiv_id":"1010.2921","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs","venue":"cs.DS","work_id":"679f67b7-aeff-41a9-be74-66b671f27eac","year":2010},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1010.2921","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:202f552a485abee61e9bba203f903b9da9dc8a51e413aa2691688c56da6eaf8a","observation_id":"177564d1-93b2-4b76-87d7-db19412e7f2a","resolution":{"observed_at":"2026-05-25T16:41:02.580194Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cohen, Rasmus Kyng, Gary L","venue":null,"work_id":"1f4f2df4-c5be-4e5c-aec1-208f1c8beb36","year":2014},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:e82da857e0fc401c6d414e1479b2f9cb50a2fca31b7bbfb1715e373f5dd538cc","observation_id":"6563fa10-e753-44f9-bc8b-bbdb4dae837d","resolution":{"observed_at":"2026-05-25T16:41:03.828721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1110.1358","last_updated":"2012-09-07T18:23:58Z","snapshot_observed_at":"2026-07-06T02:35:20.460389Z","submitted_at":"2011-10-06T19:24:24Z","title":"Runtime Guarantees for Regression Problems","version":2},"cited_work":{"arxiv_id":"1110.1358","doi":null,"metadata_source":"pith","pith_arxiv_id":"1110.1358","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Runtime Guarantees for Regression Problems","venue":"cs.DS","work_id":"fa56eb31-169e-4b1f-ab23-59fec30ddc87","year":2011},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1110.1358","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d006422ef588dbb4b15fa5f974407d3538cdfeff3b9121faf96ad9b21ad25a56","observation_id":"c38d9293-5934-4a4e-a742-496af8e0971e","resolution":{"observed_at":"2026-05-25T16:41:02.570556Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.02310","last_updated":"2017-08-21T05:07:51Z","snapshot_observed_at":"2026-07-06T05:37:01.371758Z","submitted_at":"2017-04-07T17:50:43Z","title":"Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods","version":2},"cited_work":{"arxiv_id":"1704.02310","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.02310","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods","venue":"cs.DS","work_id":"99cb7a63-a6a7-4608-aa0c-d5eb232ce137","year":2017},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1704.02310","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:5b8dcefc7f94685d81cd1c4d6a26cfbbff0d66a99221a4bf07789f20dd909c34","observation_id":"10434b9f-d4eb-41cd-8f88-fe02e88d79bb","resolution":{"observed_at":"2026-05-25T16:41:02.575302Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.0588","last_updated":"2014-12-01T18:50:09Z","snapshot_observed_at":"2026-07-06T04:02:13.905106Z","submitted_at":"2014-12-01T18:50:09Z","title":"$\\ell_p$ Row Sampling by Lewis Weights","version":1},"cited_work":{"arxiv_id":"1412.0588","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.0588","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"$\\ell_p$ Row Sampling by Lewis Weights","venue":"cs.DS","work_id":"0e2dca63-6b3b-45c6-9aed-08e4fed496c6","year":2014},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1412.0588","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:985ecf756e811b078917eade390c30f8dcaec5ce57f5d90e2394f9794d0efc42","observation_id":"61937332-77c2-4b91-bcd5-e21196b1a237","resolution":{"observed_at":"2026-05-25T16:41:02.477667Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0803.0988","last_updated":"2008-04-07T19:02:38Z","snapshot_observed_at":"2026-07-06T01:39:33.915014Z","submitted_at":"2008-03-06T21:57:53Z","title":"Faster Approximate Lossy Generalized Flow via Interior Point Algorithms","version":2},"cited_work":{"arxiv_id":"0803.0988","doi":null,"metadata_source":"pith","pith_arxiv_id":"0803.0988","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster Approximate Lossy Generalized Flow via Interior Point Algorithms","venue":"cs.DS","work_id":"f11e187e-b939-45ea-9af2-cc30e5fad6db","year":2008},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/0803.0988","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:c4b61eb36ffe77404f5d1f90424278b2bc673cd36f5c6c5f944224fd9ece2566","observation_id":"3ee7b235-b8e5-4559-a69d-b1eeb045a735","resolution":{"observed_at":"2026-05-25T16:41:02.494337Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Asymptotic behavior of _p -based L aplacian regularization in semi-supervised learning","venue":null,"work_id":"3663a74f-033b-4d0e-8b41-9e0bfb643af6","year":2016},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:e1c279f8e55f8925cdf004dd4ae9e5030b16efe5c980e7b2d17d95972081e09a","observation_id":"a667fbb3-ecb6-43c6-8bf8-4447d8b38b16","resolution":{"observed_at":"2026-05-25T16:41:03.708159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4153/cjm-1965-045-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T10:27:01.323728Z","title":"Paths, trees, and flowers","venue":null,"work_id":"67fc0209-198b-4347-aeba-08722ac10cea","year":1965},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:bb54d19dfb25a5a45864792742e5623adaa1e6c03fca6e0745e849a921e1fa3f","observation_id":"6399f148-073f-4faf-a7a5-3762e5ee3bbb","resolution":{"observed_at":"2026-05-25T16:41:02.378439Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-05-23T15:25:19.019641+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T15:25:19.019641+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2b30e367-0045-4cc1-a2c5-83bd315d82fd","year":1972},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d01461514581020c616ffd141be436f8b4eef32bc18b9035439128492224cf43","observation_id":"1b82d196-47e3-44bc-81b4-f7c16a32ab9f","resolution":{"observed_at":"2026-05-25T16:41:03.796832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Network flow and testing graph connectivity","venue":null,"work_id":"8d117fbd-cb00-400b-b359-8e3256bb6856","year":1975},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:3d4a744188fdd49a8c91819e98d3b565c440ace54ade90b107bdf2e59a77f467","observation_id":"c79ca4a6-9b3c-4847-88a8-5180d398a6a2","resolution":{"observed_at":"2026-05-25T16:41:03.806940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.04747","last_updated":"2015-08-19T19:17:55Z","snapshot_observed_at":"2026-07-06T04:27:07.682354Z","submitted_at":"2015-08-19T19:17:55Z","title":"Near-Optimal Distributed Maximum Flow","version":1},"cited_work":{"arxiv_id":"1508.04747","doi":null,"metadata_source":"pith","pith_arxiv_id":"1508.04747","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-Optimal Distributed Maximum Flow","venue":"cs.DS","work_id":"6d953c7d-cebe-43d6-b240-44a2e2bc5a8c","year":2015},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1508.04747","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:c9bbac1268714e11fd4a87ddff034e1faea6f752f4e038a335bba917efc3bfda","observation_id":"fc5e9701-de68-4216-9766-27958236aaf3","resolution":{"observed_at":"2026-05-25T16:41:02.549378Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Network flow and generalized path compression","venue":null,"work_id":"7ca9a8a9-bc10-4f8b-a647-7ae313208980","year":1979},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:be419fc8826bcdf0859e5c95a7f42607db120fe28012a5c8ed662a26b86bab8f","observation_id":"d79f5f96-3e7e-45db-ae39-bc8446c30a3e","resolution":{"observed_at":"2026-05-25T16:41:03.793682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goldberg and Satish Rao","venue":null,"work_id":"0a99bdb1-0a02-4912-82a6-5c42928edea7","year":1998},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:b8cb8ed4efd420948bed44ec085c433f36717b6c3477a4b06a15cb1c69cc3d1d","observation_id":"efbef131-dced-46f3-8e69-f24018360e30","resolution":{"observed_at":"2026-05-25T16:41:03.800493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goldberg and Robert Endre Tarjan","venue":null,"work_id":"89e57610-f7be-44ce-83c9-3d08ac030742","year":1988},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:7fdabe94a1b9d56a4e672330ab4ba13238de9164002224b93a7a8945e6646f5e","observation_id":"505b64b3-68fe-403d-b090-5c10715d11a8","resolution":{"observed_at":"2026-05-25T16:41:03.803722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goldberg and Robert Endre Tarjan","venue":null,"work_id":"20f6037e-bd7d-4fce-875e-7347d9379bd7","year":2014},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:27501843cb3120b230f442e736033d013d29806db8753918a6fdf4c0663de215","observation_id":"3da1e058-0789-4a2d-b6c0-885920ad2edc","resolution":{"observed_at":"2026-05-25T16:41:03.718381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hopcroft and Richard M","venue":null,"work_id":"40b33505-caee-43c3-acbc-d190859c2165","year":1973},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:5e2bcb44b3a4ba47e86d9655126cffa476157c35c9fc23834b7e5b70263935d2","observation_id":"d76b4043-b796-48b1-8a78-efac4d2accfd","resolution":{"observed_at":"2026-05-25T16:41:03.782532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hochbaum and James B","venue":null,"work_id":"3c68dc55-4a1e-475f-972f-61b09afe2085","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:68e2e139813b8c8c47ae2d8036867cf4807331b6c88f5629412a4c13aadd0b87","observation_id":"57cf0841-4b9a-4e48-b28f-d65584ac77da","resolution":{"observed_at":"2026-05-25T16:41:03.786629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The pseudoflow algorithm: A new algorithm for the maximum-flow problem","venue":null,"work_id":"97f9f7f6-079d-4a3e-959d-309358506c6e","year":2008},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:005579a464c564c6ef1d1846232c213410a297c4a9b9381a0c1e1e0656d95b8c","observation_id":"8b15b3f2-683d-42ef-9d96-b3a372f66e97","resolution":{"observed_at":"2026-05-25T16:41:03.733175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Karzanov","venue":null,"work_id":"3268bbb1-1cff-42b9-a8d2-a5ee03d99b58","year":1973},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:4298e349485cc6484db16c3f535c4f03868d0d6a0ad36efbfc194e238e227688","observation_id":"d1b22462-6616-4eb3-83bd-870b72727540","resolution":{"observed_at":"2026-05-25T16:41:03.725216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applications of parametric maxflow in computer vision","venue":null,"work_id":"aede72f0-dffd-4365-bb59-41065ef2e2e9","year":2007},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:89517af9ddcf13596fc6323f6c3876331de2f792cbc7ab863a08e8e5bb62b42d","observation_id":"6eef8eb4-666f-4165-b52d-15af85df0936","resolution":{"observed_at":"2026-05-25T16:41:03.779341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.2338","last_updated":"2013-09-23T17:41:00Z","snapshot_observed_at":"2026-07-06T03:10:38.974738Z","submitted_at":"2013-04-08T20:06:45Z","title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations","version":2},"cited_work":{"arxiv_id":"1304.2338","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.2338","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations","venue":"cs.DS","work_id":"a8994fa2-b071-4096-ae93-e501472b3467","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1304.2338","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:95504b00d5e2f8c15ce6447e51244a4e33101c3c6de7df98e8879b6bb5fbc60a","observation_id":"bbbb5e7a-fb90-4e05-a4cb-5a0cada8cc11","resolution":{"observed_at":"2026-05-25T16:41:02.554918Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kelner and A","venue":null,"work_id":"51824f79-8d35-4062-bd4d-6e17947376a9","year":2009},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:236b656f8394f3f7840dc7a51d2a2842dae6e0536c85712a5cdae42d9fc51573","observation_id":"49f44b0c-5013-498c-b92d-8808999f09a6","resolution":{"observed_at":"2026-05-25T16:41:03.772479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0909.2859","last_updated":"2009-09-15T19:50:37Z","snapshot_observed_at":"2026-07-06T02:00:37.558999Z","submitted_at":"2009-09-15T19:50:37Z","title":"Electric routing and concurrent flow cutting","version":1},"cited_work":{"arxiv_id":"0909.2859","doi":null,"metadata_source":"pith","pith_arxiv_id":"0909.2859","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Electric routing and concurrent flow cutting","venue":"cs.DM","work_id":"1a483d1d-6538-4ddc-94e1-f55cfbaf1093","year":2009},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/0909.2859","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:1425b482976f9b7735ed94e05f66da4b4a9f19109ba1d3f75166ae94e561d614","observation_id":"6de2fb36-9b44-4944-8be8-5dae177fd7b9","resolution":{"observed_at":"2026-05-25T16:41:02.489107Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1102.4842","last_updated":"2011-08-19T02:59:12Z","snapshot_observed_at":"2026-07-06T02:23:58.615217Z","submitted_at":"2011-02-23T20:53:03Z","title":"A nearly-mlogn time solver for SDD linear systems","version":4},"cited_work":{"arxiv_id":"1102.4842","doi":null,"metadata_source":"pith","pith_arxiv_id":"1102.4842","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A nearly-mlogn time solver for SDD linear systems","venue":"cs.DS","work_id":"a360207a-c27a-48e3-8ceb-a4d25dbd9dcb","year":2011},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1102.4842","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:c8380af55046d9cb5743cfb042cdc32cd4aaa43dbebedbbcf1bec65c9bac431f","observation_id":"c2a01bfa-2148-40c0-a5d2-7104fac5bdb3","resolution":{"observed_at":"2026-05-25T16:41:02.520544Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Miller, and Richard Peng","venue":null,"work_id":"352b3730-bf20-401a-aea2-50e9015b392f","year":2012},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:25a66cf3b452fb7fdb580ab5229d9a8f3830bef46e94e9ec36a99f3d409fd40e","observation_id":"e3a33ff2-1f3d-481b-bb3c-42550371ef3a","resolution":{"observed_at":"2026-05-25T16:41:03.769581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1003.2958","last_updated":"2010-08-03T07:43:16Z","snapshot_observed_at":"2026-07-06T02:08:44.692038Z","submitted_at":"2010-03-15T16:37:51Z","title":"Approaching optimality for solving SDD systems","version":3},"cited_work":{"arxiv_id":"1003.2958","doi":null,"metadata_source":"pith","pith_arxiv_id":"1003.2958","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approaching optimality for solving SDD systems","venue":"cs.DS","work_id":"d9776463-8859-4ed1-992a-2403d7b2750a","year":2010},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1003.2958","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:651f93450c835e03554209696b4f6b543b42b711ee0d0240316ebadb015f6996","observation_id":"d4f2a6ae-e5cd-420f-a29b-9bc2f154264b","resolution":{"observed_at":"2026-05-25T16:41:02.560683Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"16433d79-a840-4eca-bd2c-eee9aff72b4a","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:93c3418cf566c63b9d0703dda9f78334372ad27b28686d3ae63416a68b600f4c","observation_id":"fbde6758-dd2e-4027-ac90-970fde6735e8","resolution":{"observed_at":"2026-05-25T16:41:03.775310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"97648d08-6efc-4d15-9d65-725908ca5cb8","year":2015},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:da0b3f68b1f366d85305144ba827ef2a35bd284a5da87560089fccbb3cdb11c8","observation_id":"ee01ec19-b742-4845-8f21-ad4b217119bf","resolution":{"observed_at":"2026-05-25T16:41:03.790085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Karger and Clifford Stein","venue":null,"work_id":"f806348f-98a9-450b-9bf2-90659a23b565","year":1996},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:8506073f12365990e653025d235890be68393f7518e781c31d138a03a2b3d7df","observation_id":"a23a60de-1c7c-4203-8639-1e57d7707d00","resolution":{"observed_at":"2026-05-25T16:41:03.759782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.02353","last_updated":"2016-05-08T19:34:05Z","snapshot_observed_at":"2026-07-06T04:55:31.502014Z","submitted_at":"2016-05-08T19:34:05Z","title":"Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple","version":1},"cited_work":{"arxiv_id":"1605.02353","doi":null,"metadata_source":"pith","pith_arxiv_id":"1605.02353","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple","venue":"cs.DS","work_id":"316c990c-d261-4146-a5be-53f797addf5e","year":2016},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1605.02353","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:1d3264e400ca9005983b66731065e39f032dd6ad19e9ab0d0ffde9c550385b46","observation_id":"d194d782-c7dd-4336-9d63-e955169fa42a","resolution":{"observed_at":"2026-05-25T16:41:02.538150Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.08204","last_updated":"2015-08-13T16:02:22Z","snapshot_observed_at":"2026-07-06T04:22:09.595375Z","submitted_at":"2015-06-26T20:00:41Z","title":"Sparsified Cholesky Solvers for SDD linear systems","version":2},"cited_work":{"arxiv_id":"1506.08204","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.08204","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sparsified Cholesky Solvers for SDD linear systems","venue":"cs.DS","work_id":"6b74a9f2-da58-4527-be5e-38ae726e9de4","year":2015},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1506.08204","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d3e86c9b237c33cdbde005b690d9a7b30f1ee10529f49e0355daa3cd95f50b71","observation_id":"7267fa3c-f8b9-45ad-b8b3-aadf575bc57d","resolution":{"observed_at":"2026-05-25T16:41:02.514287Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems","venue":null,"work_id":"786c171c-1f1f-4912-889f-4e803a4950c4","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:50f575644b75795050af8b8c36031dfcd451579b1459ed95bdba87407cd3249a","observation_id":"cd91c0ec-60b4-4839-8f98-647437a9eacb","resolution":{"observed_at":"2026-05-25T16:41:03.715131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"37119955-51ae-4c3c-b720-75a166540f16","year":2014},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:10f443492305e0f583f201540616cb336694f518014dbcbe9154d244c6facfac","observation_id":"0aa88549-85a6-4d21-8a7e-1c94c5f99ea7","resolution":{"observed_at":"2026-05-25T16:41:03.751052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of network flow applications","venue":null,"work_id":"4af33423-fd39-473c-bda1-d5768e9bbd7f","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:57f6abe1248a85e54129af4c281b2ef7475ce6fc9e21ba534fcc2db6a0ea52ad","observation_id":"ae76e243-a4f2-4a61-bd8e-2aca35af4492","resolution":{"observed_at":"2026-05-25T16:41:03.692796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1008.1975","last_updated":"2010-11-06T03:16:26Z","snapshot_observed_at":"2026-07-06T02:14:04.582357Z","submitted_at":"2010-08-11T19:35:38Z","title":"Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs","version":4},"cited_work":{"arxiv_id":"1008.1975","doi":null,"metadata_source":"pith","pith_arxiv_id":"1008.1975","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs","venue":"cs.DS","work_id":"04930342-e405-4f88-ad50-c1cb9a34c73d","year":2010},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1008.1975","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:f8a5df5a63881eeacdc840b7245f5eb091977c4e9cd25a6edb153490e32eec2a","observation_id":"beb9e9e0-67dd-491d-a98a-2977f017bf39","resolution":{"observed_at":"2026-05-25T16:41:02.484136Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"From graphs to matrices, and back: new techniques for graph algorithms","venue":null,"work_id":"a9da8e09-4c36-4000-a575-c4373fe66e5b","year":2011},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:ae23cce5fc76d2bf772c566212222090cca3c0e8ac7de79d748b353be4c28495","observation_id":"c008e791-5a9e-4b2c-953a-e8283b935c10","resolution":{"observed_at":"2026-05-25T16:41:03.747837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bfe88e41-75d3-4871-ab50-625c1b11fb7a","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:da1750cd0e95bddd986c98204c73bf428e89f84b54280694c7bbf6c6582f5dd1","observation_id":"4e2f73de-d6d2-45a2-afde-9458c397846b","resolution":{"observed_at":"2026-05-25T16:41:03.753792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.06016","last_updated":"2016-08-21T23:53:22Z","snapshot_observed_at":"2026-07-06T05:07:42.723236Z","submitted_at":"2016-08-21T23:53:22Z","title":"Computing Maximum Flow with Augmenting Electrical Flows","version":1},"cited_work":{"arxiv_id":"1608.06016","doi":null,"metadata_source":"pith","pith_arxiv_id":"1608.06016","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computing Maximum Flow with Augmenting Electrical Flows","venue":"cs.DS","work_id":"d3deb3ef-c71d-4c7d-99bf-851133c1ac04","year":2016},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1608.06016","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:0948c8ea869c86f719929acd24fab9f95dced6fcea092081dfec102b9cfaf67e","observation_id":"4e830ecc-9c3f-4d29-8444-fc7f7e8b9346","resolution":{"observed_at":"2026-05-25T16:41:02.532179Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nesterov and A","venue":null,"work_id":"32bb0717-85f8-4531-896b-2162b836de7d","year":1994},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:eb7a60b5bc486f7157a370e67c8665a0549d1c7141153f0b6aa18633b6036574","observation_id":"c99e2d75-9586-4377-93c4-7cd9f9b2acc9","resolution":{"observed_at":"2026-05-25T16:41:03.756568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8ce9aaf2-e220-4e10-b415-4c73ae37cc9d","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d0cea8a2ac9928f07d318e3d34d8594bd887541896c739fa041f9869beaadc4e","observation_id":"89d456f2-df2a-43c1-8756-61915c6bb9eb","resolution":{"observed_at":"2026-05-25T16:41:03.763122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.7631","last_updated":"2015-11-17T02:30:37Z","snapshot_observed_at":"2026-07-06T04:01:54.085932Z","submitted_at":"2014-11-27T15:48:55Z","title":"Approximate Undirected Maximum Flows in O(m polylog(n)) Time","version":2},"cited_work":{"arxiv_id":"1411.7631","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.7631","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximate Undirected Maximum Flows in O(m polylog(n)) Time","venue":"cs.DS","work_id":"200c56ee-a7ab-44b5-bf7a-f85245f93006","year":2014},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1411.7631","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:87847d905881dcfeea07c184ea43128d179c690f73c66254242ea9f928d00ea4","observation_id":"5fea4e7a-070c-450a-816d-31f7caaebea0","resolution":{"observed_at":"2026-05-25T16:41:02.543817Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.3286","last_updated":"2013-11-13T20:41:01Z","snapshot_observed_at":"2026-07-06T03:28:07.857415Z","submitted_at":"2013-11-13T20:41:01Z","title":"An Efficient Parallel Solver for SDD Linear Systems","version":1},"cited_work":{"arxiv_id":"1311.3286","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.3286","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An Efficient Parallel Solver for SDD Linear Systems","venue":"cs.NA","work_id":"0019095b-27c1-4d85-93a5-ab77c1b5cf85","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1311.3286","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:aa6bb9e67c0434b15236660372a3b235512cc35ba059164135daa6eae097c698","observation_id":"40bd6f1d-7cd7-4343-af79-193c61645c31","resolution":{"observed_at":"2026-05-25T16:41:02.526446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of graph theoretical approaches to image segmentation","venue":null,"work_id":"0be12576-2288-4e6e-853e-88eea1ddfea7","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:e27bd0fe00aa69f9ceb0e3df40ac2999e1ce340c842ab14401a60932ebcac16c","observation_id":"31596eb6-f08f-492a-8ca8-3e278ec12751","resolution":{"observed_at":"2026-05-25T16:41:03.740379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nonlinear total variation based noise removal algorithms","venue":null,"work_id":"f3391cbb-fa24-4aea-a871-5c034fd07207","year":1992},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d59bec6f1c774f07da360ebae0ba2b9195ac1f8b22ea696efbb3d413c585b53a","observation_id":"5aa146ef-61fd-46ba-a085-b2adf1714f92","resolution":{"observed_at":"2026-05-25T16:41:03.699793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Private Communication","venue":null,"work_id":"c4e0af16-4e39-4c1a-ba80-fe0268760b22","year":2019},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:d7e2062a142c97f6abf2946defbdbda8638ad89554eed8da415a8a9d4b7fc896","observation_id":"186fb586-90ab-493d-b343-8f32086d9d94","resolution":{"observed_at":"2026-05-25T16:41:03.704311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the history of the transportation and maximum flow problems","venue":null,"work_id":"9ccb1905-ef45-4ed3-bba7-6b27c9b943ac","year":2002},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:e36f67603438d2d50cb5e0bf966e0e63cce8da8d88cae8126c564027a66ac011","observation_id":"d3d3d6a5-0db8-415c-86b8-5275d91342d7","resolution":{"observed_at":"2026-05-25T16:41:03.736771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.2077","last_updated":"2013-04-07T23:42:35Z","snapshot_observed_at":"2026-07-06T03:10:34.108328Z","submitted_at":"2013-04-07T23:42:35Z","title":"Nearly Maximum Flows in Nearly Linear Time","version":1},"cited_work":{"arxiv_id":"1304.2077","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.2077","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nearly Maximum Flows in Nearly Linear Time","venue":"cs.DS","work_id":"fdf1fb1b-3cbd-42d8-9584-4e013a4e95bc","year":2013},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1304.2077","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:25ad650726bcb338637b9e0e5902d897a398b3e44f4ff996f4610c0ef614064f","observation_id":"d1dce5a7-67d5-44c9-846d-c2703433467b","resolution":{"observed_at":"2026-05-25T16:41:02.471834Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Area-convexity, l\\( _ \\( \\) \\) regularization, and undirected multicommodity flow","venue":null,"work_id":"0252daa1-9155-462b-ac83-8d84410c3096","year":2017},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:ae1347e7bc1e1feee0182bc69dc77074b00aa04b5fcac26ae0cdfe5443854b70","observation_id":"4e9cf371-0206-4b4f-8344-87183b4e620b","resolution":{"observed_at":"2026-05-25T16:41:03.711993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.07425","last_updated":"2016-06-27T19:48:50Z","snapshot_observed_at":"2026-07-06T05:01:05.782622Z","submitted_at":"2016-06-23T19:56:35Z","title":"Generalized Preconditioning and Network Flow Problems","version":2},"cited_work":{"arxiv_id":"1606.07425","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.07425","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized Preconditioning and Network Flow Problems","venue":"cs.DS","work_id":"85667da3-b6f6-4d5d-b5a2-5ba4c9778d7f","year":2016},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1606.07425","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:e2e05054a1c3cfdd3e2316e91a9536bf9a4d8b1007ae5b9f9c78cfa93e19f5d4","observation_id":"9aa83ea4-d9c4-49ce-952d-8a172b5714a3","resolution":{"observed_at":"2026-05-25T16:41:02.504549Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"85273cae-e444-437e-9bc2-ed8b17778ae4","year":2018},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:bed6c72058bfd1a93e0652c5bdc29cb507f09d8fe7edfc5b4913084039ee2d0c","observation_id":"821a7be5-460e-4dfb-9917-34f05f83df5c","resolution":{"observed_at":"2026-05-25T16:41:03.766338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0803.0929","last_updated":"2009-11-18T07:22:03Z","snapshot_observed_at":"2026-07-06T01:35:47.273253Z","submitted_at":"2008-03-06T18:03:06Z","title":"Graph Sparsification by Effective Resistances","version":4},"cited_work":{"arxiv_id":"0803.0929","doi":null,"metadata_source":"pith","pith_arxiv_id":"0803.0929","snapshot_observed_at":"2026-07-04T05:09:36.209229Z","title":"Graph Sparsification by Effective Resistances","venue":"cs.DS","work_id":"fc98b2fa-eeee-430d-bf48-44ee5e33c134","year":2008},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/0803.0929","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:1414bddd1fd434ee10b68c6516c72ffce400a07be8a7600f598912da90b366b6","observation_id":"c50f8adf-01a0-4904-aea1-2b1e944bcd11","resolution":{"observed_at":"2026-05-25T16:41:02.465561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A data structure for dynamic trees","venue":null,"work_id":"f826a507-55c0-41e0-8cd8-0a19e0991768","year":1983},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:c95cc6c6cc62efca59b00ceb996e360e57c395cfce3349b803528f41f3bae6e9","observation_id":"b6e4b924-0605-43c2-ae6b-1ad1b7b7af9f","resolution":{"observed_at":"2026-05-25T16:41:03.696423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Self-adjusting binary search trees","venue":null,"work_id":"3ae3d02a-d3ec-4b29-a41b-b0ab844c0b25","year":1985},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:86860257c3d8127c4d0832deb9372e6a3f454da9dcf178ab5c08c50bb92be4d7","observation_id":"78034153-a033-4fa3-bb94-d90bde00d462","resolution":{"observed_at":"2026-05-25T16:41:03.729649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"cs/0607105","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Spielman and S","venue":null,"work_id":"d02e35a7-7810-4c98-86c2-3612dad6ca4f","year":2014},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:7acffe6692845beefba3b105dca2bf2f5d970d66e0a758a632993df0b9d5b520","observation_id":"4343fae8-a1d4-4f5c-9760-2a9c99745849","resolution":{"observed_at":"2026-05-25T16:41:02.509370Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Expander decomposition and pruning: Faster, stronger, and simpler","venue":null,"work_id":"3bb90265-75cb-4aec-b0ba-8abc5f3f0be7","year":2018},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:596c92a88383f3b2e58eccb8d89cae1e8567f706b1b14899dc4a38bbd0d5cef8","observation_id":"ba8318fa-e216-4e6e-80d7-932ab9431edc","resolution":{"observed_at":"2026-05-25T16:41:03.743625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-07-06T02:05:59.367026Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":"1004.4389","doi":null,"metadata_source":"pith","pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-07-10T06:06:50.408901Z","title":"User-friendly tail bounds for sums of random matrices","venue":"math.PR","work_id":"5ed7cfb7-2d47-4240-a309-03a33eb00c8a","year":2010},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:3cdb1679a4bd22eaef12d1de033c3be1774c2e39185de908e73c0bb93c469196","observation_id":"aaa93f0b-91aa-4e2a-8453-002a8b9727fd","resolution":{"observed_at":"2026-05-25T16:41:02.499372Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Duality-based algorithms for total-variation-regularized image restoration","venue":null,"work_id":"e4031e11-e3df-4212-a1e5-cb390212848c","year":2010},"citing_paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-25T16:38:49.689477Z"},"links":{"citing_paper":"/paper/1906.10340"},"observation_digest":"sha256:83554216244c86409893d29b6904baffebe375af9a71342beacac6e26d9901d2","observation_id":"bae200b3-2c84-4e1a-8282-f32a285a44b0","resolution":{"observed_at":"2026-05-25T16:41:03.722224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1906.10340","last_updated":"2019-06-25T06:34:40Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T08:02:33.524166Z","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":0,"verified_exact":19,"verified_fuzzy":40},"total_outbound_references":64},"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-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"thesis":"As of 24 July 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:1906.10340."}