{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CKUBQ7WJUHJPDFPIDKFDC55H7N","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":"b5042bebaf5f66b25109897948585f658dab3ed6c76c9590a0790eea6eef25df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T05:40:07Z","title_canon_sha256":"35fd3a0cd18822bb2c448678882ac2b035834cf6a4ad66936ab42c5005f41125"},"schema_version":"1.0","source":{"id":"1303.5171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5171","created_at":"2026-05-18T03:30:14Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5171v1","created_at":"2026-05-18T03:30:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5171","created_at":"2026-05-18T03:30:14Z"},{"alias_kind":"pith_short_12","alias_value":"CKUBQ7WJUHJP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CKUBQ7WJUHJPDFPI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CKUBQ7WJ","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:15dce9d3fca2751526e7179855922781584cddc46f2d6aa6bf5ce162642f93aa","target":"graph","created_at":"2026-05-18T03:30: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"},"paper":{"abstract_excerpt":"The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$, and $\\kappa(S)$ be defined as the largest number of internally disjoint trees $T_1, T_2, \\cdots, T_k$ connecting $S$ in $G$. Then for an integer $r$ with $2 \\leq r \\leq n$, the {\\it generalized $r$-connectivity} $\\kappa_r(G)$ of $G$ is the minimum $\\kappa(S)$ where $S$ runs over all the $r$-subsets of the vertex set of $G$. Obviously, $\\kappa_2(G)=\\kappa(G)$, is the vertex connectivity of $G$, and hence the generalized connectivity is a natural generalization of the vert","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T05:40:07Z","title":"The generalized 3-connectivity of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5171","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:298d322acc93f204c8bdf5315dd6c60d5c673a28af69f345a80a0985ee8f00d0","target":"record","created_at":"2026-05-18T03:30: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":"b5042bebaf5f66b25109897948585f658dab3ed6c76c9590a0790eea6eef25df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T05:40:07Z","title_canon_sha256":"35fd3a0cd18822bb2c448678882ac2b035834cf6a4ad66936ab42c5005f41125"},"schema_version":"1.0","source":{"id":"1303.5171","kind":"arxiv","version":1}},"canonical_sha256":"12a8187ec9a1d2f195e81a8a3177a7fb5277b6ae447e9572aceda9a74880ad3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12a8187ec9a1d2f195e81a8a3177a7fb5277b6ae447e9572aceda9a74880ad3d","first_computed_at":"2026-05-18T03:30:14.292303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:14.292303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3GjtyCaGp+KskAjtxLg2eQ/KxvKR3eTY6/sHGSR6QudgpKduPn3M5rKhfu9MLCSKaUGmODEYP8D9XE8laZzfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:14.293118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:298d322acc93f204c8bdf5315dd6c60d5c673a28af69f345a80a0985ee8f00d0","sha256:15dce9d3fca2751526e7179855922781584cddc46f2d6aa6bf5ce162642f93aa"],"state_sha256":"f269fffa3522aaac6c189faca69c468073a8d7e8eb92b400a913edc740556416"}