{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KKXERURG2PGHCRF57A5RVULQXK","short_pith_number":"pith:KKXERURG","canonical_record":{"source":{"id":"1112.0127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-01T10:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"15102b00859da5183afa7f6a12836951c478520f35e5326d9e5ce428f2be6dc9","abstract_canon_sha256":"7004de5c5827267b1b07ae88d20c85d27537580939e6c84c6cb89073ee2d4986"},"schema_version":"1.0"},"canonical_sha256":"52ae48d226d3cc7144bdf83b1ad170bab9b23007aaadc7faf5a178676b2f4881","source":{"kind":"arxiv","id":"1112.0127","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0127","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0127v3","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0127","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"KKXERURG2PGH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KKXERURG2PGHCRF5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KKXERURG","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KKXERURG2PGHCRF57A5RVULQXK","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-01T10:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"15102b00859da5183afa7f6a12836951c478520f35e5326d9e5ce428f2be6dc9","abstract_canon_sha256":"7004de5c5827267b1b07ae88d20c85d27537580939e6c84c6cb89073ee2d4986"},"schema_version":"1.0"},"canonical_sha256":"52ae48d226d3cc7144bdf83b1ad170bab9b23007aaadc7faf5a178676b2f4881","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:46.669458Z","signature_b64":"+kUAdplvDttfv6m+S3epaZQdDgzJQOH8maHdMEZgSRXsUVLQDxNU9wDgyxXntZ3Jg1Ziz2338O3yCtZ5qCUFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52ae48d226d3cc7144bdf83b1ad170bab9b23007aaadc7faf5a178676b2f4881","last_reissued_at":"2026-05-18T03:25:46.668637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:46.668637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0127","source_version":3,"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:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tR85Y1QeWV+utmMFlHDbYBpV1vnybQMx6H5Iioa+joZhwlGdeaA6loQ4IuoAZpsV9Be+8eAuEhz2PW7fGc+ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:01:31.847453Z"},"content_sha256":"56f592deac777c6de6fbb460cbfd1262ba2207fe3f5c54698f1eecf1753b711e","schema_version":"1.0","event_id":"sha256:56f592deac777c6de6fbb460cbfd1262ba2207fe3f5c54698f1eecf1753b711e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KKXERURG2PGHCRF57A5RVULQXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the generalized (edge-)connectivity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao, Yuefang Sun","submitted_at":"2011-12-01T10:10:49Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\\lambda_k(G)$. For general $k$, the generalized $k$-edge-connectivity of a complete graph is obtained. For $k\\geq 3$, tight upper and lower bounds of $\\kappa_k(G)$ and $\\lambda_k(G)$ are given for a connected graph $G$ of order $n$, that is, $1\\leq \\kappa_k(G)\\leq n-\\lceil\\frac{k}{2}\\rceil$ and $1\\leq \\lambda_k(G)\\leq n-\\lceil\\frac{k}{2}\\rceil$. Graphs of order $n$ such that $\\kappa_k(G)=n-\\lceil\\frac{k}{2}\\rceil$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0127","kind":"arxiv","version":3},"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:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1Qu3O86PtXXo8BYQJQX04OpsE7kwOKK91PQkgA7I5vLdTKD6ydCY+aT7B189OcWq+FHiuzx5j+YVfbrj+7uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:01:31.847794Z"},"content_sha256":"373a7e8134e859137d3f48df3f58232ab9daf9b3d6f4e367f8c2d5aff05b7800","schema_version":"1.0","event_id":"sha256:373a7e8134e859137d3f48df3f58232ab9daf9b3d6f4e367f8c2d5aff05b7800"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKXERURG2PGHCRF57A5RVULQXK/bundle.json","state_url":"https://pith.science/pith/KKXERURG2PGHCRF57A5RVULQXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKXERURG2PGHCRF57A5RVULQXK/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-01T16:01:31Z","links":{"resolver":"https://pith.science/pith/KKXERURG2PGHCRF57A5RVULQXK","bundle":"https://pith.science/pith/KKXERURG2PGHCRF57A5RVULQXK/bundle.json","state":"https://pith.science/pith/KKXERURG2PGHCRF57A5RVULQXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKXERURG2PGHCRF57A5RVULQXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KKXERURG2PGHCRF57A5RVULQXK","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":"7004de5c5827267b1b07ae88d20c85d27537580939e6c84c6cb89073ee2d4986","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-01T10:10:49Z","title_canon_sha256":"15102b00859da5183afa7f6a12836951c478520f35e5326d9e5ce428f2be6dc9"},"schema_version":"1.0","source":{"id":"1112.0127","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0127","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0127v3","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0127","created_at":"2026-05-18T03:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"KKXERURG2PGH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KKXERURG2PGHCRF5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KKXERURG","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:373a7e8134e859137d3f48df3f58232ab9daf9b3d6f4e367f8c2d5aff05b7800","target":"graph","created_at":"2026-05-18T03:25:46Z","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 Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\\lambda_k(G)$. For general $k$, the generalized $k$-edge-connectivity of a complete graph is obtained. For $k\\geq 3$, tight upper and lower bounds of $\\kappa_k(G)$ and $\\lambda_k(G)$ are given for a connected graph $G$ of order $n$, that is, $1\\leq \\kappa_k(G)\\leq n-\\lceil\\frac{k}{2}\\rceil$ and $1\\leq \\lambda_k(G)\\leq n-\\lceil\\frac{k}{2}\\rceil$. Graphs of order $n$ such that $\\kappa_k(G)=n-\\lceil\\frac{k}{2}\\rceil$","authors_text":"Xueliang Li, Yaping Mao, Yuefang Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-01T10:10:49Z","title":"On the generalized (edge-)connectivity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0127","kind":"arxiv","version":3},"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:56f592deac777c6de6fbb460cbfd1262ba2207fe3f5c54698f1eecf1753b711e","target":"record","created_at":"2026-05-18T03:25:46Z","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":"7004de5c5827267b1b07ae88d20c85d27537580939e6c84c6cb89073ee2d4986","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-01T10:10:49Z","title_canon_sha256":"15102b00859da5183afa7f6a12836951c478520f35e5326d9e5ce428f2be6dc9"},"schema_version":"1.0","source":{"id":"1112.0127","kind":"arxiv","version":3}},"canonical_sha256":"52ae48d226d3cc7144bdf83b1ad170bab9b23007aaadc7faf5a178676b2f4881","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52ae48d226d3cc7144bdf83b1ad170bab9b23007aaadc7faf5a178676b2f4881","first_computed_at":"2026-05-18T03:25:46.668637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:46.668637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+kUAdplvDttfv6m+S3epaZQdDgzJQOH8maHdMEZgSRXsUVLQDxNU9wDgyxXntZ3Jg1Ziz2338O3yCtZ5qCUFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:46.669458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0127","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f592deac777c6de6fbb460cbfd1262ba2207fe3f5c54698f1eecf1753b711e","sha256:373a7e8134e859137d3f48df3f58232ab9daf9b3d6f4e367f8c2d5aff05b7800"],"state_sha256":"6781aed6b72debd7ad542d01cbfe39d37c40759bbfd1f920a958ad5ce95ab5a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgjLLKZJqvbuBNufDcst4sX1ftC9DJqLoY8LrsD9DY8T2MbghMhDP9waomK1woS22c2fOAaswMPfjgU/BB/7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:01:31.849598Z","bundle_sha256":"d540b7bcb25a9cdfa3f1a78e0b314a156a8cc87127cd101f32c2649fa27856c1"}}