{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IBMJLAWANQ2HSKECVALGXFREQ2","short_pith_number":"pith:IBMJLAWA","schema_version":"1.0","canonical_sha256":"40589582c06c34792882a8166b962486b364c7bf0894fdfdf9debd42965ebe07","source":{"kind":"arxiv","id":"2211.04685","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Vertex Connectivity in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sepehr Assadi, Vihan Shah","submitted_at":"2022-11-09T05:09:19Z","abstract_excerpt":"We present a streaming algorithm for the vertex connectivity problem in dynamic streams with a (nearly) optimal space bound: for any $n$-vertex graph $G$ and any integer $k \\geq 1$, our algorithm with high probability outputs whether or not $G$ is $k$-vertex-connected in a single pass using $\\widetilde{O}(k n)$ space.\n  Our upper bound matches the known $\\Omega(k n)$ lower bound for this problem even in insertion-only streams -- which we extend to multi-pass algorithms in this paper -- and closes one of the last remaining gaps in our understanding of dynamic versus insertion-only streams. Our "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2211.04685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T05:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"d9668d5695447c1da6962791ea45ed2d41fd77f7b552c455dc1b68c392e02320","abstract_canon_sha256":"b464075125c78706812e046bed35abf49220b5d12fc4b947c1c820cb6d1f799b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:14:40.586830Z","signature_b64":"6dlZjj+oHrmh3lCCK7Zf9+zHzLfOJRDkwNloZruMJymBTFkG8EFS9J9/uDePlBl1HGLNMjY10Kf/hhhyNruUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40589582c06c34792882a8166b962486b364c7bf0894fdfdf9debd42965ebe07","last_reissued_at":"2026-07-05T05:14:40.586403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:14:40.586403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Vertex Connectivity in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sepehr Assadi, Vihan Shah","submitted_at":"2022-11-09T05:09:19Z","abstract_excerpt":"We present a streaming algorithm for the vertex connectivity problem in dynamic streams with a (nearly) optimal space bound: for any $n$-vertex graph $G$ and any integer $k \\geq 1$, our algorithm with high probability outputs whether or not $G$ is $k$-vertex-connected in a single pass using $\\widetilde{O}(k n)$ space.\n  Our upper bound matches the known $\\Omega(k n)$ lower bound for this problem even in insertion-only streams -- which we extend to multi-pass algorithms in this paper -- and closes one of the last remaining gaps in our understanding of dynamic versus insertion-only streams. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04685","kind":"arxiv","version":1},"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/2211.04685/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.04685","created_at":"2026-07-05T05:14:40.586467+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04685v1","created_at":"2026-07-05T05:14:40.586467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04685","created_at":"2026-07-05T05:14:40.586467+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBMJLAWANQ2H","created_at":"2026-07-05T05:14:40.586467+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBMJLAWANQ2HSKEC","created_at":"2026-07-05T05:14:40.586467+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBMJLAWA","created_at":"2026-07-05T05:14:40.586467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2","json":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2.json","graph_json":"https://pith.science/api/pith-number/IBMJLAWANQ2HSKECVALGXFREQ2/graph.json","events_json":"https://pith.science/api/pith-number/IBMJLAWANQ2HSKECVALGXFREQ2/events.json","paper":"https://pith.science/paper/IBMJLAWA"},"agent_actions":{"view_html":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2","download_json":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2.json","view_paper":"https://pith.science/paper/IBMJLAWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04685&json=true","fetch_graph":"https://pith.science/api/pith-number/IBMJLAWANQ2HSKECVALGXFREQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/IBMJLAWANQ2HSKECVALGXFREQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/action/storage_attestation","attest_author":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/action/author_attestation","sign_citation":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/action/citation_signature","submit_replication":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/action/replication_record"}},"created_at":"2026-07-05T05:14:40.586467+00:00","updated_at":"2026-07-05T05:14:40.586467+00:00"}