Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:38274 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.86) (envelope-from ) id 1bpgsn-00031I-An for jbovlaste-admin@lojban.org; Thu, 29 Sep 2016 12:20:42 -0700 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Thu, 29 Sep 2016 12:20:37 -0700 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Added At Word anseingu -- By krtisfranks Date: Thu, 29 Sep 2016 12:20:37 -0700 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Message-Id: X-Spam-Score: 0.5 (/) X-Spam_score: 0.5 X-Spam_score_int: 5 X-Spam_bar: / X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has NOT identified this incoming email as spam. The original message has been attached to this so you can view it or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: In jbovlaste, the user krtisfranks has added a definition of "anseingu" in the language "English". New Data: Definition: $x_1$ (node in a tree graph) and $x_2$ (node in the same tree graph) have an essentially-unique most recent (graph-nearest) common ancestor node A such that $x_3$ [nonnegative integer; li] is $d($A$, x_1)$ and such that $x_4$ [nonnegative integer; li] is $d($A$, x_2)$,  where $d$ is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction). [...] Content analysis details: (0.5 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked. See http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block for more information. [URIs: lojban.org] 1.4 RCVD_IN_BRBL_LASTEXT RBL: No description available. [173.13.139.235 listed in bb.barracudacentral.org] -1.9 BAYES_00 BODY: Bayes spam probability is 0 to 1% [score: 0.0007] 1.0 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS In jbovlaste, the user krtisfranks has added a definition of "anseingu" in the language "English". New Data: Definition: $x_1$ (node in a tree graph) and $x_2$ (node in the same tree graph) have an essentially-unique most recent (graph-nearest) common ancestor node A such that $x_3$ [nonnegative integer; li] is $d($A$, x_1)$ and such that $x_4$ [nonnegative integer; li] is $d($A$, x_2)$,  where $d$ is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction). Notes: This word is much like {tseingu} except the focus is on the relationships between $x_1$ and $x_2$ each with their mutual most recent common ancestor. For nodes $x_1$ and $x_2$ in a tree, $(x_3,x_4)$ is named by Curtis Franks to be the "ancestance between $x_1$ and $x_2$ (in that order)". In order to preserve meaning, mutual exchange of $x_1$ and/with $x_2$ must necessitate or be necessitated by mutual exchange of $x_3$ and/with $x_4$. Jargon: Gloss Keywords: Word: ancestance, In Sense: C. Franks's neologism, genealogy Place Keywords: You can go to to see it.