{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N55FSJCVRZWT4MNYKPME42UTE6","short_pith_number":"pith:N55FSJCV","canonical_record":{"source":{"id":"1212.6692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-30T07:58:52Z","cross_cats_sorted":[],"title_canon_sha256":"4e34f2687c23d080b557374997df6b75dfad68293a03a8568ad0c032ef38b13f","abstract_canon_sha256":"5321938ba7c248d9501bea9220e1a8d3d536ec9a9f188e7d1d2bb977ca10c959"},"schema_version":"1.0"},"canonical_sha256":"6f7a5924558e6d3e31b853d84e6a93278cfd595e16ad6f0e51d4a7b1859b7104","source":{"kind":"arxiv","id":"1212.6692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6692","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6692v1","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6692","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"pith_short_12","alias_value":"N55FSJCVRZWT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N55FSJCVRZWT4MNY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N55FSJCV","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N55FSJCVRZWT4MNYKPME42UTE6","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-30T07:58:52Z","cross_cats_sorted":[],"title_canon_sha256":"4e34f2687c23d080b557374997df6b75dfad68293a03a8568ad0c032ef38b13f","abstract_canon_sha256":"5321938ba7c248d9501bea9220e1a8d3d536ec9a9f188e7d1d2bb977ca10c959"},"schema_version":"1.0"},"canonical_sha256":"6f7a5924558e6d3e31b853d84e6a93278cfd595e16ad6f0e51d4a7b1859b7104","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:31.188186Z","signature_b64":"wtxBShwmm3vaYeOIzNBbsb2aWilkTY0Xrrtg2A10Vyr7/Lnr3wBdgehGnFizequctS7k0nqOaQGv0t13yCdGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f7a5924558e6d3e31b853d84e6a93278cfd595e16ad6f0e51d4a7b1859b7104","last_reissued_at":"2026-05-18T03:37:31.187468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:31.187468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6692","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-18T03:37:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUtS3IjfmZ0Z5xsLPp8PAPKwJKz1WojW9OtXO9YpQSofsoHsGaMfVJfw743nNmQcSCe+nT8cmgop1noSiTnEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:58:23.874835Z"},"content_sha256":"4fdba4bb57fb48beff7cea45c60adefde64d2d218419101b78f60af0c4785d83","schema_version":"1.0","event_id":"sha256:4fdba4bb57fb48beff7cea45c60adefde64d2d218419101b78f60af0c4785d83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N55FSJCVRZWT4MNYKPME42UTE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum-type results for 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","submitted_at":"2012-12-30T07:58:52Z","abstract_excerpt":"Let $G$ be a graph, $S$ be a set of vertices of $G$, and $\\lambda(S)$ be the maximum number $\\ell$ of pairwise edge-disjoint trees $T_1, T_2,..., T_{\\ell}$ in $G$ such that $S\\subseteq V(T_i)$ for every $1\\leq i\\leq \\ell$. The generalized $k$-edge-connectivity $\\lambda_k(G)$ of $G$ is defined as $\\lambda_k(G)= min\\{\\lambda(S) | S\\subseteq V(G) \\ and \\ |S|=k\\}$. Thus $\\lambda_2(G)=\\lambda(G)$. In this paper, we consider the Nordhaus-Gaddum-type results for the parameter $\\lambda_k(G)$. We determine sharp upper and lower bounds of $\\lambda_k(G)+\\lambda_k(\\bar{G})$ and $\\lambda_k(G)... \\lambda_k("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6692","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-18T03:37:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeD0MI83vDuBkzgG3MwN59BOProHuNhaYzQEhX2Lik8JH9sM4CdzEAtZfy2wIByk9dI0HL7GVl9UbIxKnczTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:58:23.875196Z"},"content_sha256":"67783291730005620a0315e4d8b55a13a2fb22cad6ec3abbb0be6b730ac52c46","schema_version":"1.0","event_id":"sha256:67783291730005620a0315e4d8b55a13a2fb22cad6ec3abbb0be6b730ac52c46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N55FSJCVRZWT4MNYKPME42UTE6/bundle.json","state_url":"https://pith.science/pith/N55FSJCVRZWT4MNYKPME42UTE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N55FSJCVRZWT4MNYKPME42UTE6/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-01T18:58:23Z","links":{"resolver":"https://pith.science/pith/N55FSJCVRZWT4MNYKPME42UTE6","bundle":"https://pith.science/pith/N55FSJCVRZWT4MNYKPME42UTE6/bundle.json","state":"https://pith.science/pith/N55FSJCVRZWT4MNYKPME42UTE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N55FSJCVRZWT4MNYKPME42UTE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N55FSJCVRZWT4MNYKPME42UTE6","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":"5321938ba7c248d9501bea9220e1a8d3d536ec9a9f188e7d1d2bb977ca10c959","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-30T07:58:52Z","title_canon_sha256":"4e34f2687c23d080b557374997df6b75dfad68293a03a8568ad0c032ef38b13f"},"schema_version":"1.0","source":{"id":"1212.6692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6692","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6692v1","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6692","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"pith_short_12","alias_value":"N55FSJCVRZWT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N55FSJCVRZWT4MNY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N55FSJCV","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:67783291730005620a0315e4d8b55a13a2fb22cad6ec3abbb0be6b730ac52c46","target":"graph","created_at":"2026-05-18T03:37:31Z","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 graph, $S$ be a set of vertices of $G$, and $\\lambda(S)$ be the maximum number $\\ell$ of pairwise edge-disjoint trees $T_1, T_2,..., T_{\\ell}$ in $G$ such that $S\\subseteq V(T_i)$ for every $1\\leq i\\leq \\ell$. The generalized $k$-edge-connectivity $\\lambda_k(G)$ of $G$ is defined as $\\lambda_k(G)= min\\{\\lambda(S) | S\\subseteq V(G) \\ and \\ |S|=k\\}$. Thus $\\lambda_2(G)=\\lambda(G)$. In this paper, we consider the Nordhaus-Gaddum-type results for the parameter $\\lambda_k(G)$. We determine sharp upper and lower bounds of $\\lambda_k(G)+\\lambda_k(\\bar{G})$ and $\\lambda_k(G)... \\lambda_k(","authors_text":"Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-30T07:58:52Z","title":"Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6692","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:4fdba4bb57fb48beff7cea45c60adefde64d2d218419101b78f60af0c4785d83","target":"record","created_at":"2026-05-18T03:37:31Z","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":"5321938ba7c248d9501bea9220e1a8d3d536ec9a9f188e7d1d2bb977ca10c959","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-30T07:58:52Z","title_canon_sha256":"4e34f2687c23d080b557374997df6b75dfad68293a03a8568ad0c032ef38b13f"},"schema_version":"1.0","source":{"id":"1212.6692","kind":"arxiv","version":1}},"canonical_sha256":"6f7a5924558e6d3e31b853d84e6a93278cfd595e16ad6f0e51d4a7b1859b7104","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f7a5924558e6d3e31b853d84e6a93278cfd595e16ad6f0e51d4a7b1859b7104","first_computed_at":"2026-05-18T03:37:31.187468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:31.187468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wtxBShwmm3vaYeOIzNBbsb2aWilkTY0Xrrtg2A10Vyr7/Lnr3wBdgehGnFizequctS7k0nqOaQGv0t13yCdGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:31.188186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fdba4bb57fb48beff7cea45c60adefde64d2d218419101b78f60af0c4785d83","sha256:67783291730005620a0315e4d8b55a13a2fb22cad6ec3abbb0be6b730ac52c46"],"state_sha256":"73d61eb38c5f80e1aa10a50c07960d06bd1dd4c61ecc90e6571ef9420a0edfae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0BkGiUGY2foxg8Cvc4/qDlOWfqm2WAtrHmm9E3OYK9wBWzF22XhjxiXFerwn/bZp3gJPYhAHBwsbgIt3Wv8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:58:23.877054Z","bundle_sha256":"d6f2436248eb0c71391f17a679c4f8108d70fe3ed0a44b452ea1c11d8afd2bd5"}}