{"as_of":"2026-08-16T08:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61f0e356df463cb1e34f5ea56c7a936256416207e1dd57a604803b2e2b8c13f4","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:36:03.758322Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2508.19898/citation-record","integrity":"/paper/2508.19898/integrity","json":"/paper/2508.19898/citation-record.json","paper":"/paper/2508.19898"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:36:03.985364Z","title":"We investigate the numerical stability of this case","venue":null,"work_id":"0d34b1b8-c00e-4db2-8cc0-d3cef3f22ada","year":null},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.758322Z"},"links":{"citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:5caa7a31bbb5c27660120d2afc73d5c91530aaf249d470aedb7ca39b798537e8","observation_id":"64a0359f-265c-4c7f-9e91-eda259cb9481","resolution":{"observed_at":"2026-08-05T15:36:03.988687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13451","last_updated":"2025-01-06T11:18:07Z","snapshot_observed_at":"2026-08-16T07:10:15.546690Z","submitted_at":"2024-10-17T11:25:44Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal","version":2},"cited_work":{"arxiv_id":"2410.13451","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.13451","snapshot_observed_at":"2026-08-05T15:36:03.951264Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal","venue":"cs.DS","work_id":"c8cebe66-3163-4fbb-b111-b5dcbc04750f","year":2024},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.737504Z"},"links":{"cited_paper":"/paper/2410.13451","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:ee75b53c9386433c59ee752b809333dd945309efaaaa9576ad9a208985a36f3f","observation_id":"a1c6045b-2e9e-41a7-aac6-de22dbe673a3","resolution":{"observed_at":"2026-08-05T15:36:03.955212Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-15T00:22:12.313590Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.2338","snapshot_observed_at":"2026-08-05T15:36:03.743374Z","title":"A decentralized algorithm for spectral anal- ysis","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":226,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.743374Z"},"links":{"cited_paper":"/paper/1304.2338","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:c10bb644317a69333e5ad92257270ee1fd0e183cc8c3c79da57edd5e321fc0a2","observation_id":"a9b14478-e5c1-43f4-988b-3c007f4a4e73","resolution":{"observed_at":"2026-08-05T15:36:03.743374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1307.2205","last_updated":"2013-10-24T10:50:15Z","snapshot_observed_at":"2026-08-15T00:11:23.063583Z","submitted_at":"2013-07-08T19:13:00Z","title":"Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back","version":3},"cited_work":{"arxiv_id":"1307.2205","doi":null,"metadata_source":"pith","pith_arxiv_id":"1307.2205","snapshot_observed_at":"2026-08-05T15:36:03.808160Z","title":"Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back","venue":"cs.DS","work_id":"d0c807e9-6d81-4171-9dfc-bd3591aae279","year":2013},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":262,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.749852Z"},"links":{"cited_paper":"/paper/1307.2205","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:0c0dc298eed1cc4e2e258689238aee797c979184e26b3e16613a315ef6e4b0c1","observation_id":"b56cdcef-7e41-4f45-afc5-9286097e8205","resolution":{"observed_at":"2026-08-05T15:36:03.811919Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01956","last_updated":"2019-11-05T17:33:02Z","snapshot_observed_at":"2026-08-14T14:28:12.178125Z","submitted_at":"2019-11-05T17:33:02Z","title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","version":1},"cited_work":{"arxiv_id":"1911.01956","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.01956","snapshot_observed_at":"2026-08-05T15:36:03.963877Z","title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","venue":"cs.DS","work_id":"2be2bc05-8190-4bd8-9de6-14b50d2bd8bc","year":2019},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":335,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.734093Z"},"links":{"cited_paper":"/paper/1911.01956","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:112e2b7ffeab8c9b4ddc26eb32ae4e43b25251b76e53c7c2bcbe63450bbb567f","observation_id":"b0adc626-9653-42b5-974a-0f7c84d2f6d2","resolution":{"observed_at":"2026-08-05T15:36:03.967107Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-15T00:22:19.376209Z","submitted_at":"2013-04-07T23:42:35Z","title":"Nearly Maximum Flows in Nearly Linear Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.2077","snapshot_observed_at":"2026-08-05T15:36:03.752748Z","title":"Distributed Verifi- cation and Hardness of Distributed Approximation","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.752748Z"},"links":{"cited_paper":"/paper/1304.2077","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:572a0773a25d152f30a6b79f806cb7930a6ac10854c9fedda893b9e8b8045ad4","observation_id":"2842cefa-0843-4ea1-9d98-5523308fe23c","resolution":{"observed_at":"2026-08-05T15:36:03.752748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01600","last_updated":"2023-04-04T07:41:41Z","snapshot_observed_at":"2026-08-13T12:09:43.917834Z","submitted_at":"2023-04-04T07:41:41Z","title":"Minimum Cost Flow in the CONGEST Model","version":1},"cited_work":{"arxiv_id":"2304.01600","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.01600","snapshot_observed_at":"2026-08-05T15:36:03.785569Z","title":"Minimum Cost Flow in the CONGEST Model","venue":"cs.DS","work_id":"efbfbd32-1224-45b6-9ca9-1a1dfbd81c8d","year":2023},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.755551Z"},"links":{"cited_paper":"/paper/2304.01600","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:e3305098454e72c053160b26e5b4ff19921855db33881520ac60e3717bd9031b","observation_id":"4d50162f-b8db-4d68-9356-d986d04c0873","resolution":{"observed_at":"2026-08-05T15:36:03.790522Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:36:03.740675Z","title":"New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.740675Z"},"links":{"citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:6f8d3c881bf816db79bac0411edabff4e83b92808a136464356dd31135bf2f58","observation_id":"7d9d46d5-f2d8-48ba-a5f9-8e45b7265d8b","resolution":{"observed_at":"2026-08-05T15:36:03.740675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01626","last_updated":"2022-05-31T19:12:21Z","snapshot_observed_at":"2026-08-06T17:17:49.220741Z","submitted_at":"2019-11-05T05:28:08Z","title":"Faster Parallel Algorithm for Approximate Shortest Path","version":6},"cited_work":{"arxiv_id":"1911.01626","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.01626","snapshot_observed_at":"2026-08-05T15:36:03.820300Z","title":"Faster Parallel Algorithm for Approximate Shortest Path","venue":"cs.DS","work_id":"a4b3aa95-5f61-48e2-8a39-c220fe422690","year":2019},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.746748Z"},"links":{"cited_paper":"/paper/1911.01626","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:52ea2f0ba6dc2bf40ae39b416c9b2d001f648730388eca0ef774b1cf46a3b655","observation_id":"490afdcc-4556-43ad-b79a-01f81e079de3","resolution":{"observed_at":"2026-08-05T15:36:03.823308Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05151","last_updated":"2022-05-14T13:52:59Z","snapshot_observed_at":"2026-08-13T18:13:43.537213Z","submitted_at":"2021-09-11T01:45:34Z","title":"Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts","version":3},"cited_work":{"arxiv_id":"2109.05151","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.05151","snapshot_observed_at":"2026-08-05T15:36:03.975338Z","title":"Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts","venue":"cs.DC","work_id":"a9dc0828-a72e-4d1c-aa3c-3c7d59b4028f","year":2021},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.730395Z"},"links":{"cited_paper":"/paper/2109.05151","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:5566181b352df711cb11f2b777f77522e726beb3a8c50324f63e1cc60c5938be","observation_id":"fff22871-acbe-450b-9349-f19b9dea75bd","resolution":{"observed_at":"2026-08-05T15:36:03.979022Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":10},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2508.19898."}