{"as_of":"2026-08-22T02:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5f690126fb95a6c1163c5b664991a5b71b2c394fd75d98d3884a252fbe29c392","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:36:03.743374Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-25T16:41:02.552338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.2338","last_updated":"2013-09-23T17:41:00Z","snapshot_observed_at":"2026-08-18T06:24:50.421067Z","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:927ebbdfd2430d280488a1ff518a38e27663f39552a9789c18c699da753daca6","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-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-18T06:24:50.421067Z","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:3340352334bca0308bc8c405c42d6a4fd06ccbaba7fc8c1222643fc09d3d853e","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"}}],"links":{"evidence":"/evidence","html":"/paper/1304.2338/citation-record","integrity":"/paper/1304.2338/integrity","json":"/paper/1304.2338/citation-record.json","paper":"/paper/1304.2338"},"outbound":[],"paper":{"arxiv_id":"1304.2338","last_updated":"2013-09-23T17:41:00Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T06:24:50.421067Z","submitted_at":"2013-04-08T20:06:45Z","title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1304.2338."}