{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Q6Z6EEUWUSKTDY4RD5OMLP64LF","short_pith_number":"pith:Q6Z6EEUW","canonical_record":{"source":{"id":"2504.06033","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-08T13:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"938c2c71044d610291356fb8a88e66b5424258b1f6af7e40f4683d1dd7ccf487","abstract_canon_sha256":"347a8c18c8e34533792f47209eb486df199e36dde95111a14a17ccb989abb550"},"schema_version":"1.0"},"canonical_sha256":"87b3e21296a49531e3911f5cc5bfdc597c489071616ee85f605f1d36da0a5f63","source":{"kind":"arxiv","id":"2504.06033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06033","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06033v1","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06033","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"Q6Z6EEUWUSKT","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"pith_short_16","alias_value":"Q6Z6EEUWUSKTDY4R","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"pith_short_8","alias_value":"Q6Z6EEUW","created_at":"2026-07-05T10:46:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Q6Z6EEUWUSKTDY4RD5OMLP64LF","target":"record","payload":{"canonical_record":{"source":{"id":"2504.06033","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-08T13:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"938c2c71044d610291356fb8a88e66b5424258b1f6af7e40f4683d1dd7ccf487","abstract_canon_sha256":"347a8c18c8e34533792f47209eb486df199e36dde95111a14a17ccb989abb550"},"schema_version":"1.0"},"canonical_sha256":"87b3e21296a49531e3911f5cc5bfdc597c489071616ee85f605f1d36da0a5f63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:14.461506Z","signature_b64":"F3ZcAPgc5qVZOzAXXykZ0ijainsNzVUHDJxldx6yytu9ah44n3ph++JIz/wuyQvSmy+l8dEPJt7RUF+4/m1jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87b3e21296a49531e3911f5cc5bfdc597c489071616ee85f605f1d36da0a5f63","last_reissued_at":"2026-07-05T10:46:14.461075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:14.461075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.06033","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-05T10:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEOietLjh+n0avnyss3H8l9D2wH9LJtjXDLV9rmmGvmfosXYWcikJMu7G5bebLLFW0wg4heFGUUDjC+mGK8SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:00:42.519708Z"},"content_sha256":"e0bb781c5acb8dcb3f90c5340abb63ba501e77314836e7539465491536e4df53","schema_version":"1.0","event_id":"sha256:e0bb781c5acb8dcb3f90c5340abb63ba501e77314836e7539465491536e4df53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Q6Z6EEUWUSKTDY4RD5OMLP64LF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Changki Yun, Yonggang Jiang","submitted_at":"2025-04-08T13:35:38Z","abstract_excerpt":"We present a randomized parallel algorithm in the {\\sf PRAM} model for $k$-vertex connectivity. Given an undirected simple graph, our algorithm either finds a set of fewer than $k$ vertices whose removal disconnects the graph or reports that no such set exists. The algorithm runs in $O(m \\cdot \\text{poly}(k, \\log n))$ work and $O(\\text{poly}(k, \\log n))$ depth, which is nearly optimal for any $k = \\text{poly}(\\log n)$. Prior to our work, algorithms with near-linear work and polylogarithmic depth were known only for $k=3$ [Miller, Ramachandran, STOC'87]; for $k=4$, sequential algorithms achievi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06033","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/2504.06033/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-05T10:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTU1C6nhsrgdh3NFttsBplP19cT35bX32BB6sEvAV6nLd5Xx6MI602nOT3oD7VL81tTFjcmZO7v/ZOf7ArqEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:00:42.520081Z"},"content_sha256":"54d393556af3ef6101b0fdd4421c57f45816d3faf25bc9e59cfb6c2d5838a89f","schema_version":"1.0","event_id":"sha256:54d393556af3ef6101b0fdd4421c57f45816d3faf25bc9e59cfb6c2d5838a89f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF/bundle.json","state_url":"https://pith.science/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF/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-07T10:00:42Z","links":{"resolver":"https://pith.science/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF","bundle":"https://pith.science/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF/bundle.json","state":"https://pith.science/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6Z6EEUWUSKTDY4RD5OMLP64LF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Q6Z6EEUWUSKTDY4RD5OMLP64LF","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":"347a8c18c8e34533792f47209eb486df199e36dde95111a14a17ccb989abb550","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-08T13:35:38Z","title_canon_sha256":"938c2c71044d610291356fb8a88e66b5424258b1f6af7e40f4683d1dd7ccf487"},"schema_version":"1.0","source":{"id":"2504.06033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06033","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06033v1","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06033","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"Q6Z6EEUWUSKT","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"pith_short_16","alias_value":"Q6Z6EEUWUSKTDY4R","created_at":"2026-07-05T10:46:14Z"},{"alias_kind":"pith_short_8","alias_value":"Q6Z6EEUW","created_at":"2026-07-05T10:46:14Z"}],"graph_snapshots":[{"event_id":"sha256:54d393556af3ef6101b0fdd4421c57f45816d3faf25bc9e59cfb6c2d5838a89f","target":"graph","created_at":"2026-07-05T10:46:14Z","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/2504.06033/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a randomized parallel algorithm in the {\\sf PRAM} model for $k$-vertex connectivity. Given an undirected simple graph, our algorithm either finds a set of fewer than $k$ vertices whose removal disconnects the graph or reports that no such set exists. The algorithm runs in $O(m \\cdot \\text{poly}(k, \\log n))$ work and $O(\\text{poly}(k, \\log n))$ depth, which is nearly optimal for any $k = \\text{poly}(\\log n)$. Prior to our work, algorithms with near-linear work and polylogarithmic depth were known only for $k=3$ [Miller, Ramachandran, STOC'87]; for $k=4$, sequential algorithms achievi","authors_text":"Changki Yun, Yonggang Jiang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-08T13:35:38Z","title":"Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06033","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:e0bb781c5acb8dcb3f90c5340abb63ba501e77314836e7539465491536e4df53","target":"record","created_at":"2026-07-05T10:46:14Z","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":"347a8c18c8e34533792f47209eb486df199e36dde95111a14a17ccb989abb550","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-08T13:35:38Z","title_canon_sha256":"938c2c71044d610291356fb8a88e66b5424258b1f6af7e40f4683d1dd7ccf487"},"schema_version":"1.0","source":{"id":"2504.06033","kind":"arxiv","version":1}},"canonical_sha256":"87b3e21296a49531e3911f5cc5bfdc597c489071616ee85f605f1d36da0a5f63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87b3e21296a49531e3911f5cc5bfdc597c489071616ee85f605f1d36da0a5f63","first_computed_at":"2026-07-05T10:46:14.461075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:46:14.461075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F3ZcAPgc5qVZOzAXXykZ0ijainsNzVUHDJxldx6yytu9ah44n3ph++JIz/wuyQvSmy+l8dEPJt7RUF+4/m1jAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:46:14.461506Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.06033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0bb781c5acb8dcb3f90c5340abb63ba501e77314836e7539465491536e4df53","sha256:54d393556af3ef6101b0fdd4421c57f45816d3faf25bc9e59cfb6c2d5838a89f"],"state_sha256":"25d6de438c52723c669ff9612630ce6df826ff1a1c98ad689faf8cb983f4db41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFpgomZSy3xjLzHUlWNhu8LWcj9ZPFIuuCgfwwOQwpuocodlkvQAnf1fNO62jl10q0s8FtTgybgbLUUMk9SXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:00:42.522167Z","bundle_sha256":"70b25daca0bb4d88f6262478166684f0b1087eaba2f2d595ec9145c7fea4bf77"}}