Paper Citation Record · LEDGER

Space Complexity of Minimum Cut Problems in Single-Pass Streams

As of 16 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2412.01143.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2412.01143 v2

Coverage vector

measured 52 of 52 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T04:57:00.783606Z

measured 52 of 52 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

52 of 52 outbound references displayed

verified exact2
verified fuzzy43
unresolved7
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation dc4dd55d-944b-4f9e-be33-d208e494aaee · outbound

This paper cites Beating Two-Thirds For Random-Order Streaming Matching.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Beating Two-Thirds For Random-Order Streaming Matching

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.251862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 804b7de5-8f07-4a31-ac1a-33cfc2feec18 · outbound

This paper cites Coresets meet edcs: algorithms for matching and vertex cover on massive graphs.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Coresets meet edcs: algorithms for matching and vertex cover on massive graphs

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-12T04:57:00.637379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ba9516f-074b-4615-a7fc-967681501a61 · outbound

This paper cites Woodruff, and Qin Zhang.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Woodruff, and Qin Zhang

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.237850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation dcf2e4a5-37c4-4264-ae5a-6be9c3002c22 · outbound

This paper cites A Simple Semi-Streaming Algorithm for Global Minimum Cuts , pages 172--180.

Space Complexity of Minimum Cut Problems in Single-Pass Streams A Simple Semi-Streaming Algorithm for Global Minimum Cuts , pages 172--180

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.229732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation ef57b34e-07bf-4681-acbc-8085a5a48258 · outbound

This paper cites On the edge-expansion of graphs.

Space Complexity of Minimum Cut Problems in Single-Pass Streams On the edge-expansion of graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.221373Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 57ab6a4b-8432-4345-ac23-d6a65e3dc497 · outbound

This paper cites Woodruff, and Samson Zhou.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Woodruff, and Samson Zhou

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.213175Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 1210d8de-7333-42af-b67e-32783deb8eba · outbound

This paper cites Improved bounds for matching in random-order streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Improved bounds for matching in random-order streams

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.204566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e60c9399-649e-4756-9371-095e2e424a25 · outbound

This paper cites Bencz \' u r and David R.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Bencz \' u r and David R

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.196157Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation daf81bd7-3382-4bb7-8c56-1ff026e877bf · outbound

This paper cites Bencz \' u r and David R.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Bencz \' u r and David R

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.187698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation dfa527a6-4675-497d-b4ef-722fda603f2a · outbound

This paper cites Batson, Daniel A.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Batson, Daniel A

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.179105Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b00872c1-876f-4ae3-847e-c5e00ceefc04 · outbound

This paper cites Robust lower bounds for communication and stream computation.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Robust lower bounds for communication and stream computation

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.170426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 029f9ff0-951a-42e3-aa2a-4e17077b032a · outbound

This paper cites Testable Properties in General Graphs and Random Order Streaming.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Testable Properties in General Graphs and Random Order Streaming

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-12T04:57:00.831910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e7a329f5-305b-4731-9473-0ee648b6c0ed · outbound

This paper cites Vertex ordering problems in directed graph streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Vertex ordering problems in directed graph streams

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.161749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c37b8cd7-54ec-431b-a25c-92a8c9878188 · outbound

This paper cites Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.152950Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation bd1a3b6e-e014-4f41-a527-36b018748873 · outbound

This paper cites Optimal lower bounds for sketching graph cuts.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Optimal lower bounds for sketching graph cuts

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.142238Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 1767e328-e190-4204-81bc-0ab34382b755 · outbound

This paper cites Cohen, Cameron Musco, and Jakub Pachocki.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Cohen, Cameron Musco, and Jakub Pachocki

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.132990Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 1316431e-edf1-4e6f-967d-48a01c68f398 · outbound

This paper cites Approximate maximum matching in random streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Approximate maximum matching in random streams

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.124089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 787a20fe-92b9-4ccc-b0a9-4060a9d59843 · outbound

This paper cites Graph distances in the data-stream model.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Graph distances in the data-stream model

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.115391Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 5ab7ef98-b76e-4491-a8b4-d9af9d09fb90 · outbound

This paper cites Weighted matchings via unweighted augmentations.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Weighted matchings via unweighted augmentations

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.106769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 9ce5e058-3efa-4201-9627-b067dd61303f · outbound

This paper cites Gilbert, Yi Li, Ely Porat, and Martin J.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Gilbert, Yi Li, Ely Porat, and Martin J

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.098190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b30ed458-749a-4eba-8122-8eb7d001686d · outbound

This paper cites Stream order and order statistics: Quantile estimation in random-order streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Stream order and order statistics: Quantile estimation in random-order streams

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-12T04:57:00.697153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78c16681-efe8-4ed9-801b-f75fba4bb24f · outbound

This paper cites Hendrickx, Karl Henrik Johansson, Raphaël M.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Hendrickx, Karl Henrik Johansson, Raphaël M

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.084344Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 0de2ebeb-7335-446b-8717-8acd0d072c79 · outbound

This paper cites Weighted Matching in the Random-Order Streaming and Robust Communication Models.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Weighted Matching in the Random-Order Streaming and Robust Communication Models

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-12T04:57:00.702736Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7e91c73-fc87-4249-986a-fb716cdff639 · outbound

This paper cites Efficient \ o (n/eps) spectral sketches for the laplacian and its pseudoinverse.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Efficient \ o (n/eps) spectral sketches for the laplacian and its pseudoinverse

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.075832Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 7c65eab7-148e-4887-a629-dced6770fb40 · outbound

This paper cites Space lower bounds for approximating maximum matching in the edge arrival model.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Space lower bounds for approximating maximum matching in the edge arrival model

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.066756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation faa1eea4-cc48-46f0-96f4-a7cb2f633f54 · outbound

This paper cites an unresolved cited work.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-08-12T04:57:01.057989Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 4151dfef-be33-4774-ab9e-6f6931444fb4 · outbound

This paper cites Approximating matching size from random streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Approximating matching size from random streams

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.045975Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 168b95d5-b8ba-4403-a14c-449ecc735072 · outbound

This paper cites Karger and Matthew S.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Karger and Matthew S

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.037047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 08f1c4e5-8b6e-4d52-a887-83643bd6a712 · outbound

This paper cites Single pass spectral sparsification in dynamic streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Single pass spectral sparsification in dynamic streams

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.027475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 884a17b4-4ed4-4c4d-bded-e81c8c129bc2 · outbound

This paper cites Maximum matching in semi-streaming with few passes.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Maximum matching in semi-streaming with few passes

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.018273Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 895c8af1-a555-4f02-8262-f1fc98da89ac · outbound

This paper cites Fast and space efficient spectral sparsification in dynamic streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Fast and space efficient spectral sparsification in dynamic streams

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.008913Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation ee06cc91-01f0-4d97-9c13-b388438a0c00 · outbound

This paper cites Communication Complexity.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Communication Complexity

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:01.000117Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b9e9ae21-d679-4695-a5e6-2e4e18f229f6 · outbound

This paper cites A simple augmentation method for matchings with applications to streaming algorithms.

Space Complexity of Minimum Cut Problems in Single-Pass Streams A simple augmentation method for matchings with applications to streaming algorithms

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.991397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 62918258-61e1-4068-ab94-0f1efb8e3107 · outbound

This paper cites Karger and Clifford Stein.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Karger and Clifford Stein

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-12T04:57:00.732483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5468c28b-8b2f-40be-af3b-438aaaa45269 · outbound

This paper cites Fast approximation algorithms for cut-based problems in undirected graphs.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Fast approximation algorithms for cut-based problems in undirected graphs

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.977235Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 47c4e793-ecca-4661-9549-dc4254bc0c78 · outbound

This paper cites Graph stream algorithms: A survey.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Graph stream algorithms: A survey

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.968385Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b6a4bbc6-0821-4406-a588-0b52d208feb2 · outbound

This paper cites Testable Bounded Degree Graph Properties Are Random Order Streamable.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Testable Bounded Degree Graph Properties Are Random Order Streamable

Reference 37

Resolution: verified exact; local_arxiv, observed 2026-08-12T04:57:00.810595Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation af77e19a-49d6-49bc-876d-787dd5d605e6 · outbound

This paper cites Weighted min-cut: sequential, cut-query, and streaming algorithms.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Weighted min-cut: sequential, cut-query, and streaming algorithms

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.959449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 2384a345-a3ac-4bc1-9d5b-5a17e24c578c · outbound

This paper cites Munro and M.S.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Munro and M.S

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-12T04:57:00.746946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00fff595-935f-4901-8285-6d4fc9fc8a0a · outbound

This paper cites Concentration of hitting times in erd o s-r \'e nyi graphs.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Concentration of hitting times in erd o s-r \'e nyi graphs

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.945644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 108c766e-457f-4079-b85f-94da94baa508 · outbound

This paper cites Estimating graph parameters from random order streams.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Estimating graph parameters from random order streams

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.936222Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 4d6d2869-d7db-4325-9311-999bc357f31b · outbound

This paper cites Optimal short cycle decomposition in almost linear time.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Optimal short cycle decomposition in almost linear time

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.927477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 45013b5a-3297-4cea-a24b-03ebf8e77573 · outbound

This paper cites Matthew Weinberg.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Matthew Weinberg

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.918577Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 1bda9763-34be-40eb-a635-83b06eff516b · outbound

This paper cites Breaking the multicommodity flow barrier for o(vlog n)-approximations to sparsest cut.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Breaking the multicommodity flow barrier for o(vlog n)-approximations to sparsest cut

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.909646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 908a742a-0555-4032-940b-40446c98f90f · outbound

This paper cites Isolation vulnerability analysis in road network: Edge connectivity and critical link sets.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Isolation vulnerability analysis in road network: Edge connectivity and critical link sets

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.900565Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e54a056b-787f-49a8-9c4d-7caeaf21d50b · outbound

This paper cites Spielman and Nikhil Srivastava.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Spielman and Nikhil Srivastava

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-12T04:57:00.766782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b492ea1c-3782-4cd8-9556-74fd76bbf68d · outbound

This paper cites Spielman and Shang - Hua Teng.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Spielman and Shang - Hua Teng

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.886693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 61e3e8a0-5e34-493e-b9ae-7b6deaa398ea · outbound

This paper cites Spielman and Shang - Hua Teng.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Spielman and Shang - Hua Teng

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.877783Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e9e7498b-7757-46dd-841f-85806704d498 · outbound

This paper cites Woodruff.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Woodruff

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.868115Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 00c11a41-b1dd-453b-9cd5-469208cbba54 · outbound

This paper cites Efficient targeted influence minimization in big social networks.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Efficient targeted influence minimization in big social networks

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.859062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 8fde4e53-75ae-43bc-88da-1de1f4abc070 · outbound

This paper cites Williamson.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Williamson

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.849513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation d1c350b0-751a-400f-beb1-0cdccf7b06a6 · outbound

This paper cites Intractability of min- and max-cut in streaming graphs.

Space Complexity of Minimum Cut Problems in Single-Pass Streams Intractability of min- and max-cut in streaming graphs

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T04:57:00.840921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Pith citing papers

No inbound Pith citation observations are available.