{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4QMW6KNHMXC26UBLMWFC7JFO23","short_pith_number":"pith:4QMW6KNH","schema_version":"1.0","canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","source":{"kind":"arxiv","id":"1201.2983","version":1},"attestation_state":"computed","paper":{"title":"Graphs with large generalized 3-connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun","submitted_at":"2012-01-14T03:39:01Z","abstract_excerpt":"Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\\cap E(T_j)= \\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for any pair of distinct integers $i, j$, where $1 \\leq i, j \\leq r$. For an integer $k$ with $2 \\leq k \\leq n$, the generalized $k$-connectivity $\\kappa_k(G)$ of $G$ is the greatest positive integer $r$ such that $G$ contains at least $r$ internally disjoint trees connecting $S$ for any set $S$ of $k$ vertices of $G$. Obviously, $\\kappa_2(G)$ is the connectivity of $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":"1201.2983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T03:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"8013ac427820cbb8a28acf6085c586811a6abbf3d45465281c6c9891bfb464b0","abstract_canon_sha256":"b0af589f49d423c573dbd154be0173d22246b2911bb4f50a4f8ccd178dfb7df3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:32.611862Z","signature_b64":"rCZ67D1nkYZX+7r2zxHhe/+Tsbm597aWOrq4ukbEwp0ZDuVnwJfnyFYVBQwJgOg6/Q/XUquSEQFtjUPTubiOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4196f29a765c5af502b658a2fa4aed6e7269b73379983135359bf344e28f998","last_reissued_at":"2026-05-18T04:04:32.611176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:32.611176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with large generalized 3-connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun","submitted_at":"2012-01-14T03:39:01Z","abstract_excerpt":"Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\\cap E(T_j)= \\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for any pair of distinct integers $i, j$, where $1 \\leq i, j \\leq r$. For an integer $k$ with $2 \\leq k \\leq n$, the generalized $k$-connectivity $\\kappa_k(G)$ of $G$ is the greatest positive integer $r$ such that $G$ contains at least $r$ internally disjoint trees connecting $S$ for any set $S$ of $k$ vertices of $G$. Obviously, $\\kappa_2(G)$ is the connectivity of $G$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2983","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":"1201.2983","created_at":"2026-05-18T04:04:32.611285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2983v1","created_at":"2026-05-18T04:04:32.611285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2983","created_at":"2026-05-18T04:04:32.611285+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QMW6KNHMXC2","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QMW6KNHMXC26UBL","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QMW6KNH","created_at":"2026-05-18T12:26:53.410803+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/4QMW6KNHMXC26UBLMWFC7JFO23","json":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23.json","graph_json":"https://pith.science/api/pith-number/4QMW6KNHMXC26UBLMWFC7JFO23/graph.json","events_json":"https://pith.science/api/pith-number/4QMW6KNHMXC26UBLMWFC7JFO23/events.json","paper":"https://pith.science/paper/4QMW6KNH"},"agent_actions":{"view_html":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23","download_json":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23.json","view_paper":"https://pith.science/paper/4QMW6KNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2983&json=true","fetch_graph":"https://pith.science/api/pith-number/4QMW6KNHMXC26UBLMWFC7JFO23/graph.json","fetch_events":"https://pith.science/api/pith-number/4QMW6KNHMXC26UBLMWFC7JFO23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/action/storage_attestation","attest_author":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/action/author_attestation","sign_citation":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/action/citation_signature","submit_replication":"https://pith.science/pith/4QMW6KNHMXC26UBLMWFC7JFO23/action/replication_record"}},"created_at":"2026-05-18T04:04:32.611285+00:00","updated_at":"2026-05-18T04:04:32.611285+00:00"}