{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JGEWDWKE4MRNZBLQOFWFL5BK5F","short_pith_number":"pith:JGEWDWKE","schema_version":"1.0","canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","source":{"kind":"arxiv","id":"1101.3811","version":3},"attestation_state":"computed","paper":{"title":"The minimal size of a graph with generalized connectivity $\\kappa_3 = 2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shasha Li, Xueliang Li, Yongtang Shi","submitted_at":"2011-01-20T02:30:24Z","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)$,"},"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":"1101.3811","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T02:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"deb31439c66e8a7cfe960680aea054b3f2aef9c64a9d6b585b588135014bed93","abstract_canon_sha256":"615f5d1f171567f75b999cb5cd6c8200371b68fccbea10eda6fa538b3bb3632f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:51.202704Z","signature_b64":"ND/jFVW3FiJmro+oqbSe8XYfYGUAUhXvWWaEjKlbRyoWFGw2a/AyjWOhQDCZyyG+b6ZEEnSSPOv+kABSs7esDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"498961d944e322dc8570716c55f42ae958998202123d08e863feacc8f3f82abb","last_reissued_at":"2026-05-18T02:22:51.202107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:51.202107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimal size of a graph with generalized connectivity $\\kappa_3 = 2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shasha Li, Xueliang Li, Yongtang Shi","submitted_at":"2011-01-20T02:30:24Z","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":"1101.3811","kind":"arxiv","version":3},"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":"1101.3811","created_at":"2026-05-18T02:22:51.202199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3811v3","created_at":"2026-05-18T02:22:51.202199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3811","created_at":"2026-05-18T02:22:51.202199+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGEWDWKE4MRN","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGEWDWKE4MRNZBLQ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGEWDWKE","created_at":"2026-05-18T12:26:32.869790+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/JGEWDWKE4MRNZBLQOFWFL5BK5F","json":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F.json","graph_json":"https://pith.science/api/pith-number/JGEWDWKE4MRNZBLQOFWFL5BK5F/graph.json","events_json":"https://pith.science/api/pith-number/JGEWDWKE4MRNZBLQOFWFL5BK5F/events.json","paper":"https://pith.science/paper/JGEWDWKE"},"agent_actions":{"view_html":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F","download_json":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F.json","view_paper":"https://pith.science/paper/JGEWDWKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3811&json=true","fetch_graph":"https://pith.science/api/pith-number/JGEWDWKE4MRNZBLQOFWFL5BK5F/graph.json","fetch_events":"https://pith.science/api/pith-number/JGEWDWKE4MRNZBLQOFWFL5BK5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/action/storage_attestation","attest_author":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/action/author_attestation","sign_citation":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/action/citation_signature","submit_replication":"https://pith.science/pith/JGEWDWKE4MRNZBLQOFWFL5BK5F/action/replication_record"}},"created_at":"2026-05-18T02:22:51.202199+00:00","updated_at":"2026-05-18T02:22:51.202199+00:00"}