{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z3JZRCU3NZAS54H7LN2XNIWZLG","short_pith_number":"pith:Z3JZRCU3","schema_version":"1.0","canonical_sha256":"ced3988a9b6e412ef0ff5b7576a2d959826d3b49fe48ae2f4d1eb0045a67f937","source":{"kind":"arxiv","id":"1207.1838","version":10},"attestation_state":"computed","paper":{"title":"A survey on the generalized connectivity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao","submitted_at":"2012-07-08T04:40:12Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept of generalized edge-connectivity $\\lambda_k(G)$, recently. In this paper we summarize the known results on the generalized connectivity and generalized edge-connectivity. After an introductory section, the paper is then divided into nine sections: the generalized (edge-)connectivity of some graph classes, algorithms and computational complexity, sharp bounds of $\\kappa_k(G)$ and $\\lambda_k(G)$, graphs with large generalized (edge-)connectivi"},"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":"1207.1838","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-08T04:40:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9c8d9e44a864dc0a2e1e527e3c532bdb30622bba1c13be91ec3242bfc535207","abstract_canon_sha256":"f4efa77ae57476a8331ecd1fcecaea220c808b1aa165519170a73349d7412a26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:36.168817Z","signature_b64":"Hx5oY7Sopg5vJ27OzCpko4Erz+daNGi1Z67EYGMociSvkL/fwIeQp2fVfq4kNB2Z6rN6OG0Ha8BRifxW7vivCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced3988a9b6e412ef0ff5b7576a2d959826d3b49fe48ae2f4d1eb0045a67f937","last_reissued_at":"2026-05-18T01:34:36.168128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:36.168128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A survey on the generalized connectivity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao","submitted_at":"2012-07-08T04:40:12Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept of generalized edge-connectivity $\\lambda_k(G)$, recently. In this paper we summarize the known results on the generalized connectivity and generalized edge-connectivity. After an introductory section, the paper is then divided into nine sections: the generalized (edge-)connectivity of some graph classes, algorithms and computational complexity, sharp bounds of $\\kappa_k(G)$ and $\\lambda_k(G)$, graphs with large generalized (edge-)connectivi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1838","kind":"arxiv","version":10},"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":"1207.1838","created_at":"2026-05-18T01:34:36.168230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1838v10","created_at":"2026-05-18T01:34:36.168230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1838","created_at":"2026-05-18T01:34:36.168230+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3JZRCU3NZAS","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3JZRCU3NZAS54H7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3JZRCU3","created_at":"2026-05-18T12:27:30.460161+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/Z3JZRCU3NZAS54H7LN2XNIWZLG","json":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG.json","graph_json":"https://pith.science/api/pith-number/Z3JZRCU3NZAS54H7LN2XNIWZLG/graph.json","events_json":"https://pith.science/api/pith-number/Z3JZRCU3NZAS54H7LN2XNIWZLG/events.json","paper":"https://pith.science/paper/Z3JZRCU3"},"agent_actions":{"view_html":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG","download_json":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG.json","view_paper":"https://pith.science/paper/Z3JZRCU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1838&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3JZRCU3NZAS54H7LN2XNIWZLG/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3JZRCU3NZAS54H7LN2XNIWZLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/action/storage_attestation","attest_author":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/action/author_attestation","sign_citation":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/action/citation_signature","submit_replication":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/action/replication_record"}},"created_at":"2026-05-18T01:34:36.168230+00:00","updated_at":"2026-05-18T01:34:36.168230+00:00"}