{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:36HCF46OKGVFPV4PIC4NATPPZ4","short_pith_number":"pith:36HCF46O","canonical_record":{"source":{"id":"1805.02437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T10:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"8622e8870a206a22053f54e9a1c6276bfedfac74fd0d4e9af1114761e5e40b2e","abstract_canon_sha256":"9a91f2545d052066049b7f4d04c17191d8dc20ed768114f1f13c719c705baf01"},"schema_version":"1.0"},"canonical_sha256":"df8e22f3ce51aa57d78f40b8d04defcf1de463ad988ef500299e5adecf74ee61","source":{"kind":"arxiv","id":"1805.02437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02437","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02437v1","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02437","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"36HCF46OKGVF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36HCF46OKGVFPV4P","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36HCF46O","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:36HCF46OKGVFPV4PIC4NATPPZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T10:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"8622e8870a206a22053f54e9a1c6276bfedfac74fd0d4e9af1114761e5e40b2e","abstract_canon_sha256":"9a91f2545d052066049b7f4d04c17191d8dc20ed768114f1f13c719c705baf01"},"schema_version":"1.0"},"canonical_sha256":"df8e22f3ce51aa57d78f40b8d04defcf1de463ad988ef500299e5adecf74ee61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:39.902301Z","signature_b64":"aesJNokNKWYenoGM3tktAjTjz4UWdpvPhffBd76Fdw3xpThOwkm1NFqePGYh7U9YHUkxDrntmvXBRFwCKWkkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df8e22f3ce51aa57d78f40b8d04defcf1de463ad988ef500299e5adecf74ee61","last_reissued_at":"2026-05-18T00:16:39.901830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:39.901830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02437","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-18T00:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDeg+XBvqy9Is3MZaW73cs5HIGmC6Z6Vvdi77ib8YriSDPnNtaQ6s+11N3E5P3t3pkuYcgkKT0+WwxEXXiopAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:32:46.605523Z"},"content_sha256":"089e12c419e64497b928f44713ef59ffc55a0fb6c8085ae0fd03b544f151d682","schema_version":"1.0","event_id":"sha256:089e12c419e64497b928f44713ef59ffc55a0fb6c8085ae0fd03b544f151d682"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:36HCF46OKGVFPV4PIC4NATPPZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized connectivity of $(n,k)$-bubble-sort graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lidong Wu, Rong-Xia Hao, Shu-Li Zhao","submitted_at":"2018-05-07T10:53:21Z","abstract_excerpt":"Let $S\\subseteq V(G)$ and $\\kappa_{G}(S)$ denote the maximum number $r$ of edge-disjoint trees $T_1, T_2, \\cdots, T_r$ in $G$ such that $V(T_i)\\bigcap V(T_{j})=S$ for any $i, j \\in \\{1, 2, \\cdots, r\\}$ and $i\\neq j$. For an integer $k$ with $2\\leq k\\leq n$, the {\\em generalized $k$-connectivity} of a graph $G$ is defined as $\\kappa_{k}(G)= min\\{\\kappa_{G}(S)|S\\subseteq V(G)$ and $|S|=k\\}$. The generalized $k$-connectivity is a generalization of the traditional connectivity. In this paper, the generalized $3$-connectivity of the $(n,k)$-bubble-sort graph $B_{n,k}$ is studied for $2\\leq k\\leq n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02437","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-18T00:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFtlyB82gRlqYEgkkU7DG2LdGc4z/T841uIABP8BtBeVrKL59MnqzU4ob16yxv1hZ1HdIZSxA7No1KgkvwL7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:32:46.605854Z"},"content_sha256":"4cd8a65d0ac2be0d5f3c85e9169e620758032818d3bbb823e1695b3bc2a18444","schema_version":"1.0","event_id":"sha256:4cd8a65d0ac2be0d5f3c85e9169e620758032818d3bbb823e1695b3bc2a18444"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36HCF46OKGVFPV4PIC4NATPPZ4/bundle.json","state_url":"https://pith.science/pith/36HCF46OKGVFPV4PIC4NATPPZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36HCF46OKGVFPV4PIC4NATPPZ4/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-08T09:32:46Z","links":{"resolver":"https://pith.science/pith/36HCF46OKGVFPV4PIC4NATPPZ4","bundle":"https://pith.science/pith/36HCF46OKGVFPV4PIC4NATPPZ4/bundle.json","state":"https://pith.science/pith/36HCF46OKGVFPV4PIC4NATPPZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36HCF46OKGVFPV4PIC4NATPPZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:36HCF46OKGVFPV4PIC4NATPPZ4","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":"9a91f2545d052066049b7f4d04c17191d8dc20ed768114f1f13c719c705baf01","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T10:53:21Z","title_canon_sha256":"8622e8870a206a22053f54e9a1c6276bfedfac74fd0d4e9af1114761e5e40b2e"},"schema_version":"1.0","source":{"id":"1805.02437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02437","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02437v1","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02437","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"36HCF46OKGVF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36HCF46OKGVFPV4P","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36HCF46O","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:4cd8a65d0ac2be0d5f3c85e9169e620758032818d3bbb823e1695b3bc2a18444","target":"graph","created_at":"2026-05-18T00:16:39Z","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 $S\\subseteq V(G)$ and $\\kappa_{G}(S)$ denote the maximum number $r$ of edge-disjoint trees $T_1, T_2, \\cdots, T_r$ in $G$ such that $V(T_i)\\bigcap V(T_{j})=S$ for any $i, j \\in \\{1, 2, \\cdots, r\\}$ and $i\\neq j$. For an integer $k$ with $2\\leq k\\leq n$, the {\\em generalized $k$-connectivity} of a graph $G$ is defined as $\\kappa_{k}(G)= min\\{\\kappa_{G}(S)|S\\subseteq V(G)$ and $|S|=k\\}$. The generalized $k$-connectivity is a generalization of the traditional connectivity. In this paper, the generalized $3$-connectivity of the $(n,k)$-bubble-sort graph $B_{n,k}$ is studied for $2\\leq k\\leq n-","authors_text":"Lidong Wu, Rong-Xia Hao, Shu-Li Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T10:53:21Z","title":"The generalized connectivity of $(n,k)$-bubble-sort graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02437","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:089e12c419e64497b928f44713ef59ffc55a0fb6c8085ae0fd03b544f151d682","target":"record","created_at":"2026-05-18T00:16:39Z","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":"9a91f2545d052066049b7f4d04c17191d8dc20ed768114f1f13c719c705baf01","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T10:53:21Z","title_canon_sha256":"8622e8870a206a22053f54e9a1c6276bfedfac74fd0d4e9af1114761e5e40b2e"},"schema_version":"1.0","source":{"id":"1805.02437","kind":"arxiv","version":1}},"canonical_sha256":"df8e22f3ce51aa57d78f40b8d04defcf1de463ad988ef500299e5adecf74ee61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df8e22f3ce51aa57d78f40b8d04defcf1de463ad988ef500299e5adecf74ee61","first_computed_at":"2026-05-18T00:16:39.901830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:39.901830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aesJNokNKWYenoGM3tktAjTjz4UWdpvPhffBd76Fdw3xpThOwkm1NFqePGYh7U9YHUkxDrntmvXBRFwCKWkkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:39.902301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:089e12c419e64497b928f44713ef59ffc55a0fb6c8085ae0fd03b544f151d682","sha256:4cd8a65d0ac2be0d5f3c85e9169e620758032818d3bbb823e1695b3bc2a18444"],"state_sha256":"a3460e96b7cc0812448b7c08363d0af391682c583aa5201aed15d249f21c5603"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f1kS1ei0VpwT8q+Z/cBEQZOw0C5VF7utHvQ2+gzcDDpZLMEqNoIiGlwegr59Q0q8jpYnLaNjDFBrYuLSsKwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:32:46.608027Z","bundle_sha256":"e58b5222d310b9f8f284d1b5fba970e1de7e4cdbeaa2de3e8800199057ba215d"}}