{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CAIDSPBPFN27FCVXP4WHTM4WM2","short_pith_number":"pith:CAIDSPBP","schema_version":"1.0","canonical_sha256":"1010393c2f2b75f28ab77f2c79b39666a9346e718c384d3ad0be30961a9d6a18","source":{"kind":"arxiv","id":"1307.1772","version":1},"attestation_state":"computed","paper":{"title":"Simpler Sequential and Parallel Biconnectivity Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"N.Sadagopan, Surabhi Jain","submitted_at":"2013-07-06T12:18:55Z","abstract_excerpt":"For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph $G$ with vertex connectivity $k (k \\geq 1)$, the connectivity augmentation refers to a set $S$ of edges whose augmentation to $G$ increases its vertex connectivity by one. A minimum connectivity augmentation of $G$ is the one in which $S$ is minimum. In this paper, we focus our attention on connectivity augmentation of"},"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":"1307.1772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-06T12:18:55Z","cross_cats_sorted":[],"title_canon_sha256":"5e546eb786474bb3ee3351525a7d66662b5283722966e1d99f1b598074ccc72e","abstract_canon_sha256":"575e99856a2f63119c5b650357252aad9d609b1011e67e8e12f376aff85a7f04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:03.562511Z","signature_b64":"0iSCDdMgC7vUTPcqaD7yDAmjK7FN3x4lr8OgCwyD77WIwGLQGygGzZA4PpeMjH6CGI+Fc1CrnMz8m+NWQOEfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1010393c2f2b75f28ab77f2c79b39666a9346e718c384d3ad0be30961a9d6a18","last_reissued_at":"2026-05-18T03:19:03.561806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:03.561806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simpler Sequential and Parallel Biconnectivity Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"N.Sadagopan, Surabhi Jain","submitted_at":"2013-07-06T12:18:55Z","abstract_excerpt":"For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph $G$ with vertex connectivity $k (k \\geq 1)$, the connectivity augmentation refers to a set $S$ of edges whose augmentation to $G$ increases its vertex connectivity by one. A minimum connectivity augmentation of $G$ is the one in which $S$ is minimum. In this paper, we focus our attention on connectivity augmentation of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1772","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.1772","created_at":"2026-05-18T03:19:03.561933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1772v1","created_at":"2026-05-18T03:19:03.561933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1772","created_at":"2026-05-18T03:19:03.561933+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAIDSPBPFN27","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAIDSPBPFN27FCVX","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAIDSPBP","created_at":"2026-05-18T12:27:40.988391+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/CAIDSPBPFN27FCVXP4WHTM4WM2","json":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2.json","graph_json":"https://pith.science/api/pith-number/CAIDSPBPFN27FCVXP4WHTM4WM2/graph.json","events_json":"https://pith.science/api/pith-number/CAIDSPBPFN27FCVXP4WHTM4WM2/events.json","paper":"https://pith.science/paper/CAIDSPBP"},"agent_actions":{"view_html":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2","download_json":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2.json","view_paper":"https://pith.science/paper/CAIDSPBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1772&json=true","fetch_graph":"https://pith.science/api/pith-number/CAIDSPBPFN27FCVXP4WHTM4WM2/graph.json","fetch_events":"https://pith.science/api/pith-number/CAIDSPBPFN27FCVXP4WHTM4WM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2/action/storage_attestation","attest_author":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2/action/author_attestation","sign_citation":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2/action/citation_signature","submit_replication":"https://pith.science/pith/CAIDSPBPFN27FCVXP4WHTM4WM2/action/replication_record"}},"created_at":"2026-05-18T03:19:03.561933+00:00","updated_at":"2026-05-18T03:19:03.561933+00:00"}