{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SRWM4VBRAOVRORPZTJKLB3VDFZ","short_pith_number":"pith:SRWM4VBR","canonical_record":{"source":{"id":"1608.01971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-05T18:52:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0d96b9a35e8eb8377a9c187018e2c05557f4182c518917fc11f7ef02a5f18bc7","abstract_canon_sha256":"53460f6e4344ba0715ba62c5f70677ab48d7991bff3a14af0350affeeee59e1f"},"schema_version":"1.0"},"canonical_sha256":"946cce543103ab1745f99a54b0eea32e567a6bae03357537a48cea9a7552b7cb","source":{"kind":"arxiv","id":"1608.01971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01971","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01971v1","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01971","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"SRWM4VBRAOVR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRWM4VBRAOVRORPZ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRWM4VBR","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SRWM4VBRAOVRORPZTJKLB3VDFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-05T18:52:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0d96b9a35e8eb8377a9c187018e2c05557f4182c518917fc11f7ef02a5f18bc7","abstract_canon_sha256":"53460f6e4344ba0715ba62c5f70677ab48d7991bff3a14af0350affeeee59e1f"},"schema_version":"1.0"},"canonical_sha256":"946cce543103ab1745f99a54b0eea32e567a6bae03357537a48cea9a7552b7cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:44.124072Z","signature_b64":"+XAcx/hHt6Ru21Xa0QFs2MHWwcIXa3rmEDFXIqZEcZVe2nptbNLBX7+nq1LVgYh1hglj9SvCaOAPBJqpbUcPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"946cce543103ab1745f99a54b0eea32e567a6bae03357537a48cea9a7552b7cb","last_reissued_at":"2026-05-18T01:09:44.123370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:44.123370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01971","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-05-18T01:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3aKJ5kpZfgvGVL/eIeyP2F9QU99uIq+lGNiRbVbgWWCbXFtRhnM/jRnrhUqabTxqws5fLHqtnzU24zqE6diDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:43:39.180892Z"},"content_sha256":"6574db864feb0c1dac5cd9b73fee0ec1b6750f1a36bb3eb2d8a73725b95feb13","schema_version":"1.0","event_id":"sha256:6574db864feb0c1dac5cd9b73fee0ec1b6750f1a36bb3eb2d8a73725b95feb13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SRWM4VBRAOVRORPZTJKLB3VDFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"R-connectivity Augmentation in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Nitin Vivek Bharti, N.Sadagopan, S.Dhanalakshmi","submitted_at":"2016-08-05T18:52:32Z","abstract_excerpt":"A \\emph{vertex separator} of a connected graph $G$ is a set of vertices removing which will result in two or more connected components and a \\emph{minimum vertex separator} is a set which contains the minimum number of such vertices, i.e., the cardinality of this set is least among all possible vertex separator sets. The cardinality of the minimum vertex separator refers to the connectivity of the graph G. A connected graph is said to be $k-connected$ if removing exactly $k$ vertices, $ k\\geq 1$, from the graph, will result in two or more connected components and on removing any $(k-1)$ vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01971","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":""},"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-18T01:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiCqTmTM007l7MHtVFz+yIzgT0e7U8x3O4llYCg7MEo1AoyRTkfeQvP41yNd4B8hYo7S8P3LPXMEKg7ZTY8EAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:43:39.181486Z"},"content_sha256":"55748f797b1c04168bcdcd7f4025cd281945a0724c33ecc390fa11b6ac02aa48","schema_version":"1.0","event_id":"sha256:55748f797b1c04168bcdcd7f4025cd281945a0724c33ecc390fa11b6ac02aa48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ/bundle.json","state_url":"https://pith.science/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ/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-01T00:43:39Z","links":{"resolver":"https://pith.science/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ","bundle":"https://pith.science/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ/bundle.json","state":"https://pith.science/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRWM4VBRAOVRORPZTJKLB3VDFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SRWM4VBRAOVRORPZTJKLB3VDFZ","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":"53460f6e4344ba0715ba62c5f70677ab48d7991bff3a14af0350affeeee59e1f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-05T18:52:32Z","title_canon_sha256":"0d96b9a35e8eb8377a9c187018e2c05557f4182c518917fc11f7ef02a5f18bc7"},"schema_version":"1.0","source":{"id":"1608.01971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01971","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01971v1","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01971","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"SRWM4VBRAOVR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRWM4VBRAOVRORPZ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRWM4VBR","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:55748f797b1c04168bcdcd7f4025cd281945a0724c33ecc390fa11b6ac02aa48","target":"graph","created_at":"2026-05-18T01:09:44Z","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":"A \\emph{vertex separator} of a connected graph $G$ is a set of vertices removing which will result in two or more connected components and a \\emph{minimum vertex separator} is a set which contains the minimum number of such vertices, i.e., the cardinality of this set is least among all possible vertex separator sets. The cardinality of the minimum vertex separator refers to the connectivity of the graph G. A connected graph is said to be $k-connected$ if removing exactly $k$ vertices, $ k\\geq 1$, from the graph, will result in two or more connected components and on removing any $(k-1)$ vertic","authors_text":"Nitin Vivek Bharti, N.Sadagopan, S.Dhanalakshmi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-05T18:52:32Z","title":"R-connectivity Augmentation in Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01971","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:6574db864feb0c1dac5cd9b73fee0ec1b6750f1a36bb3eb2d8a73725b95feb13","target":"record","created_at":"2026-05-18T01:09:44Z","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":"53460f6e4344ba0715ba62c5f70677ab48d7991bff3a14af0350affeeee59e1f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-05T18:52:32Z","title_canon_sha256":"0d96b9a35e8eb8377a9c187018e2c05557f4182c518917fc11f7ef02a5f18bc7"},"schema_version":"1.0","source":{"id":"1608.01971","kind":"arxiv","version":1}},"canonical_sha256":"946cce543103ab1745f99a54b0eea32e567a6bae03357537a48cea9a7552b7cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"946cce543103ab1745f99a54b0eea32e567a6bae03357537a48cea9a7552b7cb","first_computed_at":"2026-05-18T01:09:44.123370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:44.123370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+XAcx/hHt6Ru21Xa0QFs2MHWwcIXa3rmEDFXIqZEcZVe2nptbNLBX7+nq1LVgYh1hglj9SvCaOAPBJqpbUcPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:44.124072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6574db864feb0c1dac5cd9b73fee0ec1b6750f1a36bb3eb2d8a73725b95feb13","sha256:55748f797b1c04168bcdcd7f4025cd281945a0724c33ecc390fa11b6ac02aa48"],"state_sha256":"87f6ee7cb612e674890f76874257b970c8368a0b33485f2019b392926220cde0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3mUiUY7oowksfcHxF/lNN9nrUqbXEjMk9FA4LDv1+Q4x5V7iG4JkJn5kDA3StsphlVpkjks7FvSlWlA9vReDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T00:43:39.184291Z","bundle_sha256":"b520fe5696edc5bdbb8aed3897f58328efc994dec54208aa0ca674e9e5aa2c1b"}}