{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:O6TIHE3P42BIDH2LA7EBXMAENC","short_pith_number":"pith:O6TIHE3P","schema_version":"1.0","canonical_sha256":"77a683936fe682819f4b07c81bb00468b340d26e0a03993923b9d1d791e344ff","source":{"kind":"arxiv","id":"1103.6095","version":4},"attestation_state":"computed","paper":{"title":"The generalized 3-connectivity of Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yuefang Sun","submitted_at":"2011-03-31T06:31:04Z","abstract_excerpt":"The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let $S$ be a nonempty set of vertices of $G$, a collection $\\{T_1,T_2,...,T_r\\}$ 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 $k$-connectivity $\\kappa_k(G)$ of $G$ is the greatest positive integer $r$ for which $G$ contains at least $r$ internally disjo"},"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":"1103.6095","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-31T06:31:04Z","cross_cats_sorted":[],"title_canon_sha256":"449eb3b4348ee611a2db0b0859632e5d579ae99ed626ddb0711f8991c41db499","abstract_canon_sha256":"7c72ca8c57d3d31234662db057627f4e8a57c2e96a7a6707dc04457ee16dbbb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.403809Z","signature_b64":"gh9m7CHpfymUvpTNJc6WVzkyu/6x5jF8udeimKJ+IHL58nBRLNot9DOeLaHL3+uBcK4sTl114oIQcx9aI4HPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77a683936fe682819f4b07c81bb00468b340d26e0a03993923b9d1d791e344ff","last_reissued_at":"2026-05-18T04:23:11.403398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.403398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The generalized 3-connectivity of Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yuefang Sun","submitted_at":"2011-03-31T06:31:04Z","abstract_excerpt":"The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let $S$ be a nonempty set of vertices of $G$, a collection $\\{T_1,T_2,...,T_r\\}$ 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 $k$-connectivity $\\kappa_k(G)$ of $G$ is the greatest positive integer $r$ for which $G$ contains at least $r$ internally disjo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6095","kind":"arxiv","version":4},"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":"1103.6095","created_at":"2026-05-18T04:23:11.403469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.6095v4","created_at":"2026-05-18T04:23:11.403469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6095","created_at":"2026-05-18T04:23:11.403469+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6TIHE3P42BI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6TIHE3P42BIDH2L","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6TIHE3P","created_at":"2026-05-18T12:26:37.096874+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/O6TIHE3P42BIDH2LA7EBXMAENC","json":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC.json","graph_json":"https://pith.science/api/pith-number/O6TIHE3P42BIDH2LA7EBXMAENC/graph.json","events_json":"https://pith.science/api/pith-number/O6TIHE3P42BIDH2LA7EBXMAENC/events.json","paper":"https://pith.science/paper/O6TIHE3P"},"agent_actions":{"view_html":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC","download_json":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC.json","view_paper":"https://pith.science/paper/O6TIHE3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.6095&json=true","fetch_graph":"https://pith.science/api/pith-number/O6TIHE3P42BIDH2LA7EBXMAENC/graph.json","fetch_events":"https://pith.science/api/pith-number/O6TIHE3P42BIDH2LA7EBXMAENC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC/action/storage_attestation","attest_author":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC/action/author_attestation","sign_citation":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC/action/citation_signature","submit_replication":"https://pith.science/pith/O6TIHE3P42BIDH2LA7EBXMAENC/action/replication_record"}},"created_at":"2026-05-18T04:23:11.403469+00:00","updated_at":"2026-05-18T04:23:11.403469+00:00"}