{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IBMJLAWANQ2HSKECVALGXFREQ2","short_pith_number":"pith:IBMJLAWA","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"},"canonical_sha256":"40589582c06c34792882a8166b962486b364c7bf0894fdfdf9debd42965ebe07","source":{"kind":"arxiv","id":"2211.04685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04685","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04685v1","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04685","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"pith_short_12","alias_value":"IBMJLAWANQ2H","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"pith_short_16","alias_value":"IBMJLAWANQ2HSKEC","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"pith_short_8","alias_value":"IBMJLAWA","created_at":"2026-07-05T05:14:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IBMJLAWANQ2HSKECVALGXFREQ2","target":"record","payload":{"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"},"canonical_sha256":"40589582c06c34792882a8166b962486b364c7bf0894fdfdf9debd42965ebe07","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"},"source_kind":"arxiv","source_id":"2211.04685","source_version":1,"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-05T05:14:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5DtoJPBtZ5xTNGQVZZW3IR5h9E5E9zHEVaAuiZmJVclsRs3HXZqmITP4X7iPb+VAbHcay/ZrQWU17RJpE68CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T23:26:47.640061Z"},"content_sha256":"0094b469a2efe2cac4dc7e3e261c1b1a695c1a48dbd8325e73b7dcd5f84c7266","schema_version":"1.0","event_id":"sha256:0094b469a2efe2cac4dc7e3e261c1b1a695c1a48dbd8325e73b7dcd5f84c7266"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IBMJLAWANQ2HSKECVALGXFREQ2","target":"graph","payload":{"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"},"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-05T05:14:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVODyR+wR31mvFaEdMRSze5qjKVrChcRU1xodxR4iSLgbfd9IA77f4NQ8LGoE1rxw8K9HzXq8ye/+8jEMIrhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T23:26:47.640448Z"},"content_sha256":"bb5a13a2bcb2113c658bf42e0bf76ae2daa03c98cfa3520c144bfddb8a0a6884","schema_version":"1.0","event_id":"sha256:bb5a13a2bcb2113c658bf42e0bf76ae2daa03c98cfa3520c144bfddb8a0a6884"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/bundle.json","state_url":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBMJLAWANQ2HSKECVALGXFREQ2/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-07-09T23:26:47Z","links":{"resolver":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2","bundle":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/bundle.json","state":"https://pith.science/pith/IBMJLAWANQ2HSKECVALGXFREQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBMJLAWANQ2HSKECVALGXFREQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IBMJLAWANQ2HSKECVALGXFREQ2","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":"b464075125c78706812e046bed35abf49220b5d12fc4b947c1c820cb6d1f799b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T05:09:19Z","title_canon_sha256":"d9668d5695447c1da6962791ea45ed2d41fd77f7b552c455dc1b68c392e02320"},"schema_version":"1.0","source":{"id":"2211.04685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04685","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04685v1","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04685","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"pith_short_12","alias_value":"IBMJLAWANQ2H","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"pith_short_16","alias_value":"IBMJLAWANQ2HSKEC","created_at":"2026-07-05T05:14:40Z"},{"alias_kind":"pith_short_8","alias_value":"IBMJLAWA","created_at":"2026-07-05T05:14:40Z"}],"graph_snapshots":[{"event_id":"sha256:bb5a13a2bcb2113c658bf42e0bf76ae2daa03c98cfa3520c144bfddb8a0a6884","target":"graph","created_at":"2026-07-05T05:14:40Z","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/2211.04685/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Sepehr Assadi, Vihan Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T05:09:19Z","title":"Tight Bounds for Vertex Connectivity in Dynamic Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04685","kind":"arxiv","version":1},"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:0094b469a2efe2cac4dc7e3e261c1b1a695c1a48dbd8325e73b7dcd5f84c7266","target":"record","created_at":"2026-07-05T05:14:40Z","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":"b464075125c78706812e046bed35abf49220b5d12fc4b947c1c820cb6d1f799b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T05:09:19Z","title_canon_sha256":"d9668d5695447c1da6962791ea45ed2d41fd77f7b552c455dc1b68c392e02320"},"schema_version":"1.0","source":{"id":"2211.04685","kind":"arxiv","version":1}},"canonical_sha256":"40589582c06c34792882a8166b962486b364c7bf0894fdfdf9debd42965ebe07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40589582c06c34792882a8166b962486b364c7bf0894fdfdf9debd42965ebe07","first_computed_at":"2026-07-05T05:14:40.586403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:14:40.586403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dlZjj+oHrmh3lCCK7Zf9+zHzLfOJRDkwNloZruMJymBTFkG8EFS9J9/uDePlBl1HGLNMjY10Kf/hhhyNruUCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:14:40.586830Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0094b469a2efe2cac4dc7e3e261c1b1a695c1a48dbd8325e73b7dcd5f84c7266","sha256:bb5a13a2bcb2113c658bf42e0bf76ae2daa03c98cfa3520c144bfddb8a0a6884"],"state_sha256":"e261c5e39390e92e9646cb3e12d1538235f5f7cff8094481efd293115a8365f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ub1+Iz4Ce6B2L1aEyqmNVO3kGimsrWzeKrreFSHh1cyzhtWHJsLUHhC1TcN0OXZdIY/5Fs3tmlKBXU/OLXOzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T23:26:47.642590Z","bundle_sha256":"0f2eadf34cd74a73f4416043818f580e89a33bce3e7ecba25e62f3ba0a7d64b2"}}