{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z3JZRCU3NZAS54H7LN2XNIWZLG","short_pith_number":"pith:Z3JZRCU3","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"},"canonical_sha256":"ced3988a9b6e412ef0ff5b7576a2d959826d3b49fe48ae2f4d1eb0045a67f937","source":{"kind":"arxiv","id":"1207.1838","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1838","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1838v10","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1838","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"Z3JZRCU3NZAS","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z3JZRCU3NZAS54H7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z3JZRCU3","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z3JZRCU3NZAS54H7LN2XNIWZLG","target":"record","payload":{"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"},"canonical_sha256":"ced3988a9b6e412ef0ff5b7576a2d959826d3b49fe48ae2f4d1eb0045a67f937","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"},"source_kind":"arxiv","source_id":"1207.1838","source_version":10,"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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"je3w6RLbjXL74ci+iar23CCETMH2tWuz79CwLA3Cf7QaCuOfHIYHECxuV1p87q8sS9oL/+8053gsD/NnMDT4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:33:49.633740Z"},"content_sha256":"58816a27757dd07e2d357188c49cde803897051a9c143e35abe2c558d5c3680b","schema_version":"1.0","event_id":"sha256:58816a27757dd07e2d357188c49cde803897051a9c143e35abe2c558d5c3680b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z3JZRCU3NZAS54H7LN2XNIWZLG","target":"graph","payload":{"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"},"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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wONOJdWEE2WrLc3f7vHfijXrc0rClzSyE2wytdGQc+gnoFfYXKnfrDwYtz3Ggxroz/+i74Eg/6iHgo/1GqecAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:33:49.634114Z"},"content_sha256":"9486c0e6ac9a493fc2515796e7a16c07875da1f663661de56e991f11241d21bf","schema_version":"1.0","event_id":"sha256:9486c0e6ac9a493fc2515796e7a16c07875da1f663661de56e991f11241d21bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/bundle.json","state_url":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/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-06-01T15:33:49Z","links":{"resolver":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG","bundle":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/bundle.json","state":"https://pith.science/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3JZRCU3NZAS54H7LN2XNIWZLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z3JZRCU3NZAS54H7LN2XNIWZLG","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":"f4efa77ae57476a8331ecd1fcecaea220c808b1aa165519170a73349d7412a26","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-08T04:40:12Z","title_canon_sha256":"d9c8d9e44a864dc0a2e1e527e3c532bdb30622bba1c13be91ec3242bfc535207"},"schema_version":"1.0","source":{"id":"1207.1838","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1838","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1838v10","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1838","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"Z3JZRCU3NZAS","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z3JZRCU3NZAS54H7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z3JZRCU3","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:9486c0e6ac9a493fc2515796e7a16c07875da1f663661de56e991f11241d21bf","target":"graph","created_at":"2026-05-18T01:34:36Z","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 $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","authors_text":"Xueliang Li, Yaping Mao","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-08T04:40:12Z","title":"A survey on the generalized connectivity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1838","kind":"arxiv","version":10},"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:58816a27757dd07e2d357188c49cde803897051a9c143e35abe2c558d5c3680b","target":"record","created_at":"2026-05-18T01:34:36Z","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":"f4efa77ae57476a8331ecd1fcecaea220c808b1aa165519170a73349d7412a26","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-08T04:40:12Z","title_canon_sha256":"d9c8d9e44a864dc0a2e1e527e3c532bdb30622bba1c13be91ec3242bfc535207"},"schema_version":"1.0","source":{"id":"1207.1838","kind":"arxiv","version":10}},"canonical_sha256":"ced3988a9b6e412ef0ff5b7576a2d959826d3b49fe48ae2f4d1eb0045a67f937","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ced3988a9b6e412ef0ff5b7576a2d959826d3b49fe48ae2f4d1eb0045a67f937","first_computed_at":"2026-05-18T01:34:36.168128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:36.168128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hx5oY7Sopg5vJ27OzCpko4Erz+daNGi1Z67EYGMociSvkL/fwIeQp2fVfq4kNB2Z6rN6OG0Ha8BRifxW7vivCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:36.168817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1838","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58816a27757dd07e2d357188c49cde803897051a9c143e35abe2c558d5c3680b","sha256:9486c0e6ac9a493fc2515796e7a16c07875da1f663661de56e991f11241d21bf"],"state_sha256":"256ddb948965544971f44aefa5cc500662b58991eafa784fb1c1fa852b5ae748"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLEn2H9Y6Rf33rzyWCoDK/Y9Icsb7dTQ3GeO/j+pHjaid3CRkFLrVwjvA7g+CCoOw//1K6Y39aEMssP6p7KGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:33:49.636025Z","bundle_sha256":"901a0376685948849032ad6bb23b2f4571f741f0b9f8bf4a310098f1a938d1e5"}}