{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AQY76V7DKD5CC47XAESFT2XPVN","short_pith_number":"pith:AQY76V7D","canonical_record":{"source":{"id":"1905.05329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T00:46:31Z","cross_cats_sorted":[],"title_canon_sha256":"ab953326b080df4a552a1f7a20645acf1aa7032209224f0158d94144e71ade0b","abstract_canon_sha256":"715e1145c881a95dc4626f0173ffec745b7458ea99ca175b1b3657b8794793c6"},"schema_version":"1.0"},"canonical_sha256":"0431ff57e350fa2173f7012459eaefab5a6535eaee8d3b131b094f0665c6ccde","source":{"kind":"arxiv","id":"1905.05329","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05329","created_at":"2026-05-17T23:41:21Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05329v2","created_at":"2026-05-17T23:41:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05329","created_at":"2026-05-17T23:41:21Z"},{"alias_kind":"pith_short_12","alias_value":"AQY76V7DKD5C","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AQY76V7DKD5CC47X","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AQY76V7D","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AQY76V7DKD5CC47XAESFT2XPVN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T00:46:31Z","cross_cats_sorted":[],"title_canon_sha256":"ab953326b080df4a552a1f7a20645acf1aa7032209224f0158d94144e71ade0b","abstract_canon_sha256":"715e1145c881a95dc4626f0173ffec745b7458ea99ca175b1b3657b8794793c6"},"schema_version":"1.0"},"canonical_sha256":"0431ff57e350fa2173f7012459eaefab5a6535eaee8d3b131b094f0665c6ccde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:21.641775Z","signature_b64":"EqX+BFp5dKpzWxLAf6fFf0TBAegUNNInNE4i8ePQNsV4CfbQPudL3sgTrJ4MHyx2GZS6b/JxtBTR2EMomuZ6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0431ff57e350fa2173f7012459eaefab5a6535eaee8d3b131b094f0665c6ccde","last_reissued_at":"2026-05-17T23:41:21.641043Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:21.641043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05329","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-05-17T23:41:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOo3Hgcv/V04lEIteMLqSZoHyc+pdRFme/vCz72igJ0w17k2Q6MfBiCqSsSr4HWA9jc3oRibkUPi411Ts+imCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:27:45.314270Z"},"content_sha256":"db2859669859781a307825ea41f6f07809ab710b8fa3fac26f098111553224c6","schema_version":"1.0","event_id":"sha256:db2859669859781a307825ea41f6f07809ab710b8fa3fac26f098111553224c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AQY76V7DKD5CC47XAESFT2XPVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Sorrachai Yingchareonthawornchai, Thatchaphol Saranurak","submitted_at":"2019-05-14T00:46:31Z","abstract_excerpt":"We present a new, simple, algorithm for the local vertex connectivity problem (LocalVC) introduced by Nanongkai~et~al. [STOC'19]. Roughly, given an undirected unweighted graph $G$, a seed vertex $x$, a target volume $\\nu$, and a target separator size $k$, the goal of LocalVC is to remove $k$ vertices `near' $x$ (in terms of $\\nu$) to disconnect the graph in `local time', which depends only on parameters $\\nu$ and $k$. In this paper, we present a simple randomized algorithm with running time $O(\\nu k^2)$ and correctness probability $2/3$.\n  Plugging our new localVC algorithm in the generic fram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05329","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":""},"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-05-17T23:41:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3KkN0hygHZP/gj48x7oXze0WY6jM+NuxWRp8emdU3pXgJAatuTJBF9OEzfACU5R7UDL6Tj9ML/fuUMnvqTqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:27:45.314710Z"},"content_sha256":"6959a019ca7aa481d4b8433cbaad00eb4041e4bbd488a6ef585f8b5d69b6188a","schema_version":"1.0","event_id":"sha256:6959a019ca7aa481d4b8433cbaad00eb4041e4bbd488a6ef585f8b5d69b6188a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQY76V7DKD5CC47XAESFT2XPVN/bundle.json","state_url":"https://pith.science/pith/AQY76V7DKD5CC47XAESFT2XPVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQY76V7DKD5CC47XAESFT2XPVN/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-05-27T09:27:45Z","links":{"resolver":"https://pith.science/pith/AQY76V7DKD5CC47XAESFT2XPVN","bundle":"https://pith.science/pith/AQY76V7DKD5CC47XAESFT2XPVN/bundle.json","state":"https://pith.science/pith/AQY76V7DKD5CC47XAESFT2XPVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQY76V7DKD5CC47XAESFT2XPVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AQY76V7DKD5CC47XAESFT2XPVN","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":"715e1145c881a95dc4626f0173ffec745b7458ea99ca175b1b3657b8794793c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T00:46:31Z","title_canon_sha256":"ab953326b080df4a552a1f7a20645acf1aa7032209224f0158d94144e71ade0b"},"schema_version":"1.0","source":{"id":"1905.05329","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05329","created_at":"2026-05-17T23:41:21Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05329v2","created_at":"2026-05-17T23:41:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05329","created_at":"2026-05-17T23:41:21Z"},{"alias_kind":"pith_short_12","alias_value":"AQY76V7DKD5C","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AQY76V7DKD5CC47X","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AQY76V7D","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:6959a019ca7aa481d4b8433cbaad00eb4041e4bbd488a6ef585f8b5d69b6188a","target":"graph","created_at":"2026-05-17T23:41:21Z","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"},"paper":{"abstract_excerpt":"We present a new, simple, algorithm for the local vertex connectivity problem (LocalVC) introduced by Nanongkai~et~al. [STOC'19]. Roughly, given an undirected unweighted graph $G$, a seed vertex $x$, a target volume $\\nu$, and a target separator size $k$, the goal of LocalVC is to remove $k$ vertices `near' $x$ (in terms of $\\nu$) to disconnect the graph in `local time', which depends only on parameters $\\nu$ and $k$. In this paper, we present a simple randomized algorithm with running time $O(\\nu k^2)$ and correctness probability $2/3$.\n  Plugging our new localVC algorithm in the generic fram","authors_text":"Danupon Nanongkai, Sorrachai Yingchareonthawornchai, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T00:46:31Z","title":"Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05329","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:db2859669859781a307825ea41f6f07809ab710b8fa3fac26f098111553224c6","target":"record","created_at":"2026-05-17T23:41:21Z","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":"715e1145c881a95dc4626f0173ffec745b7458ea99ca175b1b3657b8794793c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T00:46:31Z","title_canon_sha256":"ab953326b080df4a552a1f7a20645acf1aa7032209224f0158d94144e71ade0b"},"schema_version":"1.0","source":{"id":"1905.05329","kind":"arxiv","version":2}},"canonical_sha256":"0431ff57e350fa2173f7012459eaefab5a6535eaee8d3b131b094f0665c6ccde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0431ff57e350fa2173f7012459eaefab5a6535eaee8d3b131b094f0665c6ccde","first_computed_at":"2026-05-17T23:41:21.641043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:21.641043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EqX+BFp5dKpzWxLAf6fFf0TBAegUNNInNE4i8ePQNsV4CfbQPudL3sgTrJ4MHyx2GZS6b/JxtBTR2EMomuZ6Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:21.641775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05329","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db2859669859781a307825ea41f6f07809ab710b8fa3fac26f098111553224c6","sha256:6959a019ca7aa481d4b8433cbaad00eb4041e4bbd488a6ef585f8b5d69b6188a"],"state_sha256":"69d71c8b7b6afaba566d640f6cf485edadf8e40e4921f2c606b355e0305cebab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mx+t1fqaCnRhVzCfKNVl+GL5lr8ZMHpG/yP4peCvCzdIXQcccBCTrm6qAOX3qBqqgz1yOHM0vS3kT1H2M0yOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:27:45.318147Z","bundle_sha256":"5ec8409b3ec340240e3182f49d7bb5c09608b567cdfe06838cc36919295ec4bc"}}