{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6EDGS2YB2HK2TJXCPKF7QX4SPL","short_pith_number":"pith:6EDGS2YB","canonical_record":{"source":{"id":"1012.5710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-28T07:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"16218fd900dd83765085f2a19f0902472824dfb6cc084d4bcf855b372a7f8795","abstract_canon_sha256":"9c1bfea33d430ef0099d70b76fbc086c76e85ce2006bbfed0ac3a4409c2b4ec4"},"schema_version":"1.0"},"canonical_sha256":"f106696b01d1d5a9a6e27a8bf85f927affafd4acb9f122bba5852ada3918c36a","source":{"kind":"arxiv","id":"1012.5710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5710","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5710v1","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5710","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"6EDGS2YB2HK2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6EDGS2YB2HK2TJXC","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6EDGS2YB","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6EDGS2YB2HK2TJXCPKF7QX4SPL","target":"record","payload":{"canonical_record":{"source":{"id":"1012.5710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-28T07:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"16218fd900dd83765085f2a19f0902472824dfb6cc084d4bcf855b372a7f8795","abstract_canon_sha256":"9c1bfea33d430ef0099d70b76fbc086c76e85ce2006bbfed0ac3a4409c2b4ec4"},"schema_version":"1.0"},"canonical_sha256":"f106696b01d1d5a9a6e27a8bf85f927affafd4acb9f122bba5852ada3918c36a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:22.444954Z","signature_b64":"IgCjWpvpk1YZAt+Yc6V/WhVr/uYN8xPXjOihoeV8pf2Ibgk1Bqo5AxF22myEgO5rY7ebJZOMted9GL3T2JaUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f106696b01d1d5a9a6e27a8bf85f927affafd4acb9f122bba5852ada3918c36a","last_reissued_at":"2026-05-18T04:32:22.444400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:22.444400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.5710","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-18T04:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ql9yropQzuCf876R3lXDIUjGwICsN9Yhv5wBgM1m/tqEF174VrjToSld5+LZvAGGiZcQld40PS3NzWvzCHE0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:03:39.234374Z"},"content_sha256":"b619f8f2c0f885850457a1790cccd7404dd1474b66cd53500f72e677566e3fd9","schema_version":"1.0","event_id":"sha256:b619f8f2c0f885850457a1790cccd7404dd1474b66cd53500f72e677566e3fd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6EDGS2YB2HK2TJXCPKF7QX4SPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized connectivity of complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shasha Li, Wei Li, Xueliang Li","submitted_at":"2010-12-28T07:48:14Z","abstract_excerpt":"Let $G$ be a nontrivial connected graph of order $n$, and $k$ an integer with $2\\leq k\\leq n$. For a set $S$ of $k$ vertices of $G$, let $\\kappa (S)$ denote the maximum number $\\ell$ of edge-disjoint trees $T_1,T_2,...,T_\\ell$ in $G$ such that $V(T_i)\\cap V(T_j)=S$ for every pair $i,j$ of distinct integers with $1\\leq i,j\\leq \\ell$. Chartrand et al. generalized the concept of connectivity as follows: The $k$-$connectivity$, denoted by $\\kappa_k(G)$, of $G$ is defined by $\\kappa_k(G)=$min$\\{\\kappa(S)\\}$, where the minimum is taken over all $k$-subsets $S$ of $V(G)$. Thus $\\kappa_2(G)=\\kappa(G)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5710","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-18T04:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMyvBSWFMHoE1eehvvOaXMeXoGt29Jj4RaMuZ+Lw9Ocq0dNvxkXpL9XbvPLZ0Ca8SdK9aql01AfU8u1NmyXACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:03:39.234722Z"},"content_sha256":"7cfd9f796b789e5b926147cb781d62027abbfc4401f9328abe576e54c4d16f0c","schema_version":"1.0","event_id":"sha256:7cfd9f796b789e5b926147cb781d62027abbfc4401f9328abe576e54c4d16f0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL/bundle.json","state_url":"https://pith.science/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL/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-01T20:03:39Z","links":{"resolver":"https://pith.science/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL","bundle":"https://pith.science/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL/bundle.json","state":"https://pith.science/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EDGS2YB2HK2TJXCPKF7QX4SPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6EDGS2YB2HK2TJXCPKF7QX4SPL","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":"9c1bfea33d430ef0099d70b76fbc086c76e85ce2006bbfed0ac3a4409c2b4ec4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-28T07:48:14Z","title_canon_sha256":"16218fd900dd83765085f2a19f0902472824dfb6cc084d4bcf855b372a7f8795"},"schema_version":"1.0","source":{"id":"1012.5710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5710","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5710v1","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5710","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"6EDGS2YB2HK2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6EDGS2YB2HK2TJXC","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6EDGS2YB","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:7cfd9f796b789e5b926147cb781d62027abbfc4401f9328abe576e54c4d16f0c","target":"graph","created_at":"2026-05-18T04:32:22Z","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":"Let $G$ be a nontrivial connected graph of order $n$, and $k$ an integer with $2\\leq k\\leq n$. For a set $S$ of $k$ vertices of $G$, let $\\kappa (S)$ denote the maximum number $\\ell$ of edge-disjoint trees $T_1,T_2,...,T_\\ell$ in $G$ such that $V(T_i)\\cap V(T_j)=S$ for every pair $i,j$ of distinct integers with $1\\leq i,j\\leq \\ell$. Chartrand et al. generalized the concept of connectivity as follows: The $k$-$connectivity$, denoted by $\\kappa_k(G)$, of $G$ is defined by $\\kappa_k(G)=$min$\\{\\kappa(S)\\}$, where the minimum is taken over all $k$-subsets $S$ of $V(G)$. Thus $\\kappa_2(G)=\\kappa(G)$","authors_text":"Shasha Li, Wei Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-28T07:48:14Z","title":"The generalized connectivity of complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5710","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:b619f8f2c0f885850457a1790cccd7404dd1474b66cd53500f72e677566e3fd9","target":"record","created_at":"2026-05-18T04:32:22Z","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":"9c1bfea33d430ef0099d70b76fbc086c76e85ce2006bbfed0ac3a4409c2b4ec4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-28T07:48:14Z","title_canon_sha256":"16218fd900dd83765085f2a19f0902472824dfb6cc084d4bcf855b372a7f8795"},"schema_version":"1.0","source":{"id":"1012.5710","kind":"arxiv","version":1}},"canonical_sha256":"f106696b01d1d5a9a6e27a8bf85f927affafd4acb9f122bba5852ada3918c36a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f106696b01d1d5a9a6e27a8bf85f927affafd4acb9f122bba5852ada3918c36a","first_computed_at":"2026-05-18T04:32:22.444400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:22.444400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IgCjWpvpk1YZAt+Yc6V/WhVr/uYN8xPXjOihoeV8pf2Ibgk1Bqo5AxF22myEgO5rY7ebJZOMted9GL3T2JaUCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:22.444954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b619f8f2c0f885850457a1790cccd7404dd1474b66cd53500f72e677566e3fd9","sha256:7cfd9f796b789e5b926147cb781d62027abbfc4401f9328abe576e54c4d16f0c"],"state_sha256":"8707e4d0261945f1748f111fef2fe41d02987fe70c9e8bf8ea71178397752c8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEZejhn+ND8QsTTpIst1cd4HoMOF+6tBjrj1zSiyE9cQHNX94ARlS3mg4Zyqjskwku1ut8h78uR3M4B5hEgfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:03:39.236650Z","bundle_sha256":"bf7c08dcf1bb3ef6020e8ffa162b4eeae8a2ef3de135bc06ffe1912fa92b950f"}}