{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CKUBQ7WJUHJPDFPIDKFDC55H7N","short_pith_number":"pith:CKUBQ7WJ","canonical_record":{"source":{"id":"1303.5171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T05:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"35fd3a0cd18822bb2c448678882ac2b035834cf6a4ad66936ab42c5005f41125","abstract_canon_sha256":"b5042bebaf5f66b25109897948585f658dab3ed6c76c9590a0790eea6eef25df"},"schema_version":"1.0"},"canonical_sha256":"12a8187ec9a1d2f195e81a8a3177a7fb5277b6ae447e9572aceda9a74880ad3d","source":{"kind":"arxiv","id":"1303.5171","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CKUBQ7WJUHJPDFPIDKFDC55H7N","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T05:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"35fd3a0cd18822bb2c448678882ac2b035834cf6a4ad66936ab42c5005f41125","abstract_canon_sha256":"b5042bebaf5f66b25109897948585f658dab3ed6c76c9590a0790eea6eef25df"},"schema_version":"1.0"},"canonical_sha256":"12a8187ec9a1d2f195e81a8a3177a7fb5277b6ae447e9572aceda9a74880ad3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:14.293118Z","signature_b64":"3GjtyCaGp+KskAjtxLg2eQ/KxvKR3eTY6/sHGSR6QudgpKduPn3M5rKhfu9MLCSKaUGmODEYP8D9XE8laZzfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12a8187ec9a1d2f195e81a8a3177a7fb5277b6ae447e9572aceda9a74880ad3d","last_reissued_at":"2026-05-18T03:30:14.292303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:14.292303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5171","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-18T03:30:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaUgJ+uo3GW20oA5hze2c3BLPidi8fnEi0AQzgh8bQsZ/X8PPKkAsHLPyKCQiTxQOgjM2WVLuL4Nic+WL0L4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:47:43.535047Z"},"content_sha256":"298d322acc93f204c8bdf5315dd6c60d5c673a28af69f345a80a0985ee8f00d0","schema_version":"1.0","event_id":"sha256:298d322acc93f204c8bdf5315dd6c60d5c673a28af69f345a80a0985ee8f00d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CKUBQ7WJUHJPDFPIDKFDC55H7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized 3-connectivity of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","submitted_at":"2013-03-21T05:40:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5171","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-18T03:30:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tg04lYa9Tt0v47RvBeIWMfw0HY7WOU4rLOXjRfT7vTWaRknRkjDRh2SrtKNYjZLRlPp3IEY48THbrhugWvYfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:47:43.535753Z"},"content_sha256":"15dce9d3fca2751526e7179855922781584cddc46f2d6aa6bf5ce162642f93aa","schema_version":"1.0","event_id":"sha256:15dce9d3fca2751526e7179855922781584cddc46f2d6aa6bf5ce162642f93aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N/bundle.json","state_url":"https://pith.science/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N/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-25T15:47:43Z","links":{"resolver":"https://pith.science/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N","bundle":"https://pith.science/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N/bundle.json","state":"https://pith.science/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKUBQ7WJUHJPDFPIDKFDC55H7N/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ipxwdZBu3vZ2i51qJC80ZQVKPIFqHUaLGHFCpJ/7wh/8DJLvu/bGEsedmP69wPjAWCf4yrCyl4eDa8WeOhhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:47:43.540942Z","bundle_sha256":"a0135caf207d7e1cb2a241ae72591335681e9a0adfc00f9b6fb5f6a00a3efb4f"}}