{"as_of":"2026-08-16T07:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b78051deaeb531961919787448abf8de06ebb9e541961417a2bfe08feca086bc","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:57:00.783606Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"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/2412.01143/citation-record","integrity":"/paper/2412.01143/integrity","json":"/paper/2412.01143/citation-record.json","paper":"/paper/2412.01143"},"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-12T04:57:01.248478Z","title":"Beating Two-Thirds For Random-Order Streaming Matching","venue":null,"work_id":"434975ad-c720-4e3e-9796-4090a259c221","year":2021},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.633422Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:f9608e8c1aa85ae93ad2118709b2694d44bafdb6ff97a290982808d5504aba2e","observation_id":"dc4dd55d-944b-4f9e-be33-d208e494aaee","resolution":{"observed_at":"2026-08-12T04:57:01.251862Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.637379Z","title":"Coresets meet edcs: algorithms for matching and vertex cover on massive graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.637379Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:88776ed31a434599717b74b4bd8ba50316b38d37d7144f11bcf0ba0305a21f22","observation_id":"804b7de5-8f07-4a31-ac1a-33cfc2feec18","resolution":{"observed_at":"2026-08-12T04:57:00.637379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.234883Z","title":"Woodruff, and Qin Zhang","venue":null,"work_id":"5f4d7934-d7a1-4619-9209-c6605f47734a","year":2016},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.641201Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:a77f01dc2cbc1f1e56f3f46dad45ab04b4c4345471e04abcf50f032ab470c989","observation_id":"5ba9516f-074b-4615-a7fc-967681501a61","resolution":{"observed_at":"2026-08-12T04:57:01.237850Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.226688Z","title":"A Simple Semi-Streaming Algorithm for Global Minimum Cuts , pages 172--180","venue":null,"work_id":"1e823501-ea66-462a-8ade-3ecba56980d3","year":2021},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.645023Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:890f707b944ee831e0d4a374421e251f90f82553a609f10ffdbcd500781bcd25","observation_id":"dcf2e4a5-37c4-4264-ae5a-6be9c3002c22","resolution":{"observed_at":"2026-08-12T04:57:01.229732Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.218379Z","title":"On the edge-expansion of graphs","venue":null,"work_id":"81ff5864-998f-4d5a-b0ec-f16d1cc8088a","year":1997},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.648506Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:df3ec2ce452b0e9d5a2bc588cbdf02c7638c29f6a0796c761da8294b1b630d53","observation_id":"ef57b34e-07bf-4681-acbc-8085a5a48258","resolution":{"observed_at":"2026-08-12T04:57:01.221373Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.209966Z","title":"Woodruff, and Samson Zhou","venue":null,"work_id":"deb6be76-08a8-424b-977b-b9dd28798797","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.651663Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:585e2ca89c790ff7012a52c65ab75f1bdc83734ce97fe4896f8ee44bbb452b1a","observation_id":"57ab6a4b-8432-4345-ac23-d6a65e3dc497","resolution":{"observed_at":"2026-08-12T04:57:01.213175Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.201507Z","title":"Improved bounds for matching in random-order streams","venue":null,"work_id":"93fa6d41-4353-490f-b99f-3bda2ca0bb7b","year":2023},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.655305Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:2723b86e49bb496e530064f80c432d14f894eac46651e907e3b122068fd67992","observation_id":"1210d8de-7333-42af-b67e-32783deb8eba","resolution":{"observed_at":"2026-08-12T04:57:01.204566Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.193043Z","title":"Bencz \\' u r and David R","venue":null,"work_id":"63caed86-6892-43a3-af08-8d4f133afb6c","year":1996},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.659183Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:ecedd734786c3d58d8da412126cd38bfc7bc23e5873e7c14c9f1e2aef30eb918","observation_id":"e60c9399-649e-4756-9371-095e2e424a25","resolution":{"observed_at":"2026-08-12T04:57:01.196157Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.184674Z","title":"Bencz \\' u r and David R","venue":null,"work_id":"31db165e-69c7-40d4-9e66-fe1ffa73031a","year":2015},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.662169Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:d60a5618a1cdec1399aa326751228234bc9b3febbceb955fd6cc7bf90d574f62","observation_id":"daf81bd7-3382-4bb7-8c56-1ff026e877bf","resolution":{"observed_at":"2026-08-12T04:57:01.187698Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.176082Z","title":"Batson, Daniel A","venue":null,"work_id":"7b4ad05f-8f4c-48e2-8fa9-3c4df9c029ef","year":2012},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.665195Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:03faef4d28a4f75e3ab2d8f3397ab401c17fccba56e9b5faa6aa1365cc0179c9","observation_id":"dfa527a6-4675-497d-b4ef-722fda603f2a","resolution":{"observed_at":"2026-08-12T04:57:01.179105Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.167281Z","title":"Robust lower bounds for communication and stream computation","venue":null,"work_id":"2a878173-2647-4e61-87fb-cce7ddf3ff45","year":2016},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.667995Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:bf739acc9345d90c571e0b2de13e2fc0c579431c41dbcf7e02c4a87323782587","observation_id":"b00872c1-876f-4ae3-847e-c5e00ceefc04","resolution":{"observed_at":"2026-08-12T04:57:01.170426Z","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":"1905.01644","last_updated":"2019-05-05T10:06:53Z","snapshot_observed_at":"2026-08-14T16:37:10.400693Z","submitted_at":"2019-05-05T10:06:53Z","title":"Testable Properties in General Graphs and Random Order Streaming","version":1},"cited_work":{"arxiv_id":"1905.01644","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.01644","snapshot_observed_at":"2026-08-12T04:57:00.827836Z","title":"Testable Properties in General Graphs and Random Order Streaming","venue":"cs.DS","work_id":"08446a39-92df-419f-a654-2063f1a50ed9","year":2019},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.671134Z"},"links":{"cited_paper":"/paper/1905.01644","citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:af5a389c885eba5357fb6cdeacfcac93a40f3a48e4caafde3b3293dc3f208658","observation_id":"029f9ff0-951a-42e3-aa2a-4e17077b032a","resolution":{"observed_at":"2026-08-12T04:57:00.831910Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.158594Z","title":"Vertex ordering problems in directed graph streams","venue":null,"work_id":"3a9f996c-223f-443e-a145-f9dd0646089a","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.674434Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:84f9d5c1a354699aafd35b9e3904424f774d3e3eea6c7353d145d611240e0008","observation_id":"e7a329f5-305b-4731-9473-0ee648b6c0ed","resolution":{"observed_at":"2026-08-12T04:57:01.161749Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.149329Z","title":"Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions","venue":null,"work_id":"3084bc7d-599e-4bb0-9f2e-87f9b5be8fd6","year":2018},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.677273Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:a9aa835c6f80e04c93e2dc00123c5c20bd5933c81ebc2b48d0360a8dc2e857bd","observation_id":"c37b8cd7-54ec-431b-a25c-92a8c9878188","resolution":{"observed_at":"2026-08-12T04:57:01.152950Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.138871Z","title":"Optimal lower bounds for sketching graph cuts","venue":null,"work_id":"c1fdccc2-aa1e-499b-8b13-248599fa7453","year":2019},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.680251Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:26ce3bf058813e87b39e9c9c66a22eb7fc3c1fc19370fb638d0e478e99138967","observation_id":"bd1a3b6e-e014-4f41-a527-36b018748873","resolution":{"observed_at":"2026-08-12T04:57:01.142238Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.129808Z","title":"Cohen, Cameron Musco, and Jakub Pachocki","venue":null,"work_id":"3b926136-e256-41cf-8a59-0c2cd1748013","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.682946Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:32eee779b49b9ca13f2441bdbdb08fd9a7bbec379aa006c67045b4d7566f8b52","observation_id":"1767e328-e190-4204-81bc-0ab34382b755","resolution":{"observed_at":"2026-08-12T04:57:01.132990Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.120724Z","title":"Approximate maximum matching in random streams","venue":null,"work_id":"5589f767-2687-439c-94e9-dab6581dac5a","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.685741Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:101515e31ce00151d6df310250612593cf3df73502d6166b77e32ef3b7bcc2b0","observation_id":"1316431e-edf1-4e6f-967d-48a01c68f398","resolution":{"observed_at":"2026-08-12T04:57:01.124089Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.112260Z","title":"Graph distances in the data-stream model","venue":null,"work_id":"335f1aab-7f47-4e64-a080-92dbec7a7225","year":2008},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.688466Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:19f5e051e596f49af44f2c93b1e2cafd70b73189a5806533dddc3b17e03adef6","observation_id":"787a20fe-92b9-4ccc-b0a9-4060a9d59843","resolution":{"observed_at":"2026-08-12T04:57:01.115391Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.103772Z","title":"Weighted matchings via unweighted augmentations","venue":null,"work_id":"af8797b9-5a1c-4562-96bd-9b8cfc0a5685","year":2019},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.691358Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:28b5742c5849fc8dfcb192dcc0391f987b9b5dbfeef1588582a419bac9050d92","observation_id":"5ab7ef98-b76e-4491-a8b4-d9af9d09fb90","resolution":{"observed_at":"2026-08-12T04:57:01.106769Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.094994Z","title":"Gilbert, Yi Li, Ely Porat, and Martin J","venue":null,"work_id":"3769426e-60cd-4a2c-8786-a8179b84e555","year":2012},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.694392Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:ba573e220b55eee9e0330980d4f38b7ed1cea7363e898fa7230e00065571a66f","observation_id":"9ce5e058-3efa-4201-9627-b067dd61303f","resolution":{"observed_at":"2026-08-12T04:57:01.098190Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.697153Z","title":"Stream order and order statistics: Quantile estimation in random-order streams","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.697153Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:a8f17629e7ea3a4e36f2247a1e7931f148773f5ef12311c707f81bbffca657cb","observation_id":"b30ed458-749a-4eba-8122-8eb7d001686d","resolution":{"observed_at":"2026-08-12T04:57:00.697153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.081242Z","title":"Hendrickx, Karl Henrik Johansson, Raphaël M","venue":null,"work_id":"ecf0dfc9-bda0-454c-8c0b-381f78ebc172","year":2014},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.700000Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:0a1ce61aba5aaa3d2427e4c7659d628a322caaffa9d321c4ee698ceafcbbf465","observation_id":"78c16681-efe8-4ed9-801b-f75fba4bb24f","resolution":{"observed_at":"2026-08-12T04:57:01.084344Z","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":"2408.15434","last_updated":"2024-08-27T22:34:17Z","snapshot_observed_at":"2026-08-12T22:56:15.926636Z","submitted_at":"2024-08-27T22:34:17Z","title":"Weighted Matching in the Random-Order Streaming and Robust Communication Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15434","snapshot_observed_at":"2026-08-12T04:57:00.702736Z","title":"Weighted matching in the random-order streaming and robust communication models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.702736Z"},"links":{"cited_paper":"/paper/2408.15434","citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:35b7bbfcb8b2b58a78659c9fb87fc4b178baa21e639053b27532839286a79cf0","observation_id":"0de2ebeb-7335-446b-8717-8acd0d072c79","resolution":{"observed_at":"2026-08-12T04:57:00.702736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.072034Z","title":"Efficient \\ o (n/eps) spectral sketches for the laplacian and its pseudoinverse","venue":null,"work_id":"4d927b6c-5173-4271-bf21-69315db42d3d","year":2018},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.705758Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:59edffe6800c6549dded7edd30d03f865abbcc6e66a64bdad62912cc72579605","observation_id":"e7e91c73-fc87-4249-986a-fb716cdff639","resolution":{"observed_at":"2026-08-12T04:57:01.075832Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.063609Z","title":"Space lower bounds for approximating maximum matching in the edge arrival model","venue":null,"work_id":"b03db3db-9381-461b-8142-5c641c97a217","year":2021},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.708470Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:04cc97ab1a27e4a2edf789eef5cc0f305136170d99705273a26c5685a73ec9a8","observation_id":"7c65eab7-148e-4887-a629-dced6770fb40","resolution":{"observed_at":"2026-08-12T04:57:01.066756Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.054916Z","title":null,"venue":null,"work_id":"0396cf46-a3fb-4fec-8d88-6d2476d63a1b","year":2000},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.711083Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:51e58083ce99c5043143bbcf1fc68210af66b4236d8dc339d6e74f42b706c7cd","observation_id":"faa1eea4-cc48-46f0-96f4-a7cb2f633f54","resolution":{"observed_at":"2026-08-12T04:57:01.057989Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.042984Z","title":"Approximating matching size from random streams","venue":null,"work_id":"4326d647-fdb1-4194-8a7f-1bd1f9f92203","year":2014},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.713787Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:3d37f55bcb474022992f02fed49ac6decb2107adb385de9cac725571b1e9e7ba","observation_id":"4151dfef-be33-4774-ab9e-6f6931444fb4","resolution":{"observed_at":"2026-08-12T04:57:01.045975Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.033600Z","title":"Karger and Matthew S","venue":null,"work_id":"796c9ede-33cf-42e4-a5d5-8b7ef5ed3b16","year":2002},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.716402Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:7dfbed0e7457edf65e5a98bd0ffb17276c2b0a1d40054a27f53522357be7b4d5","observation_id":"168b95d5-b8ba-4403-a14c-449ecc735072","resolution":{"observed_at":"2026-08-12T04:57:01.037047Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.024111Z","title":"Single pass spectral sparsification in dynamic streams","venue":null,"work_id":"8c020420-f75c-4e20-bcf9-9e27e30b5001","year":2017},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.719039Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:d9646967101dd2ccc5efa13a065068d6401a6e7f2d6af499c23eec3370aaef98","observation_id":"08f1c4e5-8b6e-4d52-a887-83643bd6a712","resolution":{"observed_at":"2026-08-12T04:57:01.027475Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.014955Z","title":"Maximum matching in semi-streaming with few passes","venue":null,"work_id":"b47a46c3-9b9b-42bc-a70e-24c8df5a4a91","year":2012},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.721708Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:65bf638325f610861671b94ce0eab2d4f0135b4233345a4657a0757b4dd047da","observation_id":"884a17b4-4ed4-4c4d-bded-e81c8c129bc2","resolution":{"observed_at":"2026-08-12T04:57:01.018273Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:01.005720Z","title":"Fast and space efficient spectral sparsification in dynamic streams","venue":null,"work_id":"138051df-3795-4b4e-8747-0663f25e16fe","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.724375Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:870a9de61fe112794503f6acfe2dcba12a264120af7a73f10c6e2b64a4b962de","observation_id":"895c8af1-a555-4f02-8262-f1fc98da89ac","resolution":{"observed_at":"2026-08-12T04:57:01.008913Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.997105Z","title":"Communication Complexity","venue":null,"work_id":"c4df3ba7-cda3-4578-9fc9-700b310bcfa9","year":1996},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.727182Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:8d09afb4201a09d7a7b3426be2d0ee612c0d7a5303a4b1bf8dc29dc245ec03d9","observation_id":"ee06cc91-01f0-4d97-9c13-b388438a0c00","resolution":{"observed_at":"2026-08-12T04:57:01.000117Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.988092Z","title":"A simple augmentation method for matchings with applications to streaming algorithms","venue":null,"work_id":"ebecd45e-4f68-4890-aabf-1010a8753bcb","year":2018},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.729735Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:7cb0152225f9f83ad24e9e06ebeba2ec1a84f4a538e52d57b5b1975a8a38b131","observation_id":"b9e9ae21-d679-4695-a5e6-2e4e18f229f6","resolution":{"observed_at":"2026-08-12T04:57:00.991397Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.732483Z","title":"Karger and Clifford Stein","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.732483Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:92b0acfbad95d3649b14dec251601130a310e8918bb6898c3fd10e500569a420","observation_id":"62918258-61e1-4068-ab94-0f1efb8e3107","resolution":{"observed_at":"2026-08-12T04:57:00.732483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.974040Z","title":"Fast approximation algorithms for cut-based problems in undirected graphs","venue":null,"work_id":"ace4ceea-1ea1-46f5-bf5f-0e1b9cf04a52","year":2010},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.735311Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:bcf283074332b8d6fda5d8b37be62c0e6f0460a6722a884789d4c62d8e6718a5","observation_id":"5468c28b-8b2f-40be-af3b-438aaaa45269","resolution":{"observed_at":"2026-08-12T04:57:00.977235Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.965302Z","title":"Graph stream algorithms: A survey","venue":null,"work_id":"c3518fd8-9f3d-4733-a861-82df8e464e6f","year":2014},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.738148Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:5ee8cd07e892a12c6d8f43cc169383846e73dc49e7a328e0860072fb3d2a9da5","observation_id":"47c4e793-ecca-4661-9549-dc4254bc0c78","resolution":{"observed_at":"2026-08-12T04:57:00.968385Z","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":"1707.07334","last_updated":"2017-07-23T19:35:37Z","snapshot_observed_at":"2026-08-14T20:45:51.929253Z","submitted_at":"2017-07-23T19:35:37Z","title":"Testable Bounded Degree Graph Properties Are Random Order Streamable","version":1},"cited_work":{"arxiv_id":"1707.07334","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.07334","snapshot_observed_at":"2026-08-12T04:57:00.805572Z","title":"Testable Bounded Degree Graph Properties Are Random Order Streamable","venue":"cs.DS","work_id":"29998e1c-6475-4b27-bf2c-ff3e17c19fe4","year":2017},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.740900Z"},"links":{"cited_paper":"/paper/1707.07334","citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:9c32a69b94e50e4b30d4f6e1d9108e8c025a8e9f2f35b620e7018d133fe841be","observation_id":"b6a4bbc6-0821-4406-a588-0b52d208feb2","resolution":{"observed_at":"2026-08-12T04:57:00.810595Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.956270Z","title":"Weighted min-cut: sequential, cut-query, and streaming algorithms","venue":null,"work_id":"7393144b-4525-4113-b183-90be3977d1d5","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.744193Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:e094b3bb55fc2a0a32bb4a1553d2a121422059ca3bdfb11cb7809d264705389c","observation_id":"af77e19a-49d6-49bc-876d-787dd5d605e6","resolution":{"observed_at":"2026-08-12T04:57:00.959449Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.746946Z","title":"Munro and M.S","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.746946Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:84a3e1e85f9f715dee4e40a1315754c09b831fd6f1980ae286dbcd5c4de66720","observation_id":"2384a345-a3ac-4bc1-9d5b-5a17e24c578c","resolution":{"observed_at":"2026-08-12T04:57:00.746946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.942171Z","title":"Concentration of hitting times in erd o s-r \\'e nyi graphs","venue":null,"work_id":"9454f9e3-e818-48d9-a82e-bb4dc9781169","year":2023},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.749824Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:3389e431c3181f5d4d0f7630582de82763cdf61b5cf0ee4705cfa61a19cb91fc","observation_id":"00fff595-935f-4901-8285-6d4fc9fc8a0a","resolution":{"observed_at":"2026-08-12T04:57:00.945644Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.933009Z","title":"Estimating graph parameters from random order streams","venue":null,"work_id":"eff6a141-ac47-4408-83a0-304f6d733ceb","year":2018},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.752686Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:2e39f87370e8b234bc32119002b6a78848ee698dc8956a26ff3ac75419a02e2f","observation_id":"108c766e-457f-4079-b85f-94da94baa508","resolution":{"observed_at":"2026-08-12T04:57:00.936222Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.924250Z","title":"Optimal short cycle decomposition in almost linear time","venue":null,"work_id":"028da21a-7011-44d1-a3e7-5c26baa793d0","year":2019},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.755443Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:98a998e7c16538d715690d6a8e1fbe71dbced4d02261f35b72d147f8aea139a6","observation_id":"4d6d2869-d7db-4325-9311-999bc357f31b","resolution":{"observed_at":"2026-08-12T04:57:00.927477Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.915545Z","title":"Matthew Weinberg","venue":null,"work_id":"efa66b49-b8ac-47e1-a5f4-38529bc430fb","year":2018},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.758270Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:de712029dc2fb2eb246abdc4d71a59b34180f008f7b2c782c128c51172f30e30","observation_id":"45013b5a-3297-4cea-a24b-03ebf8e77573","resolution":{"observed_at":"2026-08-12T04:57:00.918577Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.906276Z","title":"Breaking the multicommodity flow barrier for o(vlog n)-approximations to sparsest cut","venue":null,"work_id":"82175431-addf-4d69-96be-01ccd0d6933f","year":2009},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.761170Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:c063119227d6a258cb061f428afba3e2e03287d2d027c2f5a04676e473aa9609","observation_id":"1bda9763-34be-40eb-a635-83b06eff516b","resolution":{"observed_at":"2026-08-12T04:57:00.909646Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.897144Z","title":"Isolation vulnerability analysis in road network: Edge connectivity and critical link sets","venue":null,"work_id":"5a44ff0b-569b-4066-bb8c-92dbce83b539","year":2023},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.764027Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:69bcd5edbae5a31eca1e791c55bc133ba322e9896f021062c72937578c7fb154","observation_id":"908a742a-0555-4032-940b-40446c98f90f","resolution":{"observed_at":"2026-08-12T04:57:00.900565Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.766782Z","title":"Spielman and Nikhil Srivastava","venue":null,"work_id":null,"year":1913},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.766782Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:3e5ef4924051313b554e95237ee55e37a23c57795ebe5b952d10f4180d19b8f7","observation_id":"e54a056b-787f-49a8-9c4d-7caeaf21d50b","resolution":{"observed_at":"2026-08-12T04:57:00.766782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.883806Z","title":"Spielman and Shang - Hua Teng","venue":null,"work_id":"f5f8e6d3-bede-4c33-a627-6cbf763943d4","year":2004},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.769729Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:a060f5fb429127476ad2260fa8cb790348efb1b1db20fc2923b4f96adb887894","observation_id":"b492ea1c-3782-4cd8-9556-74fd76bbf68d","resolution":{"observed_at":"2026-08-12T04:57:00.886693Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.873813Z","title":"Spielman and Shang - Hua Teng","venue":null,"work_id":"79ee6c92-a187-41d9-b09c-40c02ae58e6a","year":2011},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.772388Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:f7b32ccd1ada5b2ceee7b87710602d7f8b377be8af98f1f348280c39688fdad5","observation_id":"61e3e8a0-5e34-493e-b9ae-7b6deaa398ea","resolution":{"observed_at":"2026-08-12T04:57:00.877783Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.864848Z","title":"Woodruff","venue":null,"work_id":"c5cd1b1d-501b-42f0-95d9-b848be16513b","year":2015},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.775206Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:95f3e3e3f98865367084de528194552205f9454c42b31eeee55c408fe645f12d","observation_id":"e9e7498b-7757-46dd-841f-85806704d498","resolution":{"observed_at":"2026-08-12T04:57:00.868115Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.855931Z","title":"Efficient targeted influence minimization in big social networks","venue":null,"work_id":"68972da0-c43f-46b3-9e16-c55cec7e00b3","year":2020},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.777954Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:2492b9f8f05b09e3e2e119aece51d4083f9cef59b41bbd0b355e79489740ee20","observation_id":"00c11a41-b1dd-453b-9cd5-469208cbba54","resolution":{"observed_at":"2026-08-12T04:57:00.859062Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.846360Z","title":"Williamson","venue":null,"work_id":"06a67f86-9368-4185-8b24-0824f84a4989","year":2016},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.780738Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:ae34da386caf42be50327992f7118bdc6a6b98beee8ffd3ba607f5c2727d1d2a","observation_id":"8fde4e53-75ae-43bc-88da-1de1f4abc070","resolution":{"observed_at":"2026-08-12T04:57:00.849513Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:57:00.837853Z","title":"Intractability of min- and max-cut in streaming graphs","venue":null,"work_id":"aeefa8ef-3b37-4876-8e54-fddf74763bed","year":2011},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.783606Z"},"links":{"citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:b114efab71c465126ad5c22ca39a677e73a44e23c2b885bced5f661ebcd7e403","observation_id":"d1c350b0-751a-400f-beb1-0cdccf7b06a6","resolution":{"observed_at":"2026-08-12T04:57:00.840921Z","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"}}],"paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":43},"total_outbound_references":52},"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 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2412.01143."}