{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MUJM6OKFNCCYSVEW2WBN6QKZRS","short_pith_number":"pith:MUJM6OKF","canonical_record":{"source":{"id":"1304.6153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-23T02:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"f56d3faa326de1eab0296151f643d45c782c87172d02d8be85bde1011525cc0f","abstract_canon_sha256":"ede974e4a6ad45b4d79ab04ff2db526f67c10e3d3b73250284b7bd8a5363e229"},"schema_version":"1.0"},"canonical_sha256":"6512cf39456885895496d582df41598cb5b9e732f82bf8617d0cd2219a1ac607","source":{"kind":"arxiv","id":"1304.6153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6153","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6153v1","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6153","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"MUJM6OKFNCCY","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUJM6OKFNCCYSVEW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUJM6OKF","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MUJM6OKFNCCYSVEW2WBN6QKZRS","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-23T02:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"f56d3faa326de1eab0296151f643d45c782c87172d02d8be85bde1011525cc0f","abstract_canon_sha256":"ede974e4a6ad45b4d79ab04ff2db526f67c10e3d3b73250284b7bd8a5363e229"},"schema_version":"1.0"},"canonical_sha256":"6512cf39456885895496d582df41598cb5b9e732f82bf8617d0cd2219a1ac607","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:22.271284Z","signature_b64":"L8BX6DLhK8UzvY/hhv3urLLtjRGgRdKK/oP67PD0KrEarfOa5YX6Qa84VlBZSKaxFgkdVWGxa42TAPXcpA9iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6512cf39456885895496d582df41598cb5b9e732f82bf8617d0cd2219a1ac607","last_reissued_at":"2026-05-18T03:27:22.270588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:22.270588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6153","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:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkBFv7QcU9ELlPfbNOMzxQ4515srCl19VHVyv7v691qnvSCeAdzMSJH7j3xWG+Yms0E5+k8/GmkiOshCXD9eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:09:31.579422Z"},"content_sha256":"d03ed2adee63d4a586befc2306e53226e17850280df14c2e304715e2577cb39d","schema_version":"1.0","event_id":"sha256:d03ed2adee63d4a586befc2306e53226e17850280df14c2e304715e2577cb39d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MUJM6OKFNCCYSVEW2WBN6QKZRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further hardness results on the generalized connectivity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Chen, Mengmeng Liu, Xueliang Li, Yaping Mao","submitted_at":"2013-04-23T02:50:34Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of generalized edge-connectivity for a graph. In this paper, we determine the computational complexity of the generalized connectivity and generalized edge-connectivity of a graph. Two conjectures are also proved to be true."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6153","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:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuX0otxmTou2ZTZ4Cg6CJOTLeNbi4O+v5x51Cf8Ra2WlQdS6g7e5UdH+YG5dItgh3k9e4y1cdhOInPNv/LvOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:09:31.579768Z"},"content_sha256":"58c86b3e78f1540a5c0b8a60c6fa2cc7285e9269725ebdaf004fdcd547118c4f","schema_version":"1.0","event_id":"sha256:58c86b3e78f1540a5c0b8a60c6fa2cc7285e9269725ebdaf004fdcd547118c4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS/bundle.json","state_url":"https://pith.science/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS/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-01T21:09:31Z","links":{"resolver":"https://pith.science/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS","bundle":"https://pith.science/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS/bundle.json","state":"https://pith.science/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUJM6OKFNCCYSVEW2WBN6QKZRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MUJM6OKFNCCYSVEW2WBN6QKZRS","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":"ede974e4a6ad45b4d79ab04ff2db526f67c10e3d3b73250284b7bd8a5363e229","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-23T02:50:34Z","title_canon_sha256":"f56d3faa326de1eab0296151f643d45c782c87172d02d8be85bde1011525cc0f"},"schema_version":"1.0","source":{"id":"1304.6153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6153","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6153v1","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6153","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"MUJM6OKFNCCY","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUJM6OKFNCCYSVEW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUJM6OKF","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:58c86b3e78f1540a5c0b8a60c6fa2cc7285e9269725ebdaf004fdcd547118c4f","target":"graph","created_at":"2026-05-18T03:27: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":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of generalized edge-connectivity for a graph. In this paper, we determine the computational complexity of the generalized connectivity and generalized edge-connectivity of a graph. Two conjectures are also proved to be true.","authors_text":"Lily Chen, Mengmeng Liu, Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-23T02:50:34Z","title":"Further hardness results on the generalized connectivity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6153","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:d03ed2adee63d4a586befc2306e53226e17850280df14c2e304715e2577cb39d","target":"record","created_at":"2026-05-18T03:27: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":"ede974e4a6ad45b4d79ab04ff2db526f67c10e3d3b73250284b7bd8a5363e229","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-23T02:50:34Z","title_canon_sha256":"f56d3faa326de1eab0296151f643d45c782c87172d02d8be85bde1011525cc0f"},"schema_version":"1.0","source":{"id":"1304.6153","kind":"arxiv","version":1}},"canonical_sha256":"6512cf39456885895496d582df41598cb5b9e732f82bf8617d0cd2219a1ac607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6512cf39456885895496d582df41598cb5b9e732f82bf8617d0cd2219a1ac607","first_computed_at":"2026-05-18T03:27:22.270588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:22.270588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L8BX6DLhK8UzvY/hhv3urLLtjRGgRdKK/oP67PD0KrEarfOa5YX6Qa84VlBZSKaxFgkdVWGxa42TAPXcpA9iCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:22.271284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d03ed2adee63d4a586befc2306e53226e17850280df14c2e304715e2577cb39d","sha256:58c86b3e78f1540a5c0b8a60c6fa2cc7285e9269725ebdaf004fdcd547118c4f"],"state_sha256":"d7accf4213735c29d43714ae77cc8b4fafc19f3cbdd90a20ecadb19a64fd82bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3rcZHpUSP5aIL8JnJ73699WczYvLi2J9Qr1GZ0ri8nZsYzAUY6iG4fG62zkbSKEZA42uOvICjHLZP9oZ0jYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:09:31.581727Z","bundle_sha256":"d2269be6dbe7648046fef5160720c18eec1bc86ba038145167cc3ca50a26e1ee"}}