{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VTF6TTWEGSDOCP5W5PLCDJ7JDA","short_pith_number":"pith:VTF6TTWE","schema_version":"1.0","canonical_sha256":"accbe9cec43486e13fb6ebd621a7e91826b75117d589db619f195cb2efe8ceae","source":{"kind":"arxiv","id":"1808.10074","version":1},"attestation_state":"computed","paper":{"title":"The generalized connectivity of some regular graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rong-Xia Hao, Shu-Li Zhao","submitted_at":"2018-08-30T00:44:06Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. 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\\subse"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.10074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-30T00:44:06Z","cross_cats_sorted":[],"title_canon_sha256":"cbddd60dfefb544dc82574cddcc67b9d283fc9375f4ae9a7934d9ebfdb30bf4e","abstract_canon_sha256":"c8a3e618722758f19e93a878f70958d4ba578ec8bdd582c460601d72cce6594a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:49.916679Z","signature_b64":"Lp6J0l50NF7VIF9LewfIlfEJS5UhGfIpITNEsz2SpZfsXB+04nd//nFdVmNfBsMPWmEfpKDUG5E9XC1Ao96jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"accbe9cec43486e13fb6ebd621a7e91826b75117d589db619f195cb2efe8ceae","last_reissued_at":"2026-05-18T00:06:49.915987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:49.915987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The generalized connectivity of some regular graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rong-Xia Hao, Shu-Li Zhao","submitted_at":"2018-08-30T00:44:06Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. 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\\subse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10074","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.10074","created_at":"2026-05-18T00:06:49.916087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10074v1","created_at":"2026-05-18T00:06:49.916087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10074","created_at":"2026-05-18T00:06:49.916087+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTF6TTWEGSDO","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTF6TTWEGSDOCP5W","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTF6TTWE","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA","json":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA.json","graph_json":"https://pith.science/api/pith-number/VTF6TTWEGSDOCP5W5PLCDJ7JDA/graph.json","events_json":"https://pith.science/api/pith-number/VTF6TTWEGSDOCP5W5PLCDJ7JDA/events.json","paper":"https://pith.science/paper/VTF6TTWE"},"agent_actions":{"view_html":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA","download_json":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA.json","view_paper":"https://pith.science/paper/VTF6TTWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10074&json=true","fetch_graph":"https://pith.science/api/pith-number/VTF6TTWEGSDOCP5W5PLCDJ7JDA/graph.json","fetch_events":"https://pith.science/api/pith-number/VTF6TTWEGSDOCP5W5PLCDJ7JDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA/action/storage_attestation","attest_author":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA/action/author_attestation","sign_citation":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA/action/citation_signature","submit_replication":"https://pith.science/pith/VTF6TTWEGSDOCP5W5PLCDJ7JDA/action/replication_record"}},"created_at":"2026-05-18T00:06:49.916087+00:00","updated_at":"2026-05-18T00:06:49.916087+00:00"}