{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:G4CR7BG2L3RMEWYVU3PPIS3EAN","short_pith_number":"pith:G4CR7BG2","canonical_record":{"source":{"id":"2412.01143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-02T05:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"b2df3a7a6f43ad814332808ef2cd390ddf8822ceb8b7e496f04df64b65040c97","abstract_canon_sha256":"99f14f7e9f63a842159044112fedc650f8106b6c4c5260864b829edbc6692aa0"},"schema_version":"1.0"},"canonical_sha256":"37051f84da5ee2c25b15a6def44b64035226dd3f80ff0d5bfb97b5db676883d2","source":{"kind":"arxiv","id":"2412.01143","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01143","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01143v2","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01143","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"G4CR7BG2L3RM","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"pith_short_16","alias_value":"G4CR7BG2L3RMEWYV","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"pith_short_8","alias_value":"G4CR7BG2","created_at":"2026-07-05T09:45:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:G4CR7BG2L3RMEWYVU3PPIS3EAN","target":"record","payload":{"canonical_record":{"source":{"id":"2412.01143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-02T05:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"b2df3a7a6f43ad814332808ef2cd390ddf8822ceb8b7e496f04df64b65040c97","abstract_canon_sha256":"99f14f7e9f63a842159044112fedc650f8106b6c4c5260864b829edbc6692aa0"},"schema_version":"1.0"},"canonical_sha256":"37051f84da5ee2c25b15a6def44b64035226dd3f80ff0d5bfb97b5db676883d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:16.982604Z","signature_b64":"eoCgOdRVQ/wgQQIwZCdKHFbVwEkt5Q2jZlejoli/7jHQZwvgfY4al/tBj2mp7TKUP+AldcYOVt5pg7yh4hkmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37051f84da5ee2c25b15a6def44b64035226dd3f80ff0d5bfb97b5db676883d2","last_reissued_at":"2026-07-05T09:45:16.982077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:16.982077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.01143","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVm9N5Bv3hnbyTtxOKgzl7SKaYcFOEbN5Y+2tBdQJzS3OZWX0+nU4O9OfrbecAOApQWegFQK+XpdakM2ksZJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:36:32.922750Z"},"content_sha256":"c82b23c66c99b46f8c2f18e676fb7a4264e7dbb625812271aca8ad2254300247","schema_version":"1.0","event_id":"sha256:c82b23c66c99b46f8c2f18e676fb7a4264e7dbb625812271aca8ad2254300247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:G4CR7BG2L3RMEWYVU3PPIS3EAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandro Garces, David P. Woodruff, Honghao Lin, Jason Li, Jelani Nelson, Matthew Ding, Vihan Shah","submitted_at":"2024-12-02T05:38:43Z","abstract_excerpt":"We consider the problem of finding a minimum cut of a weighted graph presented as a single-pass stream. While graph sparsification in streams has been intensively studied, the specific application of finding minimum cuts in streams is less well-studied. To this end, we show upper and lower bounds on minimum cut problems in insertion-only streams for a variety of settings, including for both randomized and deterministic algorithms, for both arbitrary and random order streams, and for both approximate and exact algorithms. One of our main results is an $\\widetilde{O}(n/\\varepsilon)$ space algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01143","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.01143/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OU3PH7vg1idP0EClfOb8WF2PhdxNGrioyNO+oGGBKNPIj7lWFBj65iJArgj/aps64eZmZKrX0K+UrettgAJ5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:36:32.923122Z"},"content_sha256":"a9016f124fa5723679989e004c588b2167d3c7517f6c8df32e08aa264c288256","schema_version":"1.0","event_id":"sha256:a9016f124fa5723679989e004c588b2167d3c7517f6c8df32e08aa264c288256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN/bundle.json","state_url":"https://pith.science/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T18:36:32Z","links":{"resolver":"https://pith.science/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN","bundle":"https://pith.science/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN/bundle.json","state":"https://pith.science/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4CR7BG2L3RMEWYVU3PPIS3EAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G4CR7BG2L3RMEWYVU3PPIS3EAN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"99f14f7e9f63a842159044112fedc650f8106b6c4c5260864b829edbc6692aa0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-02T05:38:43Z","title_canon_sha256":"b2df3a7a6f43ad814332808ef2cd390ddf8822ceb8b7e496f04df64b65040c97"},"schema_version":"1.0","source":{"id":"2412.01143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01143","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01143v2","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01143","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"G4CR7BG2L3RM","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"pith_short_16","alias_value":"G4CR7BG2L3RMEWYV","created_at":"2026-07-05T09:45:16Z"},{"alias_kind":"pith_short_8","alias_value":"G4CR7BG2","created_at":"2026-07-05T09:45:16Z"}],"graph_snapshots":[{"event_id":"sha256:a9016f124fa5723679989e004c588b2167d3c7517f6c8df32e08aa264c288256","target":"graph","created_at":"2026-07-05T09:45:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.01143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of finding a minimum cut of a weighted graph presented as a single-pass stream. While graph sparsification in streams has been intensively studied, the specific application of finding minimum cuts in streams is less well-studied. To this end, we show upper and lower bounds on minimum cut problems in insertion-only streams for a variety of settings, including for both randomized and deterministic algorithms, for both arbitrary and random order streams, and for both approximate and exact algorithms. One of our main results is an $\\widetilde{O}(n/\\varepsilon)$ space algori","authors_text":"Alexandro Garces, David P. Woodruff, Honghao Lin, Jason Li, Jelani Nelson, Matthew Ding, Vihan Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01143","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c82b23c66c99b46f8c2f18e676fb7a4264e7dbb625812271aca8ad2254300247","target":"record","created_at":"2026-07-05T09:45:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"99f14f7e9f63a842159044112fedc650f8106b6c4c5260864b829edbc6692aa0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-02T05:38:43Z","title_canon_sha256":"b2df3a7a6f43ad814332808ef2cd390ddf8822ceb8b7e496f04df64b65040c97"},"schema_version":"1.0","source":{"id":"2412.01143","kind":"arxiv","version":2}},"canonical_sha256":"37051f84da5ee2c25b15a6def44b64035226dd3f80ff0d5bfb97b5db676883d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37051f84da5ee2c25b15a6def44b64035226dd3f80ff0d5bfb97b5db676883d2","first_computed_at":"2026-07-05T09:45:16.982077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:45:16.982077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eoCgOdRVQ/wgQQIwZCdKHFbVwEkt5Q2jZlejoli/7jHQZwvgfY4al/tBj2mp7TKUP+AldcYOVt5pg7yh4hkmDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:45:16.982604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.01143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c82b23c66c99b46f8c2f18e676fb7a4264e7dbb625812271aca8ad2254300247","sha256:a9016f124fa5723679989e004c588b2167d3c7517f6c8df32e08aa264c288256"],"state_sha256":"adba415165416dc833aaed7bf218d1580aaca1b27194ca271e28dbf26019bde5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEid+/eX4Lfz2R3j0Zt4c7jPbmXrOvtcpygR7F6dH7Rr+au/Uj6+MsbM+JqMmEDDgZMVqFBl7eTK7r8T9EwXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:36:32.925499Z","bundle_sha256":"8d004127428c18951b6af1d97e75e0c74fd2e32aeec0c7310841ff25d1c1d5b7"}}